A graph neural approach for group recommendation system based on pairwise preferences

被引:11
作者
Abolghasemi, Roza [1 ]
Viedma, Enrique Herrera [2 ]
Engelstad, Paal [1 ]
Djenouri, Youcef [3 ,4 ,5 ]
Yazidi, Anis [1 ]
机构
[1] Oslo Metropolitan Univ OsloMet, Dept Comp Sci, Oslo, Norway
[2] Univ Granada, Andalusian Res Inst Data Sci & Computat Intelligen, Granada, Spain
[3] Univ South Eastern Norway, Kongsbeg, Norway
[4] Norwegian Peacebldg Res Ctr, Oslo, Norway
[5] IDEAS NCBR, Warsaw, Poland
关键词
Graph clustering; Pairwise preferences; Recommendation systems; Group decision making; Group recommendation systems; GAME; REPRESENTATION; CONSENSUS; DYNAMICS;
D O I
10.1016/j.inffus.2024.102343
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Pairwise preference information, which involves users expressing their preferences by comparing items, plays a crucial role in decision-making and has recently found application in recommendation systems. In this study, we introduce GcPp, a clustering algorithm that leverages pairwise preference data to generate recommendations for user groups. Initially, we construct individual graphs for each user based on their pairwise preferences and utilize a graph convolutional network to predict similarities between all pairs of graphs. These predicted similarity scores form the foundation of our research. We then construct a new graph where users are nodes and the edges are weighted according to the predicted similarities. Finally, we perform clustering on the graph's nodes (users). By evaluating various metrics, we found that employing a similarity metric based on a convolutional neural network (SimGNN) with our proposed ground truth called Top -K yielded the highest accuracy. The proposed approach is specifically designed for group recommendation systems and holds significant potential for group decision-making problems. Code is available at https: //github.com/RozaAbolghasemi/Group_Recommendation_Syatem_GcPp_clustering.
引用
收藏
页数:16
相关论文
共 73 条
[1]  
Abbasnejad Ehsan., 2013, Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, P1213, DOI DOI 10.5555/2540128.2540303
[2]   Predicting missing pairwise preferences from similarity features in group decision making [J].
Abolghasemi, Roza ;
Khadka, Rabindra ;
Lind, Pedro G. ;
Engelstad, Paal ;
Viedma, Enrique Herrera ;
Yazidi, Anis .
KNOWLEDGE-BASED SYSTEMS, 2022, 256
[3]   A personality-aware group recommendation system based on pairwise preferences [J].
Abolghasemi, Roza ;
Engelstad, Paal ;
Herrera-Viedma, Enrique ;
Yazidi, Anis .
INFORMATION SCIENCES, 2022, 595 :1-17
[4]  
Ali-Yari S., 2020, Eng. J. Geosp. Inf. Technol., V8, P39
[5]   A unifying and general account of fairness measurement in recommender systems [J].
Amigo, Enrique ;
Deldjoo, Yashar ;
Mizzaro, Stefano ;
Bellogin, Alejandro .
INFORMATION PROCESSING & MANAGEMENT, 2023, 60 (01)
[6]   Metastability in Stochastic Replicator Dynamics [J].
Avrachenkov, Konstantin ;
Borkar, Vivek S. .
DYNAMIC GAMES AND APPLICATIONS, 2019, 9 (02) :366-390
[7]   SimGNN: A Neural Network Approach to Fast Graph Similarity Computation [J].
Bai, Yunsheng ;
Ding, Hao ;
Bian, Song ;
Chen, Ting ;
Sun, Yizhou ;
Wang, Wei .
PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM'19), 2019, :384-392
[8]   Deterministic limit of temporal difference reinforcement learning for stochastic games [J].
Barfuss, Wolfram ;
Donges, Jonathan F. ;
Kurths, Juergen .
PHYSICAL REVIEW E, 2019, 99 (04)
[9]  
Bledaite L., 2015, P 26 ACM C HYP SOC M, P231
[10]   Discovery and representation of the preferences of automatically detected groups: Exploiting the link between group modeling and clustering [J].
Boratto, Ludovico ;
Carta, Salvatore ;
Fenu, Gianni .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 64 :165-174