Discover how to use Python--and some essential machine learning concepts--to build programs that can make recommendations. She helps you learn the concepts behind how recommendation systems work by taking you through a series of examples and exercises. Once you're familiar with the underlying concepts, Lillian explains how to apply statistical and machine learning methods to construct your own recommenders. She demonstrates how to build a popularity-based recommender using the Pandas library, how to recommend similar items based on correlation, and how to deploy various machine learning algorithms to make recommendations. At the end of the course, she shows how to evaluate which recommender performed the best.
Kim, Hideaki (NTT Communication Science Laboratories) | Iwata, Tomoharu (NTT Communication Science Laboratories) | Fujiwara, Yasuhiro (NTT Communication Science Laboratories) | Ueda, Naonori (NTT Communication Science Laboratories)
Everything has its time, which is also true in the point-of-interest (POI) recommendation task. A truly intelligent recommender system, even if you don't visit any sites or remain silent, should draw hints of your next destination from the silence", and revise its recommendations as needed. In this paper, we construct a well-timed POI recommender system that updates its recommendations in accordance with the silence, the temporal period in which no visits are made. To achieve this, we propose a novel probabilistic model to predict the joint probabilities of the user visiting POIs and their time-points, by using the admixture or mixed-membership structure to extend marked point processes. With the admixture structure, the proposed model obtains a low dimensional representation for each user, leading to robust recommendation against sparse observations. We also develop an efficient and easy-to-implement estimation algorithm for the proposed model based on collapsed Gibbs and slice sampling. We apply the proposed model to synthetic and real-world check-in data, and show that it performs well in the well-timed recommendation task.
Reading groups domain is a new domain for group recommenders. In this paper we propose a web based group recommender system which is called BoRGo: Book Recommender for Reading Groups, for reading groups domain. BoRGo uses a new information filtering technique which uses the difference between positive and negative feedbacks about a feature of a user profile and also presents an interface for after recommendation processes like achieving a consensus on the reading list.
They provide a personalized view of such spaces, prioritizing items likely to be of interest to the user. The field, christened in 1995, has grown enormously in the variety of problems addressed and techniques employed, as well as in its practical applications. Recommender systems research has incorporated a wide variety of artificial intelligence techniques including machine learning, data mining, user modeling, case-based reasoning, and constraint satisfaction, among others. Personalized recommendations are an important part of many online e-commerce applications such as Amazon.com, This wealth of practical application experience has provided inspiration to researchers to extend the reach of recommender systems into new and challenging areas.
Entry point: The item that the user chooses as a starting point can be considered a strongly positive preference, since the user is looking for something similar to it. Ending point: The final selection or buying decision can also be considered a positive rating. Tweaking: When a user critiques a returned item and moves on to something different, we can consider this a negative rating. Browsing: If the user navigates to other items in the returned set, we can consider this a weak negative rating: if the user truly liked the item he or she would probably not browse further. These heuristics are somewhat weak, since we sometimes find users who are exploring the system to see what it can do, applying tweaks not to get a specific recommendation, but to see what will come back.