Preference Elicitation via Theory Refinement

@article{Haddawy2003PreferenceEV,
  title={Preference Elicitation via Theory Refinement},
  author={P. Haddawy and Vu A. Ha and Angelo C. Restificar and Benjamin Geisler and J. Miyamoto},
  journal={J. Mach. Learn. Res.},
  year={2003},
  volume={4},
  pages={317-337}
}
We present an approach to elicitation of user preference models in which assumptions can be used to guide but not constrain the elicitation process. We demonstrate that when domain knowledge is available, even in the form of weak and somewhat inaccurate assumptions, significantly less data is required to build an accurate model of user preferences than when no domain knowledge is provided. This approach is based on the KBANN (Knowledge-Based Artificial Neural Network) algorithm pioneered by… Expand
Reasoning with Conditional Preferences Across Attributes
Efficient and non-parametric reasoning over user preferences
Detecting and Adapting to Change in User Preference
Preference Learning
Acquiring user tradeoff strategies and preferences for negotiating agents: A default-then-adjust method
Similarity of personal preferences: Theoretical foundations and empirical analysis
Modeling challenges with influence diagrams: Constructing probability and utility models
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 40 REFERENCES
Toward Case-Based Preference Elicitation: Similarity Measures on Preference Structures
Making Rational Decisions Using Adaptive Utility Elicitation
Interactive Assessment of User Preference Models: The Automated Travel Assistant
Intelligent profiling by example
The Decision-Theoretic Video Advisor*
Automated refinement of first-order horn-clause domain theories
Automated Refinement of First-Order Horn-Clause Domain Theories
Extracting refined rules from knowledge-based neural networks
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
...
1
2
3
4
...