Abstract
AbstractWith the rapid development of social networks, academic social networks have attracted increasing attention. In particular, providing personalized recommendations for learners considering data sparseness and cold-start scenarios is a challenging task. An important research topic is to accurately discover potential friends of learners to build implicit learning groups and obtain personalized collaborative recommendations of similar learners according to the learning content. This paper proposes a personalized explainable learner implicit friend recommendation method (PELIRM). Methodologically, PELIRM utilizes the learner's multidimensional interaction behavior in social networks to calculate the degrees of trust between learners and applies the three-degree influence theory to mine the implicit friends of learners. The similarity of research interests between learners is calculated by cosine and term frequency–inverse document frequency. To solve the recommendation problem for cold-start learners, the learner's common check-in IP is used to obtain the learner's location information. Finally, the degree of trust, similarity of research interests, and geographic distance between learners are combined as ranking indicators to recommend potential friends for learners and give multiple interpretations of the recommendation results. By verifying and evaluating the proposed method on real data from Scholar.com, the experimental results show that the proposed method is reliable and effective in terms of personalized recommendation and explainability.
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computational Mechanics
Reference34 articles.
1. Wan H, Zhang Y, Zhang J, Tang J (2019) AMiner: search and mining of academic social networks. Data Intell 1(1):58–76
2. Yan W, Huang W (2022) Positive or silent: a study of user clustering and utilization behavior in academic social networks from the perspective of disciplinary differences. Inf Stud Theory Appl 45(06):138–146
3. Zhang P, Zhang Z, Tian T, Wang Y (2019) Collaborative filtering recommendation algorithm integrating time windows and rating predictions. Appl Intell 49(8):3146–3157
4. Cai X, Hu Z, Chen J (2020) A many-objective optimization recommendation algorithm based on knowledge mining. Inf Sci 537:148–161
5. Yin H, Zhou X, Cui B, Wang H, Zheng K, Nguyen Q (2016) Adapting to User Interest Drift for POI Recommendation. IEEE Trans Knowl Data Eng 28(10):2566–2581
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献