The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.
%0 Journal Article
%1 landia2013deeper
%A Landia, Nikolas
%A Doerfel, Stephan
%A Jäschke, Robert
%A Anand, Sarabjot Singh
%A Hotho, Andreas
%A Griffiths, Nathan
%D 2013
%J cs.IR
%K folkrank folksonomy graph
%T Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations
%U http://arxiv.org/abs/1310.1498
%V 1310.1498
%X The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.
@article{landia2013deeper,
abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.},
added-at = {2014-04-22T17:31:49.000+0200},
author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan},
biburl = {https://www.bibsonomy.org/bibtex/2e585a92994be476480545eb62d741642/schwemmlein},
interhash = {e8095b13630452ce3ecbae582f32f4bc},
intrahash = {e585a92994be476480545eb62d741642},
journal = {cs.IR},
keywords = {folkrank folksonomy graph},
timestamp = {2014-04-22T17:31:49.000+0200},
title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations},
url = {http://arxiv.org/abs/1310.1498},
volume = {1310.1498},
year = 2013
}