2022
DOI: 10.1007/s11390-021-2124-z
|View full text |Cite
|
Sign up to set email alerts
|

Improving Friend Recommendation for Online Learning with Fine-Grained Evolving Interest

Abstract: Friend recommendation plays a key role in promoting user experience in online social networks (OSNs). However, existing studies usually neglect users' fine-grained interest as well as the evolving feature of interest, which may cause unsuitable recommendation. In particular, some OSNs, such as the online learning community, even have little work on friend recommendation. To this end, we strive to improve friend recommendation with fine-grained evolving interest in this paper. We take the online learning commun… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 44 publications
0
1
0
Order By: Relevance
“…Kang et al [17] proposed an Evaluation Latent Delicacy Allocation (Evaluation-LDA) algorithm to cluster learners with similar learning interests based on constructing learner document datasets, calculating learner similarity, and modelling friend topics as a way to help students in online education recommend suitable learning partners. Shao et al [18] proposed a learning partner recommendation algorithm that is based on the evolution of learning interests and recommends suitable learning partners for students through interest similarity. The above study calculates the similarity between students through partial interaction information and interest information to recommend appropriate learning partners without considering the integrity of heterogeneous data and ignoring the importance of student-student interaction information.…”
Section: Related Workmentioning
confidence: 99%
“…Kang et al [17] proposed an Evaluation Latent Delicacy Allocation (Evaluation-LDA) algorithm to cluster learners with similar learning interests based on constructing learner document datasets, calculating learner similarity, and modelling friend topics as a way to help students in online education recommend suitable learning partners. Shao et al [18] proposed a learning partner recommendation algorithm that is based on the evolution of learning interests and recommends suitable learning partners for students through interest similarity. The above study calculates the similarity between students through partial interaction information and interest information to recommend appropriate learning partners without considering the integrity of heterogeneous data and ignoring the importance of student-student interaction information.…”
Section: Related Workmentioning
confidence: 99%