@inproceedings{hotho06-information, abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, 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.}, ad_pdf = {http://www.kde.cs.uni-kassel.de/hotho/pub/2006/seach2006hotho_eswc.pdf}, address = {Heidelberg}, author = {Hotho, Andreas and J�schke, Robert and Schmitz, Christoph and Stumme, Gerd}, booktitle = {The Semantic Web: Research and Applications}, editor = {Sure, York and Domingue, John}, interhash = {aa0a40dd836bfde8397409adfdc4a3f2}, intrahash = {b1e4dabc5b558aeea1b839a7f123eef1}, lastdatemodified = {2006-07-18}, lastname = {Hotho}, month = {June}, own = {own}, pages = {411-426}, pdf = {hotho06-information.pdf}, publisher = {Springer}, read = {read}, series = {LNAI}, title = {Information Retrieval in Folksonomies: Search and Ranking}, url = {http://.kde.cs.uni-kassel.de/hotho}, volume = 4011, year = 2006 } @inproceedings{yanbe2007can, address = {New York, NY, USA}, author = {Yanbe, Yusuke and Jatowt, Adam and Nakamura, Satoshi and Tanaka, Katsumi}, booktitle = {JCDL '07: Proceedings of the 2007 conference on Digital libraries}, doi = {http://doi.acm.org/10.1145/1255175.1255198}, interhash = {13ebfc0942b5908890c3caaa7046fe50}, intrahash = {44655301162a726dfb242d32ec622047}, isbn = {978-1-59593-644-8}, location = {Vancouver, BC, Canada}, pages = {107--116}, publisher = {ACM Press}, title = {Can social bookmarking enhance search in the web?}, url = {http://portal.acm.org/citation.cfm?id=1255175.1255198}, year = 2007 } @inproceedings{gwizdka2007finding, author = {Gwizdka, Jacek and Cole, Michael}, booktitle = {ECDL}, crossref = {conf/ercimdl/2007}, date = {2007-08-31}, editor = {Kovács, László and Fuhr, Norbert and Meghini, Carlo}, ee = {http://dx.doi.org/10.1007/978-3-540-74851-9_69}, interhash = {99615c0d4a238579e5ecb3479bac2b9f}, intrahash = {9de38f48cf3ae0211d2fbe7ca9747abc}, isbn = {978-3-540-74850-2}, pages = {559-562}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Finding It on Google, Finding It on del.icio.us.}, url = {http://dblp.uni-trier.de/db/conf/ercimdl/ecdl2007.html#GwizdkaC07}, volume = 4675, year = 2007 } @inproceedings{jaeschke2008logsonomy, abstract = {In social bookmarking systems users describe bookmarksby keywords called tags. The structure behindthese social systems, called folksonomies, can beviewed as a tripartite hypergraph of user, tag and resourcenodes. This underlying network shows specificstructural properties that explain its growth and the possibilityof serendipitous exploration.Search engines filter the vast information of the web.Queries describe a user’s information need. In responseto the displayed results of the search engine, users clickon the links of the result page as they expect the answerto be of relevance. The clickdata can be represented as afolksonomy in which queries are descriptions of clickedURLs. This poster analyzes the topological characteristicsof the resulting tripartite hypergraph of queries,users and bookmarks of two query logs and compares ittwo a snapshot of the folksonomy del.icio.us.}, author = {Jäschke, Robert and Krause, Beate and Hotho, Andreas and Stumme, Gerd}, booktitle = {Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)}, interhash = {13ec3f45fc7e0364cdc6b9a7c12c5c2c}, intrahash = {359e1eccdc524334d4a2ad51330f76ae}, publisher = {AAAI Press}, title = {Logsonomy -- A Search Engine Folksonomy}, url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2008/Krause2008logsonomy_short.pdf}, year = 2008 } @incollection{baezayates2006intention, abstract = {The identification of the user’s intention or interest through queries that they submit to a search engine can be very usefulto offer them more adequate results. In this work we present a framework for the identification of user’s interest in an automaticway, based on the analysis of query logs. This identification is made from two perspectives, the objectives or goals of auser and the categories in which these aims are situated. A manual classification of the queries was made in order to havea reference point and then we applied supervised and unsupervised learning techniques. The results obtained show that fora considerable amount of cases supervised learning is a good option, however through unsupervised learning we found relationshipsbetween users and behaviors that are not easy to detect just taking the query words. Also, through unsupervised learning weestablished that there are categories that we are not able to determine in contrast with other classes that were not consideredbut naturally appear after the clustering process. This allowed us to establish that the combination of supervised and unsupervisedlearning is a good alternative to find user’s goals. From supervised learning we can identify the user interest given certainestablished goals and categories; on the other hand, with unsupervised learning we can validate the goals and categories used,refine them and select the most appropriate to the user’s needs.}, author = {Baeza-Yates, Ricardo and Calderón-Benavides, Liliana and González-Caro, Cristina}, booktitle = {String Processing and Information Retrieval}, interhash = {92e5f2f5208b5ce2f066dd361ae15758}, intrahash = {e8e9a1978890069b8bf1ef3440e88e3d}, pages = {98--109}, publisher = {Springer Berlin / Heidelberg}, title = {The Intention Behind Web Queries}, url = {http://dx.doi.org/10.1007/11880561_9}, year = 2006 } @inproceedings{hotho2006information, abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, 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 findcommunities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset.}, address = {Heidelberg}, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, booktitle = {The Semantic Web: Research and Applications}, editor = {Sure, York and Domingue, John}, file = {hotho2006information.pdf:hotho2006information.pdf:PDF}, groups = {public}, interhash = {10ec64d80b0ac085328a953bb494fb89}, intrahash = {3c301945817681d637ee43901c016939}, month = {June}, pages = {411-426}, pdf = {hotho2006information.pdf}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2010-11-11 15:34:51}, title = {Information Retrieval in Folksonomies: Search and Ranking}, username = {dbenz}, volume = 4011, year = 2006 }