Name
Abstract | ||
|---|---|---|
In this paper, we propose a graph-based method for hybrid recommendation. Unlike a simple linear combination of several factors, our method integrates user-based, item-based and content-based techniques more fully. The interaction among different factors are not done once, but by iterative updates. The graph model is composed of target user’s similar-minded neighbors, candidate items, target user’s historical items and the topics extracted from items’ contents using topic modeling. By constructing the concise graph, we filter out irrelevant noise and only retain useful information which is highly related to the target user. Top-N recommendation list is finally generated by using personalized random walk. We conduct a series of experiments on two datasets: movielen and lastfm. Evaluation results show that our proposed approach achieves good quality and outperforms existing recommendation methods in terms of accuracy, coverage and novelty. © Springer International Publishing Switzerland 2015. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-25255-1_47 | APWeb |
Keywords | Field | DocType |
hybrid recommendation, random walk, topic modeling, sparsity, novelty | Data mining,Linear combination,Graph,Random walk,Computer science,Novelty,Topic model,Graph model | Conference |
Volume | ISSN | Citations |
9313 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zheng Hai-Tao | 1 | 142 | 24.39 |
| Yan Yang-Hui | 2 | 0 | 0.68 |
| Zhou Ying-Min | 3 | 0 | 0.68 |