@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.}, author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan}, interhash = {e8095b13630452ce3ecbae582f32f4bc}, intrahash = {e585a92994be476480545eb62d741642}, journal = {cs.IR}, 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 } @article{Zhang20125759, abstract = {Social tagging is one of the most important ways to organize and index online resources. Recommendation in social tagging systems, e.g. tag recommendation, item recommendation and user recommendation, is used to improve the quality of tags and to ease the tagging or searching process. Existing works usually provide recommendations by analyzing relation information in social tagging systems, suffering a lot from the over sparse problem. These approaches ignore information contained in the content of resources, which we believe should be considered to improve recommendation quality and to deal with the over sparse problem. In this paper we propose a recommendation approach for social tagging systems that combines content and relation analysis in a single model. By modeling the generating process of social tagging systems in a latent Dirichlet allocation approach, we build a fully generative model for social tagging, leverage it to estimate the relation between users, tags and resources and achieve tag, item and user recommendation tasks. The model is evaluated using a CiteULike data snapshot, and results show improvements in metrics for various recommendation tasks.}, author = {Zhang, Yin and Zhang, Bin and Gao, Kening and Guo, Pengwei and Sun, Daming}, doi = {10.1016/j.physa.2012.05.013}, interhash = {088ad59c786579d399aaee48db5e6a7a}, intrahash = {84f824839090a5e20394b85a9e1cef08}, issn = {0378-4371}, journal = {Physica A: Statistical Mechanics and its Applications}, number = 22, pages = {5759 - 5768}, title = {Combining content and relation analysis for recommendation in social tagging systems}, url = {http://www.sciencedirect.com/science/article/pii/S0378437112003846}, volume = 391, year = 2012 } @inproceedings{Doerfel:2012:LPM:2365934.2365937, abstract = {The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.}, acmid = {2365937}, address = {New York, NY, USA}, author = {Doerfel, Stephan and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd}, booktitle = {Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web}, doi = {10.1145/2365934.2365937}, interhash = {beb2c81daf975eeed6e01e1b412196b1}, intrahash = {e5c2266da34a9167352615827cc4670d}, isbn = {978-1-4503-1638-5}, location = {Dublin, Ireland}, numpages = {8}, pages = {9--16}, publisher = {ACM}, series = {RSWeb '12}, title = {Leveraging publication metadata and social data into FolkRank for scientific publication recommendation}, url = {http://doi.acm.org/10.1145/2365934.2365937}, year = 2012 } @inproceedings{Landia:2012:EFC:2365934.2365936, abstract = {Real-world tagging datasets have a large proportion of new/ untagged documents. Few approaches for recommending tags to a user for a document address this new item problem, concentrating instead on artificially created post-core datasets where it is guaranteed that the user as well as the document of each test post is known to the system and already has some tags assigned to it. In order to recommend tags for new documents, approaches are required which model documents not only based on the tags assigned to them in the past (if any), but also the content. In this paper we present a novel adaptation to the widely recognised FolkRank tag recommendation algorithm by including content data. We adapt the FolkRank graph to use word nodes instead of document nodes, enabling it to recommend tags for new documents based on their textual content. Our adaptations make FolkRank applicable to post-core 1 ie. the full real-world tagging datasets and address the new item problem in tag recommendation. For comparison, we also apply and evaluate the same methodology of including content on a simpler tag recommendation algorithm. This results in a less expensive recommender which suggests a combination of user related and document content related tags.

Including content data into FolkRank shows an improvement over plain FolkRank on full tagging datasets. However, we also observe that our simpler content-aware tag recommender outperforms FolkRank with content data. Our results suggest that an optimisation of the weighting method of FolkRank is required to achieve better results.}, acmid = {2365936}, address = {New York, NY, USA}, author = {Landia, Nikolas and Anand, Sarabjot Singh and Hotho, Andreas and J\"{a}schke, Robert and Doerfel, Stephan and Mitzlaff, Folke}, booktitle = {Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web}, doi = {10.1145/2365934.2365936}, interhash = {2ce2874d37fd3b90c9f6a46a7a08e94b}, intrahash = {a97bf903435d6fc4fc61e2bb7e3913b9}, isbn = {978-1-4503-1638-5}, location = {Dublin, Ireland}, numpages = {8}, pages = {1--8}, publisher = {ACM}, series = {RSWeb '12}, title = {Extending FolkRank with content data}, url = {http://doi.acm.org/10.1145/2365934.2365936}, year = 2012 } @inproceedings{kim2011personalized, abstract = {This paper looks inside FolkRank, one of the well-known folksonomy-based algorithms, to present its fundamental properties and promising possibilities for improving performance in tag recommendations. Moreover, we introduce a new way to compute a differential approach in FolkRank by representing it as a linear combination of the personalized PageRank vectors. By the linear combination, we present FolkRank's probabilistic interpretation that grasps how FolkRank works on a folksonomy graph in terms of the random surfer model. We also propose new FolkRank-like methods for tag recommendations to efficiently compute tags' rankings and thus reduce expensive computational cost of FolkRank. We show that the FolkRank approaches are feasible to recommend tags in real-time scenarios as well. The experimental evaluations show that the proposed methods provide fast tag recommendations with reasonable quality, as compared to FolkRank. Additionally, we discuss the diversity of the top n tags recommended by FolkRank and its variants.}, acmid = {2043945}, address = {New York, NY, USA}, author = {Kim, Heung-Nam and El Saddik, Abdulmotaleb}, booktitle = {Proceedings of the fifth ACM conference on Recommender systems}, doi = {10.1145/2043932.2043945}, interhash = {1004b267b14d0abde0f8ac3a7ceadd38}, intrahash = {f022e60c5928e01c701d7ec539ec221b}, isbn = {978-1-4503-0683-6}, location = {Chicago, Illinois, USA}, numpages = {8}, pages = {45--52}, publisher = {ACM}, title = {Personalized PageRank vectors for tag recommendations: inside FolkRank}, url = {http://doi.acm.org/10.1145/2043932.2043945}, year = 2011 } @inproceedings{AlKhalifa:2007, abstract = {Users tag resources for a variety of reasons and using a variety of conventions. The tags that they provide are stored in social bookmarking services, so these services can provide a rich gateway to a wide and interesting quantity of web resources. The cognitive effort that has gone into making these tags has presumably added value to the description of the resource. In this work we utilize the quantitative value of these tags for ranking bookmarked web resources in social bookmarking services. Our proposed solution is called CoolRank, a simple and intuitive model to rank bookmarked web resources in a social bookmarking service, such as del.icio.us. CoolRank makes use of both quantitative information, based on the number of people who have bookmarked a web resource, and subjective information, based on the words people have used in their tags.}, author = {Al-Khalifa, H.S.}, booktitle = {Innovations in Information Technology, 2007. Innovations '07. 4th International Conference on}, doi = {10.1109/IIT.2007.4430482}, interhash = {a6babb1a2f926cca3e8fe0258337e864}, intrahash = {4671fb1c606e3d7f559bb25d9b20e47d}, isbn = {978-1-4244-1841-1}, pages = {208-212}, title = {CoolRank: A Social Solution for Ranking Bookmarked Web Resources}, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4430482}, year = 2007 } @inproceedings{hotho2006information, address = {Budva, Montenegro}, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, booktitle = {Proceedings of the 3rd European Semantic Web Conference }, interhash = {10ec64d80b0ac085328a953bb494fb89}, intrahash = {7da1127fc4836e2cf58e3073f1b888b2}, isbn = {3-540-34544-2}, month = {June}, pages = {411-426}, publisher = {Springer}, series = {LNCS}, title = {Information Retrieval in Folksonomies: Search and Ranking}, url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2006/seach2006hotho_eswc.pdf}, vgwort = {29}, volume = 4011, year = 2006 } @inproceedings{hotho2006folkrank, abstract = { In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006.}, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, booktitle = {Proc. FGIR 2006}, interhash = {3468dc3fed17eadf2e7c6ff06fbb34a3}, intrahash = {4d8b4f79814691fbe6db8357d63206a1}, issn = {0941-3014}, pages = {111-114}, title = {FolkRank: A Ranking Algorithm for Folksonomies}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006folkrank.pdf}, vgwort = {8}, year = 2006 } @article{gibson00clustering, author = {Gibson, David and Kleinberg, Jon M. and Raghavan, Prabhakar}, interhash = {8a2ea9a413538069328404c0bfe9c656}, intrahash = {5205d8f52b2a8f22b63dd40bdd99746a}, journal = {VLDB Journal: Very Large Data Bases}, number = {3--4}, pages = {222--236}, title = {Clustering Categorical Data: An Approach Based on Dynamical Systems}, url = {http://citeseer.ist.psu.edu/cache/papers/cs/157/http:zSzzSzcs.cornell.eduzSzInfozSzPeoplezSzkleinberzSzvldb98.pdf/gibson98clustering.pdf}, volume = 8, year = 2000 }