%0 Conference Paper %1 marinho:ecml2009 %A Wang, Jian %A Hong, Liangjie %A Davison, Brian D. %B ECML PKDD Discovery Challenge 2009 (DC09) %C Bled, Slovenia %D 2009 %E Eisterlehner, Folke %E Hotho, Andreas %E Jäschke, Robert %I CEUR Workshop Proceedings %K 2009 ECML09 _todo recommendation tagging %P 261--274 %T RSDC’09: Tag Recommendation Using Keywords and Association Rules %U http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-497/ %V 497 %X While a webpage usually contains hundreds of words, there are only two to three tags that would typically be assigned to this page. Most tags could be found in related aspects of the page, such as the page own content, the anchor texts around the page, and the user’s own opinion about the page. Thus it is not an easy job to extract the most appropriate two to three tags to recommend for a target user. In addition, the recommendations should be unique for every user, since everyone’s perspective for the page is different. In this paper, we treat the task of recommending tags as to find the most likely tags that would be chosen by the user. We first applied the TF-IDF algorithm on the limited description of the page content, in order to extract the keywords for the page. Based on these top keywords, association rules from history records are utilized to find the most probable tags to recommend. In addition, if the page has been tagged before by other users or the user has tagged other resources before, that history information is also exploited to find the most appropriate recommendations.

@inproceedings{marinho:ecml2009, abstract = {While a webpage usually contains hundreds of words, there are only two to three tags that would typically be assigned to this page. Most tags could be found in related aspects of the page, such as the page own content, the anchor texts around the page, and the user’s own opinion about the page. Thus it is not an easy job to extract the most appropriate two to three tags to recommend for a target user. In addition, the recommendations should be unique for every user, since everyone’s perspective for the page is different. In this paper, we treat the task of recommending tags as to find the most likely tags that would be chosen by the user. We first applied the TF-IDF algorithm on the limited description of the page content, in order to extract the keywords for the page. Based on these top keywords, association rules from history records are utilized to find the most probable tags to recommend. In addition, if the page has been tagged before by other users or the user has tagged other resources before, that history information is also exploited to find the most appropriate recommendations.}, added-at = {2010-01-29T17:00:11.000+0100}, address = {Bled, Slovenia}, author = {Wang, Jian and Hong, Liangjie and Davison, Brian D.}, biburl = {https://www.bibsonomy.org/bibtex/21bc4255882a35050c1e969544fe5f13e/trude}, booktitle = {ECML PKDD Discovery Challenge 2009 (DC09)}, editor = {Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert}, interhash = {b007380417efc05b69a147b319ea590c}, intrahash = {1bc4255882a35050c1e969544fe5f13e}, issn = {1613-0073}, keywords = {2009 ECML09 _todo recommendation tagging}, month = {September}, pages = {261--274}, publisher = {CEUR Workshop Proceedings}, timestamp = {2010-01-29T17:00:11.000+0100}, title = {RSDC’09: Tag Recommendation Using Keywords and Association Rules}, url = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-497/}, volume = 497, year = 2009 }