Abstract
The recommender system is a set of data recovery tools and techniques used to recommend items to users based on their selection. To improve the accuracy of the recommendation, the use of additional information (e.g., social information, trust, item tags, etc.) in addition to user-item ranking data has been an active area of research for the past decade.
In this paper, we present a new method for recommending top-N items, which uses structural information and trust among users within the social network and extracts the implicit connections between users and uses them in the item recommendation process. The proposed method has seven main steps: (1) extract items liked by neighbors, (ii) constructing item features for neighbors, (iii) extract embedding trust features for neighbors, (iv) create user-feature matrix, (v) calculate user’s priority, (vi) calculate item’s priority and finally, (vii) recommend top-N items. We implement the proposed method with three datasets for recommendations. We compare our results with some advanced ranking methods and observe that the accuracy of our method for all users and cold-start users improves. Our method can also create more items for cold-start users in the list of recommended items.
Similar content being viewed by others
Data availability
Datasets related to this article can be found at https://grouplens.org/datasets/hetrec-2011/ for two publicly available datasets named Last.fm and Delicious and LibraryThing dataset can be found at https://cseweb.ucsd.edu/~jmcauley/datasets.html#social_data.
References
Agarwal N, Haque E, Liu H, Parsons L (2005) Research paper recommender systems: A subspace clustering approach. In: International Conference on Web-Age Information Management. 475–491.
Ahmed A, Shervashidze N, Narayanamurthy S, Josifovski V, Smola AJ (2013) Distributed large-scale natural graph factorization. In: Proceedings of the 22nd international conference on World Wide Web, 37–48.
Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the fourth ACM international conference on Web search and data mining. pp. 635–644.
Banerjee S, Banjare P, Pal B, Jenamani M (2021) A multistep priority-based ranking for top-N recommendation using social and tag information. J Ambient Intell Humaniz Comput 12(2):2509–2525
Belkin M, Niyogi P (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv Neural Inf. Process. Syst, 14
Bell RM, Koren Y (2007) Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In: Seventh IEEE international conference on data mining (ICDM 2007). 43–52.
Bengio Y, Courville A, Vincent P (2013) Representation learning: a review and new perspectives. IEEE Trans Pattern Anal Mach Intell 35(8):1798–1828
Bhagat S, Cormode G, Muthukrishnan S (2011) Node classification in social networks. Social network data analytics. Springer, Boston, pp 115–148
Bottou L (1991) Stochastic gradient learning in neural networks. Proc Neuro-Nımes 91(8):12
Burke R (2002) Hybrid recommender systems: survey and experiments. User Model User-Adapt Interact 12(4):331–370
Burke R (2007) Hybrid web recommender system. Adapt Web. 377–408
Covington P, Adams J, Sargin E (2016) Deep neural networks for youtube recommendations. In: Proceedings of the 10th ACM conference on recommender systems. 191–198.
Cox MAA, Cox TF (2008) Multidimensional scaling. Handbook of data visualization. Springer, Berlin, Heidelberg, pp 315–347
Deshpande M, Karypis G (2004) Item-based top-n recommendation algorithms. ACM Trans Inf Syst 22(1):143–177
Fouss F, Pirotte A, Renders J-M, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355–369
Funk S (2006) Netflix update: try this at home
Getoor L, Taskar B (2007) Statistical relational learning. MIT press, Cambridge
Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. 855–864
Guo G (2013) Integrating trust and similarity to ameliorate the data sparsity and cold start for recommender systems. In: Proceedings of the 7th ACM conference on Recommender systems. 451–454.
Keikha MM, Rahgozar M, Asadpour M (2018) Community aware random walk for network embedding. Knowledge-Based Syst 148:47–54
Kondor RI, Lafferty J (2002) Diffusion kernels on graphs and other discrete structures. In: Proceedings of the 19th international conference on machine learning, vol. 2002, 315–322.
Koren Y (2010) Factor in the neighbors: Scalable and accurate collaborative filtering. ACM Trans Knowl Discov Data 4(1):1–24
Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019–1031
Lin F, Cohen WW (2010) Semi-supervised classification of network data using very few labels. In: 2010 international conference on advances in social networks analysis and mining, 192–199.
Lin J, Sugiyama K, Kan M-Y,, Chua T-S (2013) Addressing cold-start in app recommendation: latent user models constructed from twitter followers. In: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval. 283–292.
Linden G, Smith B, York J (2003) Amazon. com recommendations: item-to-item collaborative filtering. IEEE Internet Comput 7(1):76–80
Mikolov T, Chen K, Corrado G,, Dean J (2013) Efficient estimation of word representations in vector space. arXiv Prepr. arXiv1301.3781
Morgan SN, Govender KK (2017) Conceptualizing loyalty in the South African mobile telecommunications industry. Glob J Manag Bus Res 4:1273816
Pan W, Chen L (2013) Gbpr: Group preference based bayesian personalized ranking for one-class collaborative filtering
Pennington J, Socher R,, Manning CD (2014) Glove: Global vectors for word representation. In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP). pp. 1532–1543.
Perozzi B, Al-Rfou R,, Skiena S (2014) Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, 701–710.
Radivojac P et al (2013) A large-scale evaluation of computational protein function prediction. Nat Methods 10(3):221–227
Rendle S, Freudenthaler C, Gantner Z,, Schmidt-Thieme L (2012) BPR: Bayesian personalized ranking from implicit feedback. arXiv Prepr. arXiv1205.2618
Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326
Sarwar BM, Karypis G, Konstan J,, Riedl J (2002) Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. In: Proceedings of the fifth international conference on computer and information technology, vol. 1, pp. 291–324
Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93
Son LH (2016) Dealing with the new user cold-start problem in recommender systems: a comparative review. Inf Syst 58:87–104
Tang J, Qu M, Wang M, Zhang M, Yan J,, Mei Q (2015) Line: Large-scale information network embedding. In: Proceedings of the 24th international conference on world wide web. 1067–1077.
Tenenbaum JB, de Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319–2323
Tsoumakas G, Katakis I (2006) Multi-label classification: an overview dept of informatics. Aristotle Univ, Thessaloniki, Greece
Vazquez A, Flammini A, Maritan A, Vespignani A (2003) Global protein function prediction from protein-protein interaction networks. Nat Biotechnol 21(6):697–700
Wang X, Jin D, Cao X, Yang L,, Zhang W (2016) Semantic community identification in large attribute networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30, no. 1.
Wang X, Cui P, Wang J, Pei J, Zhu W,, Yang S (2017) Community preserving network embedding
Wu Y, Liu X, Xie M, Ester M,, Yang Q (2016) CCCF: Improving collaborative filtering via scalable user-item co-clustering. In: Proceedings of the ninth ACM international conference on web search and data mining. 73–82.
Xue G-R et al. (2005) Scalable collaborative filtering using cluster-based smoothing. In: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval. 114–121.
Yan S, Xu D, Zhang B, Zhang H-J, Yang Q, Lin S (2006) Graph embedding and extensions: a general framework for dimensionality reduction. IEEE Trans Pattern Anal Mach Intell 29(1):40–51
Yang S-H, Long B, Smola A, Sadagopan N, Zheng Z,, Zha H (2011) Like like alike: joint friendship and interest propagation in social networks. In: Proceedings of the 20th international conference on World wide web. 537–546.
Zhao T, McAuley J,, King I (2014) Leveraging social connections to improve personalized ranking for collaborative filtering. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management, 261–270.
Zhao WX, Li S, He Y, Chang EY, Wen J-R, Li X (2015) Connecting social media to e-commerce: cold-start product recommendation using microblogging information. IEEE Trans Knowl Data Eng 28(5):1147–1159
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there are no conflicts of interest regarding the publication of this article.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Fayezi, M.M., Golpayegani, A.H. User structural information in priority-based ranking for top-N recommendation. Adv. in Comp. Int. 3, 3 (2023). https://doi.org/10.1007/s43674-022-00050-y
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s43674-022-00050-y