Bi-Graph Mix-random Walk Based Social Recommendation Model

CAO Yang; GAO Min; YU Jun-liang; FAN Qi-lin; RONG Wen-ge; WEN Jun-hao

doi:10.12263/DZXB.20210504

您当前的位置：

首页 >

文章列表页 >

Bi-Graph Mix-random Walk Based Social Recommendation Model

PAPERS | 更新时间：2025-12-08

- Bi-Graph Mix-random Walk Based Social Recommendation Model
- ACTA ELECTRONICA SINICA Vol. 51, Issue 2, Pages: 286-296(2023)
- 作者机构：
  
  1.信息物理社会可信服务计算教育部重点实验室（重庆大学），重庆 400044
  2.重庆大学大数据与软件学院，重庆 400044
  3.昆士兰大学信息技术与电气工程学院，澳大利亚昆士兰州 4072
  4.北京航空航天大学计算机学院，北京 10019
- 作者简介：
- 基金信息：
  
  Natural Science Foundation of Chongqing, China(cstc2020jcyj-msxmX0690);Fundamental Research Funds for the Central Universities of Chongqing University(2020CDJ-LHZZ-039)
- DOI：10.12263/DZXB.20210504
  CLC： TP311;
- Received：20 April 2021，
  
  Revised：2021-06-28，
  
  Published：25 February 2023
- 稿件说明：
移动端阅览
曹阳,高旻,余俊良等.基于双图混合随机游走的社会化推荐模型[J].电子学报,2023,51(02):286-296.

CAO Yang,GAO Min,YU Jun-liang,et al.Bi-Graph Mix-random Walk Based Social Recommendation Model[J].ACTA ELECTRONICA SINICA,2023,51(02):286-296.
曹阳,高旻,余俊良等.基于双图混合随机游走的社会化推荐模型[J].电子学报,2023,51(02):286-296. DOI： 10.12263/DZXB.20210504.

CAO Yang,GAO Min,YU Jun-liang,et al.Bi-Graph Mix-random Walk Based Social Recommendation Model[J].ACTA ELECTRONICA SINICA,2023,51(02):286-296. DOI： 10.12263/DZXB.20210504.

摘要

近年来，可以有效缓解数据稀疏和冷启动问题的社会化推荐受到了研究者和业界的关注.社会化推荐利用显式或隐式社交关系作为辅助信息，提升了推荐性能.然而，目前的社会化推荐模型通常采用普通图描述社交关系.普通图中的边常描述为成对节点的关系，这种方法适合描述显式关系，但难以描述复杂的隐式关系，如购买过同一商品的多个用户之间的集合关系，因此难以学习到准确的节点表示，影响推荐的性能.针对此问题，本文结合超图和普通图，提出基于双图混合随机游走的推荐（BG-Rec）模型.构建超图描述复杂的隐式关系，同时用普通图描述显式的社交关系，并在两种图上定义混合随机游走策略，生成结合隐式关系和显式关系的游走节点序列，学习更准确的节点嵌入表示.根据用户评分的高低，构建了正反馈超图和负反馈超图，考虑更细粒度的朋友关系，以识别可靠的朋友.融合可靠朋友的偏好和后验概率最大化优化物品个性化排序.三个公开数据集的大量实验表明了BG-Rec在推荐性能上的优越性，冷启动和消融实验表明了其在缓解冷启动问题的有效性和超图建模的合理性.

Abstract

In recent years

social recommendation approaches have attracted attention because they can effectively improve the recommendation quality when user-item interaction data is sparse. Explicit and implicit social relations

as auxiliary information

are used to improve the recommendation quality. However

social relations are represented by simple graphs in existing models. The nature of edges connecting pair-wise nodes in simple graphs makes it suitable for describing explicit relations. Still

it is incapable of modeling complex implicit relations

such as the collective relation between multiple users who have purchased the same product. Therefore

it isn't easy to learn the node representation accurately

only based on simple graphs

which even affects the recommender's performance. In this paper

we propose a recommendation model based on a bi-graph hybrid random walk (BG-Rec) to overcome this problem

which combines hypergraph and graph. We construct a hypergraph and a simple graph to depict complex implicit relations and explicit social relations separately. Next

