<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/jaeschke/engine"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/jaeschke/engine</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e64d14f3207766f4afc65983fa759ffe/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e64d14f3207766f4afc65983fa759ffe/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.kde.cs.uni-kassel.de/pub/pdf/krause2008logsonomy.pdf"/><swrc:date>Thu Jan 27 12:08:28 CET 2011</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>HT &#039;08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia</swrc:booktitle><swrc:pages>157--166</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Logsonomy - Social Information Retrieval with Logdata</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>2008 engine information l3s logsonomy myown retrieval search wp5 analysis network sna social </swrc:keywords><swrc:abstract>Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration.
Today’s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect
the answer to be of relevance. 
This clickdata can be represented as a folksonomy in which queries are descriptions of
clicked URLs. The resulting network structure, which we will term logsonomy is very
similar to the one of folksonomies. In order to find out about its properties, we analyze
the topological characteristics of the tripartite hypergraph of queries, users and bookmarks
on a large snapshot of del.icio.us and on query logs of two large search engines.
All of the three datasets show small world properties. The tagging behavior of users,
which is explained by preferential attachment of the tags in social bookmark systems, is
reflected in the distribution of single query words in search engines. We can conclude
that the clicking behaviour of search engine users based on the displayed search results
and the tagging behaviour of social bookmarking users is driven by similar dynamics.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="Pittsburgh, PA, USA" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-1-59593-985-2" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="17" swrc:key="vgwort"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1145/1379092.1379123" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Beate Krause"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Robert Jäschke"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Andreas Hotho"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Gerd Stumme"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27eb26a177187ea8cf788cc897d66ee48/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/27eb26a177187ea8cf788cc897d66ee48/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.kde.cs.uni-kassel.de/hotho/pub/2008/Krause2008logsonomy_short.pdf"/><swrc:date>Sat Mar 27 18:34:13 CET 2010</swrc:date><swrc:address>Menlo Park, CA, USA</swrc:address><swrc:booktitle>Proceedings of the Second International Conference on Weblogs and Social Media (ICWSM 2008)</swrc:booktitle><swrc:pages>192--193</swrc:pages><swrc:publisher><swrc:Organization swrc:name="AAAI Press"/></swrc:publisher><swrc:title>Logsonomy -- A Search Engine Folksonomy</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>2008 engine folksonomy l3s logsonomy myown search wp5 </swrc:keywords><swrc:abstract>In social bookmarking systems users describe bookmarks
by keywords called tags. The structure behind
these social systems, called folksonomies, can be
viewed as a tripartite hypergraph of user, tag and resource
nodes. This underlying network shows specific
structural properties that explain its growth and the possibility
of serendipitous exploration.
Search engines filter the vast information of the web.
Queries describe a user’s information need. In response
to the displayed results of the search engine, users click
on the links of the result page as they expect the answer
to be of relevance. The clickdata can be represented as a
folksonomy in which queries are descriptions of clicked
URLs. This poster analyzes the topological characteristics
of the resulting tripartite hypergraph of queries,
users and bookmarks of two query logs and compares it
two a snapshot of the folksonomy del.icio.us.
</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="978-1-57735-355-3" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="7" swrc:key="vgwort"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Robert Jäschke"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Beate Krause"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Andreas Hotho"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Gerd Stumme"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/270539954a20f7d03a1f21764ff62c0ff/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/270539954a20f7d03a1f21764ff62c0ff/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.wsdm2009.org/wsdm2009_antonellis.pdf"/><swrc:date>Fri Oct 16 10:26:15 CEST 2009</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>WSDM (Late Breaking-Results)</swrc:booktitle><swrc:crossref>conf/wsdm/2009</swrc:crossref><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Tagging with Queries: How and Why?</swrc:title><swrc:year>2009</swrc:year><swrc:keywords>engine logsonomy query-log-analysis search tagging </swrc:keywords><swrc:abstract>Web search queries capture the information need of search engine users. Search engines store these queries in their logs and analyze them to guide their search results.
In this work, we argue that not only a search engine can benefit from data stored in these logs, but also the web users. We first show how clickthrough logs can be collected in a distributed fashion using the http referer field in web server access logs. We then perform a set of experiments to study the information value of search engine queries when treated as &#034;tags&#034; or &#034;labels&#034; for the web pages that both appear as a result and the user actually clicks on. We ask how much extra information these query tags provide for web pages
by comparing them to tags from the del.icio.us bookmarking site and to the pagetext. We find that query tags can provide substantially many (on average 250 tags per URL), new tags (on average 125 tags per URL are not present in the pagetext) for a large fraction of the Web.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="978-1-60558-390-7" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009-03-12" swrc:key="date"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ioannis Antonellis"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Hector Garcia-Molina"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Jawed Karim"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ricardo A. Baeza-Yates"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Paolo Boldi"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Berthier A. Ribeiro-Neto"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Berkant Barla Cambazoglu"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23a5f9c847318543dbf32b434656d8065/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23a5f9c847318543dbf32b434656d8065/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6VRG-45H0GV7-5/2/16726cebdcde67ba7aeb95cc91e797bf"/><swrc:date>Wed Jun 10 10:08:20 CEST 2009</swrc:date><swrc:journal>Computer Networks</swrc:journal><swrc:month>jun</swrc:month><swrc:number>3</swrc:number><swrc:pages>303--310</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Elsevier"/></swrc:publisher><swrc:title>A novel Web usage mining approach for search engines</swrc:title><swrc:volume>39</swrc:volume><swrc:year>2002</swrc:year><swrc:keywords>engine mining search usage web </swrc:keywords><swrc:abstract>Web usage mining can be very useful to search engines. This paper proposes a novel effective approach to exploit the relationships among users, queries and resources based on the search engine&#039;s log. How this method can be applied is illustrated by a Chinese image search engine.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1389-1286" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1016/S1389-1286(02)00211-6" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dell Zhang"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Yisheng Dong"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ian F. Akyildiz"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Harry Rudin"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/233b448de19ddef891f2a4284b1cc42f1/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/233b448de19ddef891f2a4284b1cc42f1/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://doi.acm.org/10.1145/988672.988728"/><swrc:date>Tue May 16 12:12:26 CEST 2006</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>Proceedings of the 13th international conference on World Wide Web</swrc:booktitle><swrc:pages>413--421</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM Press"/></swrc:publisher><swrc:title>A community-aware search engine</swrc:title><swrc:year>2004</swrc:year><swrc:keywords>search engine detection hits community network </swrc:keywords><swrc:abstract> 	
Current search technologies work in a &#034;one size fits all&#034; fashion. Therefore, the answer to a query is independent of specific user information need. In this paper we describe a novel ranking technique for personalized search servicesthat combines content-based and community-based evidences. The community-based information is used in order to provide context for queries andis influenced by the current interaction of the user with the service. Ouralgorithm is evaluated using data derived from an actual service available on the Web an online bookstore. We show that the quality of content-based ranking strategies can be improved by the use of communityinformation as another evidential source of relevance. In our experiments the improvements reach up to 48% in terms of average precision.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1-58113-844-X" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Rodrigo B. Almeida"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Virgilio A. F. Almeida"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ab5c85d78daba236ca1bb5ad49865ee5/jaeschke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ab5c85d78daba236ca1bb5ad49865ee5/jaeschke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/cikm/cikm2004.html#DingFJPCPRDS04"/><swrc:date>Fri Mar 31 11:28:50 CEST 2006</swrc:date><swrc:booktitle>CIKM</swrc:booktitle><swrc:pages>652-659</swrc:pages><swrc:title>Swoogle: a search and metadata engine for the semantic web.</swrc:title><swrc:year>2004</swrc:year><swrc:keywords>search web engine metadate swoogle semantic seminar2006 </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/1031289" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Li Ding"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Timothy W. Finin"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Anupam Joshi"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Rong Pan"/></rdf:_4><rdf:_5><swrc:Person swrc:name="R. Scott Cost"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Yun Peng"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Pavan Reddivari"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Vishal Doshi"/></rdf:_8><rdf:_9><swrc:Person swrc:name="Joel Sachs"/></rdf:_9></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>
