Abstract
Decision making can be more difficult with an enormous amount of information, not only for humans but also for automated decision making processes. Although most user preference elicitation models have been developed based on the assumption that user preferences are stable, user preferences may change in the long term and may evolve with experience, resulting in dynamic preferences. Therefore, in this paper, we describe a model called the dynamic preference network (DPN) that is maintained using an approach that does not require the entire preference graph to be rebuilt when a previously-learned preference is changed, with efficient algorithms to add new preferences and to delete existing preferences. DPNs are shown to outperform existing algorithms for insertion, especially for large numbers of attributes and for dense graphs. They do have some shortcomings in the case of deletion, but only when there is a small number of attributes or when the graph is particularly dense.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buffett, S., Fleming, M.: Persistently Effective Query Selection in Preference Elicitation. In: The 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2007), Fremont, California, USA, pp. 491–497 (2007)
Chen, S., Buffett, S., Fleming, M.W.: Reasoning with conditional preferences across attributes. In: Kobti, Z., Wu, D. (eds.) Canadian AI 2007. LNCS (LNAI), vol. 4509, pp. 369–380. Springer, Heidelberg (2007)
Miguel, F., Ryan, M., Scott, A.: Are preferences stable? The case of health care. Journal of Economic Behavior & Organization 48, 1–14 (2002)
Koopmans, T.: On flexibility of future preference. In: Cowles Foundation Discussion Papers (1962)
Pu, P., Faltings, B., Torrens, M.: Effective interaction principles for on-line product search environments. In Proceedings of the 3rd ACM/IEEE International Conference on Web intelligence. IEEE Press (2004)
Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artificial Intelligence Research 21, 135–191 (2004)
La Poutré, J.A., Leeuwen, J.V.: Maintenance of transitive closures and transitive reductions of graphs (1988)
King, V., Sagert, G.: A Fully Dynamic Algorithm for Maintaining the Transitive Closure. Journal of Computer and System Sciences 65, 150–167 (2002)
Chajewska, U., Koller, D., Parr, R.: Making rational decisions using adaptive utility elicitation. In: AAAI 2000, Austin, Texas, USA, pp. 363–369 (2000)
Boutilier, C., Regan, K., Viappiani, P.: Simultaneous Elicitation of Preference Features and Utility. In: Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence (AAAI 2010), Atlanta, GA, pp. 1160–1167 (2010)
Guo, S., Sanner, S.: Real-time Multiattribute Bayesian Preference Elicitation with Pairwise Comparison Queries. Appearing in Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS), Chia Laguna Resort, Sardinia, Italy. JMLR: W&CP, vol. 9 (2010)
Kaci, S.: Working with Preferences: Less Is More. Cognitive Technologies, pp. 11–193. Springer (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, K.H., Buffett, S., Fleming, M.W. (2013). Maintaining Preference Networks That Adapt to Changing Preferences. In: Zaïane, O.R., Zilles, S. (eds) Advances in Artificial Intelligence. Canadian AI 2013. Lecture Notes in Computer Science(), vol 7884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38457-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-38457-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38456-1
Online ISBN: 978-3-642-38457-8
eBook Packages: Computer ScienceComputer Science (R0)