the mixed random walk strategy (MixRandom) is used to generate node sequences that combine implicit and explicit relations. Furthermore

node sequences are used for learning more accurate representations of nodes. Then

positive feedback hypergraph and negative feedback hypergraph are constructed based on user ratings

so that more fine-grained friend relations can be considered to identify reliable friends. Finally

the personalized ranking of items is optimized by considering the preferences of reliable friends and the maximization of the posterior probability. Experiments on three public datasets show the superiority of BG-Rec in recommendation performance. The cold-start study and ablation study validates the effectiveness of alleviating the cold-start problem and rationality of hypergraph modeling.

关键词

Keywords

references

YU X , JIANG F , DU J , et al . A cross-domain collaborative filtering algorithm with expanding user and item features via the latent factor space of auxiliary domains [J]. Pattern Recognition , 2019 , 94 ( 1 ): 96 - 109 .

QI L , WANG X , XU X , et al . Privacy-aware cross-platform service recommendation based on enhanced locality-sensitive hashing [J]. IEEE Transactions on Network Science and Engineering , 2021 , 8 ( 2 ): 1145 - 1153 .

李琳 , 唐守廉 . 基于多层注意力表示的音乐推荐模型 [J]. 电子学报 , 2020 , 48 ( 9 ): 1672 - 1679 .

LI L , TANG S L . Hierarchical attention representation model for music recommendation [J]. Acta Electronica Sinica , 2020 , 48 ( 9 ): 1672 - 1679 . (In Chinese)

郭景峰 , 朱晓松 , 李爽 . 直播电视推荐系统的评分预测算法研究 [J]. 电子学报 , 2020 , 48 ( 9 ): 1735 - 1740 .

GUO J F , ZHU X S , LI S . Research on rating prediction algorithm of live TV recommender systems [J]. Acta Electronica Sinica , 2020 , 48 ( 9 ): 1735 - 1740 . (in Chinese)

CIALDINI R B , GOLDSTEIN N J . Social influence: Compliance and conformity [J]. Annu Rev Psychol , 2004 , 55 ( 1 ): 591 - 621 .

SINHA R R , SWEARINGEN K . Comparing recommendations made by online systems and friends [C]// Proceedings of the Second DELOS Network of Excellence Workshop on Personalisation and Recommender Systems in Digital Libraries . Sophia Antipolis : ERCIM , 2001 : 1 - 6 .

DOU K , GUO B , KUANG L . A privacy-preserving multimedia recommendation in the context of social network based on weighted noise injection [J]. Multimedia Tools and Applications , 2019 , 78 ( 19 ): 26907 - 26926 .

ZHAO T , MCAULEY J , KING I . Leveraging social connections to improve personalized ranking for collaborative filtering [C]// Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management . New York : ACM , 2014 : 261 - 270 .

MA H , KING I , LYU M R . Learning to recommend with social trust ensemble [C]// Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval . New York : ACM , 2009 : 203 - 210 .

KANG M , BI Y , WU Z , et al . A heterogeneous conversational recommender system for financial products [C]// Proceedings of the 28th ACM International Conference on Information and Knowledge Management . New York : ACM , 2019 : 26 - 30 .

ZHAO H , ZHOU Y , SONG Y , et al . Motif enhanced recommendation over heterogeneous information network [C]// Proceedings of the 28th ACM International Conference on Information and Knowledge Management . New York : ACM , 2019 : 2189 - 2192 .

YU J , GAO M , LI J , et al . Adaptive implicit friends identification over heterogeneous network for social recommendation [C]// Proceedings of the 27th ACM International Conference on Information and Knowledge Management . New York : ACM , 2018 : 357 - 366 .

YU J , YIN H , LI J , et al . Self-supervised multi-channel hypergraph convolutional network for social recommendation [C]// The Web Conference 2021 . New York : ACM , 2021 : 413 - 424 .

JI S , FENG Y , JI R , et al . Dual channel hypergraph collaborative filtering [C]// Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . New York : ACM , 2020 : 2020 - 2029 .

MA H , YANG H , LYU M R , et al . Sorec: Social recommendation using probabilistic matrix factorization [C]// Proceedings of the 17th ACM Conference on Information and Knowledge Management . New York : ACM , 2008 : 931 - 940 .

