Abstract
Conditional Preference Networks (CP-nets) have been proposed for modeling and reasoning about combinatorial decision domains. However, the study of CP-nets learning has not advanced sufficiently for their widespread use in complex, real-world applications where the problem is large-scale and the data is not clean. In many real world applications, due to either the randomness of the users’ behaviors or the observation errors, the data-set in hand could be inconsistent, i.e., there exists at least one outcome preferred over itself in the data-set. In this work, we present an evolutionary-based method for solving the CP-net learning problem from inconsistent examples. Here, we do not learn the CP-nets directly. Instead, we frame the problem of learning into an optimization problem and use the power of evolutionary algorithms to find the optimal CP-net. The experiments indicate that the proposed approach is able to find a good quality CP-net and outperforms the current state-of-the-art algorithms in terms of both sample agreement and graph similarity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Alanazi, E., Mouhoub, M., Zilles, S.: The complexity of learning acyclic CP-nets. In: IJCAI, pp. 1361–1367 (2016)
Allen, T.E.: CP-nets: from theory to practice. In: ADT, pp. 555–560 (2015)
Allen, T.E., Goldsmith, J., Mattei, N.: Counting, ranking, and randomly generating CP-nets. In: MPREF (2014)
Athienitou, F., Dimopoulos, Y.: Learning CP-networks: a preliminary investigation. In: MPREF (2007)
Baok, T.: Evolutionary Algorithm in Theory and Practice. Oxford University Press, Oxford (1998)
Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: Reasoning with conditional ceteris paribus preference statements. In: UAI, pp. 71–80 (1999)
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: ICML, pp. 89–96 (2005)
Chen, H., Zhou, L., Han, B.: On compatibility of uncertain additive linguistic preference relations and its application in the group decision making. Knowl. Based Syst. 24(6), 816–823 (2011)
Chevaleyre, Y., Koriche, F., Lang, J., Mengin, J., Zanuttini, B.: Learning ordinal preferences on multiattribute domains: the case of CP-nets. In: Preference Learning, pp. 273–296 (2010)
Corder, G.W., Foreman, D.I.: Nonparametric statistics: a step-by-step approach (2014)
Dimopoulos, Y., Michael, L., Athienitou, F.: Ceteris paribus preference elicitation with predictive guarantees. In: IJCAI 2009, pp. 1–6 (2009)
Eiben, A.E.: A method for designing decision support systems for operational planning. Ph.D. thesis, Technische Universiteit Eindhoven (1991)
Emrouznejad, A., Mustafa, A., Al-Eraqi, A.S., et al.: Aggregating preference ranking with fuzzy data envelopment analysis. Knowl. Based Syst. 23(6), 512–519 (2010)
Guerin, J.T., Allen, T.E., Goldsmith, J.: Learning CP-net preferences online from user queries. In: ADT, pp. 208–220 (2013)
Herbrich, R., Graepel, T., Obermayer, K.: Support vector learning for ordinal regression. In: ICANN, vol. 1, pp. 97–102 (1999)
Kamishima, T.: Nantonac collaborative filtering: recommendation based on order responses. In: ACM SIGKDD, pp. 583–588 (2003)
Kamishima, T., Akaho, S.: Nantonac collaborative filtering: a model-based approach. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 273–276 (2010)
Kazawa, H., Hirao, T., Maeda, E.: Order SVM: a kernel method for order learning based on generalized order statistics. Syst. Comput. Jpn. 36(1), 35–43 (2005)
Keeney, R.L., Raiffa, H.: Decision with multiple objectives (1976)
Lang, J., Mengin, J.: Learning preference relations over combinatorial domains. In: NMR, pp. 207–214 (2008)
Lang, J., Mengin, J.: The complexity of learning separable ceteris paribus preferences. In: IJCAI, pp. 848–853 (2009)
Liu, J., Xiong, Y., Caihua, W., Yao, Z., Liu, W.: Learning conditional preference networks from inconsistent examples. IEEE TKDE 26(2), 376–390 (2014)
Liu, J., Yao, Z., Xiong, Y., Liu, W., Caihua, W.: Learning conditional preference network from noisy samples using hypothesis testing. Knowl. Based Syst. 40, 7–16 (2013)
Xu, J., Li, H.: AdaRank: a boosting algorithm for information retrieval. In: ACM SIGIR, pp. 391–398 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Haqqani, M., Li, X. (2017). An Evolutionary Approach for Learning Conditional Preference Networks from Inconsistent Examples. In: Cong, G., Peng, WC., Zhang, W., Li, C., Sun, A. (eds) Advanced Data Mining and Applications. ADMA 2017. Lecture Notes in Computer Science(), vol 10604. Springer, Cham. https://doi.org/10.1007/978-3-319-69179-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-69179-4_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69178-7
Online ISBN: 978-3-319-69179-4
eBook Packages: Computer ScienceComputer Science (R0)