TY - GEN
T1 - MGRec
T2 - 8th International Conference on Big Data Computing and Communications, BigCom 2022
AU - Ren, Haoyang
AU - Liu, Jiaqi
AU - Guo, Bin
AU - Qiu, Chen
AU - Xiang, Liyao
AU - Li, Zhetao
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - The rapid development of the Internet and social networks deepens the connection between people and bring more rich information. To solve the problems of information overload, many recommendation algorithms have flourished, such as collaborative filtering algorithms, social recommendation algorithms, and meta-path based algorithms. The common characteristic of these algorithms is that they introduce some additional information, e.g., user friendship or item category, to improve the accuracy of recommendations. However, how to fuse such different types of information effectively remains challenging: how to aggregate specific information within each type of relations and how to combine various information among different types of relations. To solve the aforementioned problems, we propose a graph-level information fusion recommendation algorithm, i.e., MGRec (Multi-Graph Recommendation). Firstly, it models three types of relations, that are, ratings between users and items, friendships between users, and categories between items, as sub-graphs. Then, it makes information aggregation within each sub-graph, using personalized feature extraction methods like GCN and attention mechanism. Finally, it makes information combination among sub-graphs, which is implemented by a gate mechanism. Extensive experiments are conducted on two real-world datasets and results demonstrate the irreplaceability of MGRec.
AB - The rapid development of the Internet and social networks deepens the connection between people and bring more rich information. To solve the problems of information overload, many recommendation algorithms have flourished, such as collaborative filtering algorithms, social recommendation algorithms, and meta-path based algorithms. The common characteristic of these algorithms is that they introduce some additional information, e.g., user friendship or item category, to improve the accuracy of recommendations. However, how to fuse such different types of information effectively remains challenging: how to aggregate specific information within each type of relations and how to combine various information among different types of relations. To solve the aforementioned problems, we propose a graph-level information fusion recommendation algorithm, i.e., MGRec (Multi-Graph Recommendation). Firstly, it models three types of relations, that are, ratings between users and items, friendships between users, and categories between items, as sub-graphs. Then, it makes information aggregation within each sub-graph, using personalized feature extraction methods like GCN and attention mechanism. Finally, it makes information combination among sub-graphs, which is implemented by a gate mechanism. Extensive experiments are conducted on two real-world datasets and results demonstrate the irreplaceability of MGRec.
KW - Information Fusion
KW - Multi-graph
KW - Recommendation
KW - User-item Interaction
UR - http://www.scopus.com/inward/record.url?scp=85151553088&partnerID=8YFLogxK
U2 - 10.1109/BigCom57025.2022.00041
DO - 10.1109/BigCom57025.2022.00041
M3 - 会议稿件
AN - SCOPUS:85151553088
T3 - Proceedings - 2022 8th International Conference on Big Data Computing and Communications, BigCom 2022
SP - 266
EP - 275
BT - Proceedings - 2022 8th International Conference on Big Data Computing and Communications, BigCom 2022
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 6 August 2022 through 7 August 2022
ER -