YANG B , LEI Y , LIU J , et al . Social collaborative filtering by trust [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence , 2016 , 39 ( 8 ): 1633 - 1647 .

CHEN J , FENG Y , ESTER M , et al . Modeling users' exposure with social knowledge influence and consumption influence for recommendation [C]// Proceedings of the 27th ACM International Conference on Information and Knowledge Management . New York : ACM , 2018 : 953 - 962 .

RENDLE S , FREUDENTHALER C , GANTNER Z , et al . BPR: Bayesian personalized ranking from implicit feedback [C]// In Proceedings of the Twenty-fifth Conference on Uncertainty in Artificial Intelligence . Arlington : AUAI Press , 2009 : 452 - 461

TANG J , HU X , LIU H . Social recommendation: a review [J]. Social Network Analysis and Mining , 2013 , 3 ( 4 ): 1113 - 1133 .

WANG X , HOI S C H , ESTER M , et al . Learning personalized preference of strong and weak ties for social recommendation [C]// Proceedings of the 26th International Conference on World Wide Web . Geneva : IW 3 C 2 , 2017 : 1601 - 1610 .

GOYAL P , FERRARA E . Graph embedding techniques, applications, and performance: A survey [J]. Knowledge-Based Systems , 2018 , 151 ( 1 ): 78 - 94 .

FAN W , MA Y , LI Q , et al . Graph neural networks for social recommendation [C]// Proceedings of the Web Conference 2019 . New York : ACM , 2019 : 417 - 426 .

WU L , SUN P , FU Y , et al . A neural influence diffusion model for social recommendation [C]// Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval . New York : ACM , 2019 : 235 - 244 .

YU J , GAO M , YIN H , et al . Generating reliable friends via adversarial training to improve social recommendation [C]// 2019 IEEE International Conference on Data Mining . New York : IEEE , 2019 : 768 - 777 .

YU J , YIN H , LI J , et al . Enhance social recommendation with adversarial graph convolutional networks [EB/OL]. ( 2020-10-23 )[ 2021-06-28 ]. https://arxiv.org/abs/2004.02340 https://arxiv.org/abs/2004.02340 .

CHITRA U , RAPHAEL B J . Random walks on hypergraphs with edge-dependent vertex weights [C]// Proceedings of the 36th International Conference on Machine Learning . Long Beach : IMLS , 2019 : 2002 - 2011 .

FROLOV E , OSELEDETS I . Fifty shades of ratings: How to benefit from a negative feedback in top-N recommendations tasks [C]// Proceedings of the 10th ACM Conference on Recommender Systems . New York : ACM , 2016 : 91 - 98 .

DONG Y , CHAWLA N V , SWAMI A . Metapath2vec: Scalable representation learning for heterogeneous networks [C]// Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . New York : ACM , 2017 : 135 - 144 .

MIKOLOV T , SUTSKEVER I , CHEN K , et al . Distributed representations of words and phrases and their compositionality [J]. Advances in Neural Information Processing Systems , 2013 , 26 ( 1 ): 3111 - 3119 .

HE X , DENG K , WANG X , et al . LightGCN: Simplifying and powering graph convolution network for recommendation [C]// Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval . New York : ACM , 2020 : 639 - 648 .

WU J , WANG X , FENG F , et al . Self-supervised graph learning for recommendation [C]// Proceedings of the 44rd International ACM SIGIR Conference on Research and Development in Information Retrieval . New York : ACM , 2021 : 639 - 648 .

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Individual Random Walks for Gene-Phenotype Association Analysis

Master-Slave Multi-Chain Consensus Mechanism of Consortium Blockchain Based on Hypergraph and MuSig2

Autoencoder and Hypergraph-Based Semi-Supervised Broad Learning System

The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants

Related Author

Yang CAO

Min GAO

Jun-liang YU

Qi-lin FAN

Wen-ge RONG

Jun-hao WEN

TAN Hao-jiang

WANG Jun

Related Institution

Key Laboratory of Dependable Service Computing in Cyber Physical Society （Chongqing University）， Ministry of Education

School of Big Data & Software Engineering， Chongqing University

School of Information Technology and Electrical Engineering， University of Queensland

School of Computer Science and Engineering， Beihang University

College of Electrical and Information Engineering, Beijing University of Civil Engineering and Architecture

⁰