Constructing CP-Nets from Users Past Selection

被引:0
|
作者
Khoshkangini, Reza [1 ]
Pini, Maria Silvia [2 ]
Rossi, Francesca [3 ]
机构
[1] Halmstad Univ, Ctr Appl Intelligent Syst Res CAISR, Halmstad, Sweden
[2] Univ Padua, Dept Informat Engn, Padua, Italy
[3] IBM TJ Watson Res Ctr, Yorktown Hts, NY USA
关键词
CP-net; Bayesian network; Recommender system; Gamification;
D O I
10.1007/978-3-030-35288-2_11
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Although recommender systems have been significantly developed for providing customized services to users in various domains, they still have some limitations regarding the extraction of users' conditional preferences from their past selections when they are in a dynamic context. We propose a framework to automatically extract and learn users' conditional and qualitative preferences in a gamified system taking into consideration the players' past behaviour, without asking any information from the players. To do that, we construct CP-nets modeling users preferences via a procedure that employs multiple Information Criterion score functions within an heuristic algorithm to learn a Bayesian network. The approach has been validated experimentally in the challenge recommendation domain in an urban mobility gamified system.
引用
收藏
页码:130 / 142
页数:13
相关论文
共 50 条
  • [31] On the hardness of bribery variants in voting with CP-nets
    Britta Dorn
    Dominikus Krüger
    Annals of Mathematics and Artificial Intelligence, 2016, 77 : 251 - 279
  • [32] The computational complexity of dominance and consistency in CP-Nets
    Goldsmith, Judy
    Lang, Jérôme
    Truszczyński, Miroslaw
    Wilson, Nic
    Journal of Artificial Intelligence Research, 2008, 33 : 403 - 432
  • [33] Integrating CP-Nets in Reactive BDI Agents
    Parizi, Mostafa Mohajeri
    Sileno, Giovanni
    van Engers, Tom
    PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS (PRIMA 2019), 2019, 11873 : 305 - 320
  • [34] The Computational Complexity of Dominance and Consistency in CP-Nets
    Goldsmith, Judy
    Lang, Jerome
    Truszczynski, Miroslaw
    Wilson, Nic
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2008, 33 : 403 - 432
  • [35] Models for Conditional Preferences as Extensions of CP-Nets
    Cornelio, Cristina
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4355 - 4356
  • [36] Preference-based constrained optimization with CP-nets
    Boutilier, C
    Brafman, RI
    Domshlak, C
    Hoos, HH
    Poole, D
    COMPUTATIONAL INTELLIGENCE, 2004, 20 (02) : 137 - 157
  • [37] Reasoning and Negotiating with Complex Preferences Using CP-Nets
    Aydogan, Reyhan
    Tasdemir, Nuri
    Yolum, Pinar
    AGENT-MEDIATED ELECTRONIC COMMERCE AND TRADING AGENT DESIGN AND ANALYSIS, 2010, 44 : 15 - 28
  • [38] Reputation Bootstrapping for Composite Services Using CP-Nets
    Mistry, Sajib
    Bouguettaya, Athman
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (06) : 3513 - 3527
  • [39] Variable ordering and constraint propagation for constrained CP-nets
    Eisa Alanazi
    Malek Mouhoub
    Applied Intelligence, 2016, 44 : 437 - 448
  • [40] Independent Relaxed Subproblems for Dominance Testing in CP-Nets
    Jiang, Liu
    Allen, Thomas E.
    ALGORITHMIC DECISION THEORY, ADT 2024, 2025, 15248 : 225 - 240