Exploiting co-occurrence and information quality metrics to recommend tags in web 2.0 applications

Authors:
Fabiano Muniz Belém;Eder Ferreira Martins;Jussara Marques Almeida;Marcos André Gonçalves;Gisele Lobo Pappa
Affiliations:
Universidade Federal de Minas Gerais, Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
Venue:
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Year:
2010

Citing 7
Cited 0

Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
MultiTube--Where Web 2.0 and Multimedia Could Meet

IEEE MultiMedia
Flickr tag recommendation based on collective knowledge

Proceedings of the 17th international conference on World Wide Web
Social tag prediction

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Personalized, interactive tag recommendation for flickr

Proceedings of the 2008 ACM conference on Recommender systems
Latent dirichlet allocation for tag recommendation

Proceedings of the third ACM conference on Recommender systems
Evidence of quality of textual features on the web 2.0

Proceedings of the 18th ACM conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work addresses the task of recommending high quality tags by exploiting not only previously assigned tags, but also terms extracted from other textual features (e.g., title and description) associated with the target object.To estimate the quality of a candidate tag recommendation, we use several metrics related to both tag co-occurrence and information quality. We also propose a heuristic function to combine the metrics to produce a final ranking of the recommended tags. We evaluate our heuristic function in various scenarios, for three popular Web 2.0 applications. Our experimental results indicate that our heuristic function significantly outperforms two state-of-the-art tag recommendation algorithms.