Community-based ranking of the social web Conference Paper uri icon

abstract

  • The rise of social interactions on the Web requires developing new methods of information organization and discovery. To that end, we propose a generative community-based probabilistic tagging model that can automatically uncover communities of users and their associated tags. We experimentally validate the quality of the discovered communities over the social bookmarking system Delicious. In comparison to an alternative generative model (Latent Dirichlet Allocation (LDA), we find that the proposed communitybased model improves the empirical likelihood of held-out test data and discovers more coherent interest-based communities. Based on the community-based probabilistic tagging model, we develop a novel community-based ranking model for effective community-based exploration of socially-tagged Web resources. We compare community-based ranking to three state-of-the-art retrieval models: (i) BM25; (ii) Cluster-based retrieval using K-means clustering; and (iii) LDA-based retrieval. We find that the proposed ranking model results in a significant improvement over these alternatives (from 7% to 22%) in the quality of retrieved pages. Copyright 2010 ACM.

altmetric score

  • 3

author list (cited authors)

  • Kashoob, S., Caverlee, J., & Kamath, K.

citation count

  • 7

editor list (cited editors)

  • Chignell, M. H., & Toms, E. G.

publication date

  • January 2010