Abstract
Ranking of resources in social tagging systems is a difficult problem due to the inherent sparsity of the data and the vocabulary problems introduced by having a completely unrestricted lexicon. In this paper we propose to use hidden topic models as a principled way of reducing the dimensionality of this data to provide more accurate resource rankings with higher recall. We first describe Latent Dirichlet Allocation (LDA) and then show how it can be used to rank resources in a social bookmarking system. We test the LDA tagging model and compare it with 3 non-topic model baselines on a large data sample obtained from the Delicious social bookmarking site. Our evaluations show that our LDA-based method significantly outperforms all of the baselines.
Original language | English |
---|---|
Title of host publication | Proceedings of the 19th ACM international conference on Information and knowledge management |
Place of Publication | New York |
Publisher | ACM |
Pages | 1401-1404 |
ISBN (Print) | 978-1-4503-0099-5 |
DOIs | |
Publication status | Published - 2010 |
Event | Proceedings of the 19th {ACM} Conference on Information and Knowledge Management, {CIKM} 2010, Toronto, Ontario, Canada, October 26-30, 2010 - Duration: 1 Jan 2010 → … |
Conference
Conference | Proceedings of the 19th {ACM} Conference on Information and Knowledge Management, {CIKM} 2010, Toronto, Ontario, Canada, October 26-30, 2010 |
---|---|
Period | 1/01/10 → … |