Cited by 494Recommender Systems and TechniquesSemantic Web and OntologiesText and Document Classification Technologies

Latent dirichlet allocation for tag recommendation

Krestel, Ralf, Fankhauser, Peter, Nejdl, Wolfgang·2009·Proceedings of the third ACM conference on Recommender systems

Abstract

Tagging systems have become major infrastructures on the Web. They allow users to create tags that annotate and categorize content and share them with other users, very helpful in particular for searching multimedia content. However, as tagging is not constrained by a controlled vocabulary and annotation guidelines, tags tend to be noisy and sparse. Especially new resources annotated by only a few users have often rather idiosyncratic tags that do not reflect a common perspective useful for search. In this paper we introduce an approach based on Latent Dirichlet Allocation (LDA) for recommending tags of resources in order to improve search. Resources annotated by many users and thus equipped with a fairly stable and complete tag set are used to elicit latent topics to which new resources with only a few tags are mapped. Based on this, other tags belonging to a topic can be recommended for the new resource. Our evaluation shows that the approach achieves significantly better precision and recall than the use of association rules, suggested in previous work, and also recommends more specific tags. Moreover, extending resources with these recommended tags significantly improves search for new resources.

Integrity signals

Registry

Crossref · 10.1145/1639714.1639726

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cited by

Sorted by citations

Authors
Krestel, R., Fankhauser, P., & Nejdl, W.
Affiliations
  • L3S Research Center (DE)
  • L3S Research Center, Hannover, Germany
Venue
Proceedings of the third ACM conference on Recommender systems
Publisher
ACM
Published
2009-10-23
Pages
61-68
OpenAlex
W2031237011
Cited by
494
References
0
Citations by year
2026: 4 · 2025: 4 · 2024: 6 · 2023: 17 · 2022: 25 · 2021: 28 · 2020: 31 · 2019: 46 · 2018: 46 · 2017: 47 · 2016: 43 · 2015: 40 · 2014: 31 · 2013: 39 · 2012: 32
FWCI
21.40
Type
conference paper
Language
en
Open access
closed
Locations
ACM Conference on Recommender Systems (RecSys) (publishedVersion)
Funders
Academy of Finland
Topics
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
  • Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
Keywords
tag recommendation, tagging systems, latent Dirichlet allocation, topic modeling, association rule mining

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