Personal Assistant Systems
Sketching Techniques for Collaborative Filtering
Bachrach, Yoram (Microsoft Research Cambridge) | Porat, Ely (Bar Ilan University) | Rosenschein, Jeffrey S. (Hebrew University)
Recommender systems attempt to highlight items that a target user is likely to find interesting. A common technique is to use collaborative filtering (CF), where multiple users share information so as to provide each with effective recommendations. A key aspect of CF systems is finding users whose tastes accurately reflect the tastes of some target user. Typically, the system looks for other agents who have had experience with many of the items the target user has examined, and whose classification of these items has a strong correlation with the classifications of the target user. Since the universe of items may be enormous and huge data sets are involved, sophisticated methods must be used to quickly locate appropriate other agents. We present a method for quickly determining the proportional intersection between the items that each of two users has examined, by sending and maintaining extremely concise โsketchesโ of the list of items. These sketches enable the approximation of the proportional intersection within a distance of \epsilon, with a high probability of 1-\delta. Our sketching techniques are based on random minwise independent hash functions, and use very little space and time, so they are well-suited for use in large-scale collaborative filtering systems.
Rule Mining and Missing-Value Prediction in the Presence of Data Ambiguities
Wickramaratna, Kasun (University of Miami) | Kubat, Miroslav (University of Miami) | Premaratne, Kamal (University of Miami) | Wickramarathne, Thanuka (University of Miami)
The success of knowledge discovery in real-world domains often depends on our ability to handle data imperfections. Here we study this problem in the framework of association mining, seeking to identify frequent itemsets in transactional databases where the presence of some items in a given transaction is unknown. We want to use the frequent itemsets to predict "missing items": based on the partial contents of a shopping cart, predict what else will be added. We describe a technique that addresses this task, and report experiments illustrating its behavior.
Faith in the Algorithm, Part 2: Computational Eudaemonics
Rodriguez, Marko A., Watkins, Jennifer H.
Eudaemonics is the study of the nature, causes, and conditions of human well-being. According to the ethical theory of eudaemonia, reaping satisfaction and fulfillment from life is not only a desirable end, but a moral responsibility. However, in modern society, many individuals struggle to meet this responsibility. Computational mechanisms could better enable individuals to achieve eudaemonia by yielding practical real-world systems that embody algorithms that promote human flourishing. This article presents eudaemonic systems as the evolutionary goal of the present day recommender system.
Faith in the Algorithm, Part 1: Beyond the Turing Test
Rodriguez, Marko A., Pepe, Alberto
Since the Turing test was first proposed by Alan Turing in 1950, the primary goal of artificial intelligence has been predicated on the ability for computers to imitate human behavior. However, the majority of uses for the computer can be said to fall outside the domain of human abilities and it is exactly outside of this domain where computers have demonstrated their greatest contribution to intelligence. Another goal for artificial intelligence is one that is not predicated on human mimicry, but instead, on human amplification. This article surveys various systems that contribute to the advancement of human and social intelligence.
Preferences in Interactive Systems: Technical Challenges and Case Studies
Peintner, Bart (SRI International) | Viappiani, Paolo (University of Toronto) | Yorke-Smith, Neil (SRI International)
Interactive artificial intelligence systems employ preferences in both their reasoning and their interaction with the user. This survey considers preference handling in applications such as recommender systems, personal assistant agents, and personalized user interfaces. We survey the major questions and approaches, present illustrative examples, and give an outlook on potential benefits and challenges.
User-Involved Preference Elicitation for Product Search and Recommender Systems
Pu, Pearl (Ecole Polytechnique Fรฉdรฉrale de Lausanne (EPFL)) | Chen, Li (Ecole Polytechnique Fรฉdรฉrale de Lausanne (EPFL))
We address user system interaction issues in product search and recommender systems: how to help users select the most preferential item from a large collection of alternatives. As such systems must crucially rely on an accurate and complete model of user preferences, the acquisition of this model becomes the central subject of our paper. Many tools used today do not satisfactorily assist users to establish this model because they do not adequately focus on fundamental decision objectives, help them reveal hidden preferences, revise conflicting preferences, or explicitly reason about tradeoffs. In this article, we provide some analyses of common areas of design pitfalls and derive a set of design guidelines that assist the user in avoiding these problems in three important areas: user preference elicitation, preference revision, and explanation interfaces.
Preferences in Interactive Systems: Technical Challenges and Case Studies
Peintner, Bart (SRI International) | Viappiani, Paolo (University of Toronto) | Yorke-Smith, Neil (SRI International)
Interactive artificial intelligence systems employ preferences in both their reasoning and their interaction with the user. This survey considers preference handling in applications such as recommender systems, personal assistant agents, and personalized user interfaces. We survey the major questions and approaches, present illustrative examples, and give an outlook on potential benefits and challenges.
User-Involved Preference Elicitation for Product Search and Recommender Systems
Pu, Pearl (Ecole Polytechnique Fรฉdรฉrale de Lausanne (EPFL)) | Chen, Li (Ecole Polytechnique Fรฉdรฉrale de Lausanne (EPFL))
We address user system interaction issues in product search and recommender systems: how to help users select the most preferential item from a large collection of alternatives. As such systems must crucially rely on an accurate and complete model of user preferences, the acquisition of this model becomes the central subject of our paper. Many tools used today do not satisfactorily assist users to establish this model because they do not adequately focus on fundamental decision objectives, help them reveal hidden preferences, revise conflicting preferences, or explicitly reason about tradeoffs. As a result, users fail to find the outcomes that best satisfy their needs and preferences. In this article, we provide some analyses of common areas of design pitfalls and derive a set of design guidelines that assist the user in avoiding these problems in three important areas: user preference elicitation, preference revision, and explanation interfaces. For each area, we describe the state-of-the-art of the developed techniques and discuss concrete scenarios where they have been applied and tested.
COFI RANK - Maximum Margin Matrix Factorization for Collaborative Ranking
Weimer, Markus, Karatzoglou, Alexandros, Le, Quoc V., Smola, Alex J.
In this paper, we consider collaborative filtering as a ranking problem. We present a method which uses Maximum Margin Matrix Factorization and optimizes ranking instead of rating. We employ structured output prediction to optimize directly for ranking scores. Experimental results show that our method gives very good ranking scores and scales well on collaborative filtering tasks.
Unsupervised Feature Selection for Accurate Recommendation of High-Dimensional Image Data
Boutemedjet, Sabri, Ziou, Djemel, Bouguila, Nizar
Content-based image suggestion (CBIS) targets the recommendation of products based on user preferences on the visual content of images. In this paper, we motivate both feature selection and model order identification as two key issues for a successful CBIS. We propose a generative model in which the visual features and users are clustered into separate classes. We identify the number of both user and image classes with the simultaneous selection of relevant visual features using the message length approach. The goal is to ensure an accurate prediction of ratings for multidimensional non-Gaussian and continuous image descriptors. Experiments on a collected data have demonstrated the merits of our approach.