Link prediction approach to recommender systems

被引:15
作者
Lakshmi, T. Jaya [1 ]
Bhavani, S. Durga [2 ]
机构
[1] SRM Univ, Dept Comp Sci & Engn, Data Sci Res Lab, Guntur 522502, Andhra Pradesh, India
[2] Univ Hyderabad, Sch Comp & Informat Sci, Hyderabad 500002, Telangana, India
关键词
Recommender systems; Link prediction; Bipartite graph; Temporal probabilistic measures; 68 Computer science;
D O I
10.1007/s00607-023-01227-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The problem of recommender system is very popular with myriad available solutions. Recommender systems recommend items to users and help them in narrowing their search from huge amount of options available to the user. In this work, a novel approach for the recommendation problem is proposed by incorporating techniques from the link prediction problem in social networks. The proposed approach models the typical user-item information as a bipartite network, and predicts future links using link prediction measures, in which link prediction would actually mean recommending an item to a user. The standard recommender system methods suffer from the problems of sparsity and scalability. Since link prediction measures involve computations pertaining to local neighborhoods in the network, this approach would lead to a scalable solution to recommendation. In this work, we present top k links that are predicted by link prediction measures as recommendations to the users. Our work initially applies different existing link prediction measures to the recommendation problem by making suitable adaptations. The prime contribution of this work is to propose a recommendation framework routed from link prediction problem in social networks, that effectively utilizes probabilistic measures of link prediction and embed temporal data accessible on existing links. The proposed approach is evaluated on one movie-rating dataset of MovieLens, two product-rating datasets of Epinions & Amazon and one hotel-rating dataset of TripAdvisor. Results show that the link prediction measures based on temporal probabilistic information prove to be more effective in improving the quality of recommendation. Especially, Temporal cooccurrence probability measure improves the area under ROC curve (AUROC) by 10% for MovieLens, 23% for Epinions, 17% for TripAdvisor, 9% for Amazon over standard item-based collaborative filtering method. Similar improved performance is observed in terms of area under Precision-Recall curve (AUPR) as well as Normalized Rank-Score.
引用
收藏
页码:2157 / 2183
页数:27
相关论文
共 45 条
[1]  
Adomavicius G, 2011, RECOMMENDER SYSTEMS HANDBOOK, P217, DOI 10.1007/978-0-387-85820-3_7
[2]   A graph-based taxonomy of citation recommendation models [J].
Ali, Zafar ;
Qi, Guilin ;
Kefalas, Pavlos ;
Abro, Waheed Ahmad ;
Ali, Bahadar .
ARTIFICIAL INTELLIGENCE REVIEW, 2020, 53 (07) :5217-5260
[3]  
Anand Rajaraman e., 2011, Mining of Massive Datasets
[4]  
[Anonymous], 2017, AM WANG NETW DAT KON
[5]  
[Anonymous], 2017, TRIP NETW DAT
[6]  
[Anonymous], 2017, EP PROD RAT NETW DAT
[7]  
[Anonymous], 5 ACM C ELECT COMMER
[8]  
[Anonymous], 2013, ICDMW
[9]  
Bell RobertM., 2007, SIGKDD EXPLOR NEWSL, V9, P75, DOI [10.1145/1345448.1345465, DOI 10.1145/1345448.1345465]
[10]   E-commerce recommendation applications [J].
Ben Schafer, J ;
Konstan, JA ;
Riedl, J .
DATA MINING AND KNOWLEDGE DISCOVERY, 2001, 5 (1-2) :115-153