Connectionist learning of expert preferences by comparison training
Advances in neural information processing systems 1
Using collaborative filtering to weave an information tapestry
Communications of the ACM - Special issue on information filtering
GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Social information filtering: algorithms for automating “word of mouth”
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Recommendation as classification: using social and content-based information in recommendation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Framework for Collaborative, Content-Based and Demographic Filtering
Artificial Intelligence Review - Special issue on data mining on the Internet
A New Nonparametric Pairwise Clustering Algorithm Based on Iterative Estimation of Distance Profiles
Machine Learning - Special issue: Unsupervised learning
Learning Subjective Functions with Large Margins
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Latent Class Models for Collaborative Filtering
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Efficient Boosting Algorithm for Combining Preferences
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Feature subset selection for learning preferences: a case study
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Journal of Artificial Intelligence Research
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Boosting the ranking function learning process using clustering
Proceedings of the 10th ACM workshop on Web information and data management
A hybrid recommendation technique based on product category attributes
Expert Systems with Applications: An International Journal
MUADDIB: A distributed recommender system supporting device adaptivity
ACM Transactions on Information Systems (TOIS)
Comparing apples and oranges through partial orders: an empirical approach
ACC'09 Proceedings of the 2009 conference on American Control Conference
Proceedings of the 20th ACM international conference on Information and knowledge management
A hybrid recommendation approach for a tourism system
Expert Systems with Applications: An International Journal
Review: Soft computing applications in customer segmentation: State-of-art review and critique
Expert Systems with Applications: An International Journal
| Hi-index | 12.06 |
Learning preferences is a useful task in application fields such as collaborative filtering, information retrieval, adaptive assistants or analysis of sensory data provided by panels. SVMs, using preference judgments, can induce ranking functions that map objects into real numbers, in such a way that more preferable objects achieve higher values. In this paper we present a new algorithm to build clusters of people with closely related tastes, and hence people whose preference judgment sets can be merged in order to learn more reliable ranking functions. In some application fields, these clusters can be seen as market segments that demand different kinds of products. The method proposed starts representing people's preferences in a metric space, where it is possible to define a kernel based similarity function; finally a clustering algorithm discovers significant groups with homogeneous tastes. The key point of our proposal is to use the ranking functions induced from the preference judgments of each person; we will show that those functions codify the criteria used by each person to decide her preferences. To illustrate the performance of our approach, we present two experimental cases. The first one deals with the collaborative filtering database EachMovie. The second database describes a real case of consumers of beef meat.