.png){kind=icon}
Return
A conditional random field recommendation method based on tripartite graph
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2023.121804.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Recommendation algorithm
Graph-based recommendation
Conditional random field
Data sparsity
Tripartite graph
Diversity
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveShareSaveBlockchain-based recommender systems: Applications, challenges and future opportunities.png)
COMPUTER SCIENCE REVIEW
OAAI
COMPUTER SCIENCE REVIEWIF12.7
OAAIShareSave
ShareSave View more