期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 238, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2023.121804
关键词
Recommendation algorithm; Graph-based recommendation; Conditional random field; Data sparsity; Tripartite graph; Diversity
The tripartite graph model in recommender systems can better handle data sparsity and cold start issues, improving recommendation metrics such as diversity, recall, and precision. Using the Conditional Random Field algorithm, potentially similar users can be identified, uncovering their preferences, and the random walk method further explores users with similar preferences beyond social relationships.
Recommender System (RS) has generated widespread attention with the aim of expanding different items. Among graph-based recommendation methods, the tripartite graph can better manage data sparsity and cold start, while improving the metrics of various recommendations such as recall, precision, and diversity. Existing tripartite graph-based methods encounter numerous challenges, including mitigating data sparsity, improving diversity, and capturing potential user preferences via social relations. To address these challenges, a Conditional Random Field based on Tripartite Graph (CRF-TG) is proposed. The tripartite graph consists of the user, item, and trust level. The method can mine potentially similar users, create probabilistic models based on TG, and uncover potential user preferences. Moreover, to mine the users with similar preferences outside the social relationship, the random walk method is used to test CRF-TG. Experiments are designed to verify the validity of CRF-TG. Compared to the others considered methods, CRF-TG gives a 15% increase on average in performance indicators such as diversity, recall, and F1.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据