CoChat

Personalized recommendation via integrated diffusion on user–item–tag tripartite graphs

Open access
Zhang, Zi-Ke, Zhou, Tao, Zhang, Yi-Cheng · 2010 · Physica A: Statistical Mechanics and its Applications
Cited by 231

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Abstract

Personalized recommender systems are confronting great challenges of accuracy, diversification and novelty, especially when the data set is sparse and lacks accessorial information, such as user profiles, item attributes and explicit ratings. Collaborative tags contain rich information about personalized preferences and item contents, and are therefore potential to help in providing better recommendations. In this article, we propose a recommendation algorithm based on an integrated diffusion on user–item–tag tripartite graphs. We use three benchmark data sets, Del.icio.us, MovieLens and BibSonomy, to evaluate our algorithm. Experimental results demonstrate that the usage of tag information can significantly improve accuracy, diversification and novelty of recommendations.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.physa.2009.08.036

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • The anatomy of a large-scale hypertextual Web search engine

    Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004

  • Evaluating collaborative filtering recommender systems

    Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963772 · Cited by 5,798 · cited 4×

    “a graph consisted of five users and four books, where users can give ratings to those books. So far, collaborative Filtering (CF) is the most successful technique in the design of recommender systems [11], where a user will be recommended items that people with similar tastes and preferences liked in the past. Despite…”
    BackgroundMethodInfluential
  • Amazon.com recommendations: item-to-item collaborative filtering

    Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403

  • Content-Based Recommendation Systems

    Pazzani, M. J., & Billsus, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_10 · Cited by 2,600 · cited 1×

    “ributes describe global properties of items which are essentially not helpful to generate personalized recommendations. In addition, content-based algorithms can provide very accurate recommendations [16], however, they are only effective if the items contain rich content information that can be automatically extracte…”
    Method
  • Reputation systems

    Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190 · cited 1×

    “ity of data resulted from: (i) the huge number of items far beyond user's ability to evaluate even a small fraction of them; (ii) users do not incentively wish to rate the purchased/viewed items [12]. As shown in Figure 1, besides the fundamental user-item relations, some accessorial information can be exploited…”
    Background
  • Hierarchical structure and the prediction of missing links in networks

    Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171 · cited 3×

    “and Yi-Cheng Zhang Data set Pure U-I Pure I-T Optimum λopt Del.icio.us 0.8098 0.8486 0.8588 0.32 MovieLens 0.8065 0.8163 0.8233 0.44 BibSonomy 0.7374 0.7600 0.7852 0.44 • The area under the ROC curve [31, 32]: In the present case, the area under the ROC curve, abbreviated by AUC, for a particular user is the probabili…”
    BackgroundMethodInfluential

Show all 6 references

Cited by

Metadata

Authors
Zhang, Z.-K., Zhou, T., & Zhang, Y.-C.
Venue
Physica A: Statistical Mechanics and its Applications
Publisher
Elsevier BV
Published
2010-01
Volume
389
Issue
1
Pages
179-186
ISSN
0378-4371 (ISSN-L)
OpenAlex
W2030319410
Cited by
231
References
6
FWCI
50.31
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.