We consider the problem of tag prediction in collaborative
tagging systems where users share and annotate resources on the Web.
We put forward HAMLET, a novel approach to automatically propa-
gate tags along the edges of a graph which relates similar documents.
We identify the core principles underlying tag propagation for which
we derive suitable scoring models combined in one overall ranking for-
mula. Leveraging these scores, we present an efficient top-k tag selection
algorithm that infers additional tags by carefully inspecting neighbors
in the document graph. Experiments using real-world data demonstrate
the viability of our approach in large-scale environments where tags are
scarce.
%0 Conference Paper
%1 conf/esws/BuduraMCA09
%A Budura, Adriana
%A Michel, Sebastian
%A Cudré-Mauroux, Philippe
%A Aberer, Karl
%B ESWC
%D 2009
%E Aroyo, Lora
%E Traverso, Paolo
%E Ciravegna, Fabio
%E Cimiano, Philipp
%E Heath, Tom
%E Hyvönen, Eero
%E Mizoguchi, Riichiro
%E Oren, Eyal
%E Sabou, Marta
%E Simperl, Elena Paslaru Bontas
%I Springer
%K hamlet prediction semantic tag tagging
%P 608-622
%T Neighborhood-Based Tag Prediction.
%U http://dblp.uni-trier.de/db/conf/esws/eswc2009.html#BuduraMCA09
%V 5554
%X We consider the problem of tag prediction in collaborative
tagging systems where users share and annotate resources on the Web.
We put forward HAMLET, a novel approach to automatically propa-
gate tags along the edges of a graph which relates similar documents.
We identify the core principles underlying tag propagation for which
we derive suitable scoring models combined in one overall ranking for-
mula. Leveraging these scores, we present an efficient top-k tag selection
algorithm that infers additional tags by carefully inspecting neighbors
in the document graph. Experiments using real-world data demonstrate
the viability of our approach in large-scale environments where tags are
scarce.
%@ 978-3-642-02120-6
@inproceedings{conf/esws/BuduraMCA09,
abstract = { We consider the problem of tag prediction in collaborative
tagging systems where users share and annotate resources on the Web.
We put forward HAMLET, a novel approach to automatically propa-
gate tags along the edges of a graph which relates similar documents.
We identify the core principles underlying tag propagation for which
we derive suitable scoring models combined in one overall ranking for-
mula. Leveraging these scores, we present an efficient top-k tag selection
algorithm that infers additional tags by carefully inspecting neighbors
in the document graph. Experiments using real-world data demonstrate
the viability of our approach in large-scale environments where tags are
scarce.},
added-at = {2009-10-24T15:39:16.000+0200},
author = {Budura, Adriana and Michel, Sebastian and Cudré-Mauroux, Philippe and Aberer, Karl},
biburl = {https://www.bibsonomy.org/bibtex/2216dc9c9549121b604fd97dd92bc9a50/arminhs},
booktitle = {ESWC},
crossref = {conf/esws/2009},
date = {2009-05-23},
description = {dblp},
editor = {Aroyo, Lora and Traverso, Paolo and Ciravegna, Fabio and Cimiano, Philipp and Heath, Tom and Hyvönen, Eero and Mizoguchi, Riichiro and Oren, Eyal and Sabou, Marta and Simperl, Elena Paslaru Bontas},
ee = {http://dx.doi.org/10.1007/978-3-642-02121-3_45},
interhash = {78f40972ddb612f25e9db2d08d7536a3},
intrahash = {216dc9c9549121b604fd97dd92bc9a50},
isbn = {978-3-642-02120-6},
keywords = {hamlet prediction semantic tag tagging},
pages = {608-622},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2009-10-24T15:39:16.000+0200},
title = {Neighborhood-Based Tag Prediction.},
url = {http://dblp.uni-trier.de/db/conf/esws/eswc2009.html#BuduraMCA09},
volume = 5554,
year = 2009
}