Predicting User Preferences Via Similarity-Based Clustering

  title={Predicting User Preferences Via Similarity-Based Clustering},
  author={Mian Qin and Scott Buffett and Michael W. Fleming},
  booktitle={Canadian Conference on AI},
This paper explores the idea of clustering partial preference relations as a means for agent prediction of users' preferences. Due to the high number of possible outcomes in a typical scenario, such as an automated negotiation session, elicitation techniques can provide only a sparse specification of a user's preferences. By clustering similar users together, we exploit the notion that people with common preferences over a given set of outcomes will likely have common interests over other… 
(Partial) user preference similarity as classification-based model similarity
It is shown that classification-based similarity metrics with machine learning significantly outperforms other similarity approaches in different cold-start situations under different degrees of data-sparseness.
Improving news articles recommendations via user clustering
This research proposes a new personalized recommendation approach that integrates both user and text clustering based on the developed algorithm, W-kmeans, with other information retrieval (IR) techniques, like text categorization and summarization in order to provide users with the articles that match their profiles.
Personalised Privacy by Default Preferences - Experiment and Analysis
A novel mechanism that provides individuals with personalised privacy by default setting when they register into a new system or service is presented, using a machine learning approach that requires a minimal number of questions at the registration phase, and sets up privacy settings associated to users’ privacy preferences for a particular service.
Easing the Burden of Setting Privacy Preferences: A Machine Learning Approach
A machine learning approach is implemented that provides users personalized privacy-by-default settings that takes into consideration the combinations of service providers, types of personal data and usage purposes and predicts their privacy preferences.
Comparing apples and oranges through partial orders: An empirical approach
This paper assumes that a collection of empirically generated pairwise comparisons between a subset of so-called alternatives produces a partial order over the set of alternatives, which produces a cost associated with each alternative that is consistent with the partial order.
Using data mining to improve digital library services
The results indicate that k‐means clustering and Naive Bayes classification may be used to improve the accuracy of service recommendation.
Leveraging Privacy Profiles to Empower Users in the Digital Society
The study aims to understand which set of questions and settings is more appropriate to differentiate users according to their privacy preferences, and designs and implements a recommender system to provide users with suitable recommendations with respect to privacy choices.
Peer-Based Intelligent Tutoring Systems: A Corpus-Oriented Approach
This work takes as a starting point McCalla's proposed ecological approach for the design of peer-based intelligent tutoring systems and proposes three distinct directions for research to develop an algorithm for selecting appropriate content to present to a student, based on previous learning experiences of like-minded students.


Reasoning with Conditional Preferences Across Attributes
A structure, a Conditional Outcome Preference Network (COP-network), for modeling preferences directly elicited from a user, which can be easily checked for consistency and redundancy, and used to determine quickly whether one outcome is preferred over another.
Similarity of personal preferences: Theoretical foundations and empirical analysis
A Bayesian classifier for learning opponents' preferences in multi-object automated negotiation
Regret-based Utility Elicitation in Constraint-based Decision Problems
This work proposes new methods of preference elicitation for constraint-based optimization problems based on the use of minimax regret, and describes several elicitation strategies that require the user to answer only binary queries on the utility model parameters.
Making Rational Decisions Using Adaptive Utility Elicitation
An algorithm is proposed that interleaves the analysis of the decision problem and utility elicitation to allow these two tasks to inform each other and computes the best strategy based on the information acquired so far.
Detecting opponent concessions in multi-issue automated negotiation
A new technique for learning about an opponent's preferences by observing its history of offers in a negotiation is described, which significantly outperforms a previous method that assumes that a negotiation agent will always make concessions during the course of a negotiation.
Decisions with Multiple Objectives: Preferences and Value Trade-Offs
This book describes how a confused decision maker, who wishes to make a reasonable and responsible choice among alternatives, can systematically probe his true feelings in order to make those critically important, vexing trade-offs between incommensurable objectives.
Decisions with Multiple Objectives—Preferences and Value Tradeoffs
Inferring implicit preferences from negotiation actions
  • In Proc. Int’l Symposium on Artificial Intelligence and Mathematics,
  • 2004