@inproceedings{Jaeschke2008logsonomy, 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.}, added-at = {2010-02-04T09:21:48.000+0100}, address = {Menlo Park, CA, USA}, author = {Jäschke, Robert and Krause, Beate and Hotho, Andreas and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/27eb26a177187ea8cf788cc897d66ee48/nepomuk}, booktitle = {Proceedings of the Second International Conference on Weblogs and Social Media (ICWSM 2008)}, interhash = {13ec3f45fc7e0364cdc6b9a7c12c5c2c}, intrahash = {7eb26a177187ea8cf788cc897d66ee48}, isbn = {978-1-57735-355-3}, keywords = {2008 engine folksonomy from:jaeschke l3s logsonomy myown search wp5}, pages = {192--193}, publisher = {AAAI Press}, timestamp = {2010-02-04T09:21:48.000+0100}, title = {Logsonomy -- A Search Engine Folksonomy}, url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2008/Krause2008logsonomy_short.pdf}, vgwort = {7}, year = 2008 } @inproceedings{krause2008logsonomy, 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.}, added-at = {2009-05-13T09:36:02.000+0200}, address = {New York, NY, USA}, author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/2e64d14f3207766f4afc65983fa759ffe/nepomuk}, booktitle = {HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia}, doi = {http://doi.acm.org/10.1145/1379092.1379123}, interhash = {6d34ea1823d95b9dbf37d4db4d125d2a}, intrahash = {e64d14f3207766f4afc65983fa759ffe}, isbn = {978-1-59593-985-2}, keywords = {2008 analysis engine from:jaeschke information l3s logsonomy myown network retrieval search social wp5}, location = {Pittsburgh, PA, USA}, pages = {157--166}, publisher = {ACM}, timestamp = {2009-05-13T09:36:02.000+0200}, title = {Logsonomy - Social Information Retrieval with Logdata}, url = {http://portal.acm.org/citation.cfm?id=1379092.1379123&coll=ACM&dl=ACM&type=series&idx=SERIES399&part=series&WantType=Journals&title=Proceedings%20of%20the%20nineteenth%20ACM%20conference%20on%20Hypertext%20and%20hypermedia}, vgwort = {17}, year = 2008 } @inproceedings{Kawase2009, added-at = {2009-01-21T12:00:38.000+0100}, address = {Lisboa, Protugal}, author = {Kawase, Ricardo and Minack, Enrico and Nejdl, Wolfgang and Araújo, Samur and Schwabe, Daniel}, biburl = {http://www.bibsonomy.org/bibtex/269154807daccfd5a4e4c72cbc2e40708/nepomuk}, booktitle = {International Conference on Web Information Systems and Technologies (WEBIST)}, interhash = {147335cf90c7ecd787ba7806d9130d4a}, intrahash = {69154807daccfd5a4e4c72cbc2e40708}, keywords = {Desktop L3S NEPOMUK Nepomuk Semantic WP2 from:mie}, timestamp = {2009-01-21T12:00:38.000+0100}, title = {Incremental End-User Query Construction for the Semantic Desktop}, year = 2009 } @inproceedings{conf/semweb/MinackSZZ08, added-at = {2009-01-21T12:00:38.000+0100}, author = {Minack, Enrico and Siberski, Wolf and Zenz, Gideon and Zhou, Xuan}, biburl = {http://www.bibsonomy.org/bibtex/25ffa7823d50d39a4156269b862aff1d8/nepomuk}, booktitle = {International Semantic Web Conference (Posters & Demos)}, crossref = {conf/semweb/2008p}, editor = {Bizer, Christian and Joshi, Anupam}, ee = {http://ceur-ws.org/Vol-401/iswc2008pd_submission_40.pdf}, interhash = {ce37b610fe33ce6d8be83b5384937539}, intrahash = {5ffa7823d50d39a4156269b862aff1d8}, keywords = {L3S Nepomuk WP2 from:mie}, publisher = {CEUR-WS.org}, series = {CEUR Workshop Proceedings}, timestamp = {2009-01-21T12:00:38.000+0100}, title = {SUITS4RDF: Incremental Query Construction for the Semantic Web.}, url = {http://dblp.uni-trier.de/db/conf/semweb/iswc2008p.html#MinackSZZ08}, volume = 401, year = 2008 } @article{DemartiniN08, abstract = {Expert retrieval has attracted deep attention because of the huge economical impact it can have on enterprises. The classical dataset on which to perform this task is company intranet (i.e., personal pages, e-mails, documents). We propose a new system for nding experts in the user's desktop content. Looking at private documents and e-mails of the user, the system builds expert pro les for all the people named in the desktop. This allows the search system to focus on the user's topics of interest thus generating satisfactory results on topics well represented on the desktop. We show, with an arti cial test collection, how the desktop content is appropriate for nding experts on the topic the user is interested in.}, added-at = {2009-01-21T11:18:18.000+0100}, author = {Demartini, Gianluca and Niederée, Claudia}, biburl = {http://www.bibsonomy.org/bibtex/2b0ddf832fe0f348365b55c2a06d06789/nepomuk}, interhash = {189cd19d6c364d3571c6860e771b2a4b}, intrahash = {b0ddf832fe0f348365b55c2a06d06789}, keywords = {10 2008 from:demartini l3s lang:en wp5}, timestamp = {2009-01-21T11:18:18.000+0100}, title = {Finding Experts on the Semantic Desktop}, url = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-403/paper2.pdf}, year = 2008 } @inproceedings{SteDemNie08, abstract = {In this paper we present metadata based recommendation algorithms addressing two scenarios within social desktop communities: a) recommendation of resources from the co-worker's desktop, and b) recommendation of metadata for enriching the own annotation layer. Together with the algorithms we present first evaluation results as well as empirical evaluations showing that metadata based recommendations can be used in such distributed social desktop communities. }, added-at = {2009-01-21T09:47:09.000+0100}, address = {Linz, Austria}, author = {Stecher, Rodolfo and Demartini, Gianluca and Niederée, Claudia}, biburl = {http://www.bibsonomy.org/bibtex/2cc713ef72448b44e2a00473bf39d2fc3/nepomuk}, booktitle = {10th International Conference Information Integration and Web-based Applications & Services }, interhash = {4f3b1dca9652fb5a7b78fe42e8cde1f5}, intrahash = {cc713ef72448b44e2a00473bf39d2fc3}, keywords = {11-2008 L3S WP5 from:stecher}, month = { November}, timestamp = {2009-01-21T09:47:09.000+0100}, title = {Social Recommendations of Content and Metadata}, year = 2008 } @inproceedings{1458189, abstract = {We present a flexible information integration approach which addresses the dynamic integration needs in a personal desktop environment where only partial mappings are defined between the sources to be integrated. Our approach is based on query rewriting using substitution rules. In addition to exploiting defined mappings, we employ substitution strategies, which are inspired by the idea of using wildcards in querying and filtering tasks. Starting from a triple based query language as used for querying RDF data, unmapped ontological elements are substituted in a controlled way with variables, leading to a controlled form of query relaxation. In addition, the approach also provides evidences for refining the existing mapping based on the results of executing the relaxed queries. Different strategies for replacing non-matched ontology elements with variables are presented and evaluated over real-world data sets.}, added-at = {2009-01-21T09:47:09.000+0100}, address = {New York, NY, USA}, author = {Stecher, Rodolfo and Niederée, Claudia and Nejdl, Wolfgang}, biburl = {http://www.bibsonomy.org/bibtex/254a249ca255a0fe2c67230eb2a484756/nepomuk}, booktitle = {CIKM '08: Proceeding of the 17th ACM conference on Information and knowledge management}, doi = {http://doi.acm.org/10.1145/1458082.1458189}, interhash = {2fd3aa2834f5ed1f78b0a4f4ae61be3a}, intrahash = {54a249ca255a0fe2c67230eb2a484756}, isbn = {978-1-59593-991-3}, keywords = {10-2008 L3S WP5 from:stecher}, location = {Napa Valley, California, USA}, pages = {797--806}, publisher = {ACM}, timestamp = {2009-01-21T09:47:09.000+0100}, title = {Wildcards for lightweight information integration in virtual desktops}, year = 2008 } @article{4746741, abstract = {Light-weight information integration has to be able to effectively deal with settings where only partial mappings between the information sources to be integrated are defined. In our query rewriting approach, such partial mappings are used as the basis for defining several strategies to substitute elements in the query, and for introducing wildcards for relaxing the query when mappings are missing. The approach also supports the extension and refinement of the existing mappings based on the achieved query results and optional feedback of the user. This paper presents the proposed rewriting strategies, focusing on strategies exploiting ontological knowledge, and a comparison and evaluation of the strategies for real-world datasets.}, added-at = {2009-01-21T09:47:09.000+0100}, author = {Stecher, Rodolfo and Niederée, Claudia and Nejdl, Wolfgang}, biburl = {http://www.bibsonomy.org/bibtex/2006216392f06233f8888a67b222ae4a7/nepomuk}, doi = {10.1109/ICDIM.2008.4746741}, interhash = {0fa36681efb210b124ba4c18145dde76}, intrahash = {006216392f06233f8888a67b222ae4a7}, journal = {Digital Information Management, 2008. ICDIM 2008. Third International Conference on}, keywords = {11-2008 L3S WP5 from:stecher}, month = {Nov.}, pages = {375-380}, timestamp = {2009-01-21T09:47:09.000+0100}, title = {Query rewriting for lightweight information integration}, year = 2008 } @article{jaeschke2008discovering, abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.}, added-at = {2009-01-05T13:51:02.000+0100}, address = {New York}, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/218e8babe208fae2c0342438617b0ec31/nepomuk}, booktitle = {Semantic Web and Web 2.0}, description = {ScienceDirect - Web Semantics: Science, Services and Agents on the World Wide Web : Discovering shared conceptualizations in folksonomies}, doi = {10.1016/j.websem.2007.11.004}, editor = {Finin, T. and Mizoguchi, R. and Staab, S.}, interhash = {cfca594f9dbe30694bfbcdeb40dc4e88}, intrahash = {18e8babe208fae2c0342438617b0ec31}, issn = {1570-8268}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, keywords = {2008 analysis concept folksonomy formal from:jaeschke l3s myown tagging trias wp5}, month = Feb, number = 1, pages = {38--53}, publisher = {Elsevier}, timestamp = {2009-01-05T13:51:02.000+0100}, title = {Discovering Shared Conceptualizations in Folksonomies}, url = {http://www.sciencedirect.com/science/article/B758F-4R53WD4-1/2/ae56bd6e7132074272ca2035be13781b}, vgwort = {59}, volume = 6, year = 2008 } @incollection{hotho2008social, abstract = {BibSonomy ist ein kooperatives Verschlagwortungssystem (Social Bookmarking System), betrieben vom Fachgebiet Wissensverarbeitung der Universität Kassel. Es erlaubt das Speichern und Organisieren von Web-Lesezeichen und Metadaten für wissenschaftlichePublikationen. In diesem Beitrag beschreiben wir die von BibSonomy bereitgestellte Funktionalität, die dahinter stehende Architektursowie das zugrunde liegende Datenmodell. Ferner erläutern wir Anwendungsbeispiele und gehen auf Methoden zur Analyse der inBibSonomy und ähnlichen Systemen enthaltenen Daten ein.}, added-at = {2008-10-13T10:42:29.000+0200}, address = {Berlin, Heidelberg}, author = {Hotho, Andreas and Jäschke, Robert and Benz, Dominik and Grahl, Miranda and Krause, Beate and Schmitz, Christoph and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/25ccf05a86e7f1a089ae83dd47568e6de/nepomuk}, booktitle = {Social Semantic Web}, chapter = 18, description = {SpringerLink - Buchkapitel}, doi = {10.1007/978-3-540-72216-8}, editor = {Blumauer, Andreas and Pellegrini, Tassilo}, interhash = {79dbca4289cfe913aa7f7eb7e0dccea7}, intrahash = {5ccf05a86e7f1a089ae83dd47568e6de}, isbn = {978-3-540-72215-1}, issn = {1439-3107}, keywords = {2008 bibsonomy bookmarking from:jaeschke l3s myown social}, pages = {363--391}, publisher = {Springer}, series = {X.media.press}, timestamp = {2008-10-13T10:42:29.000+0200}, title = {Social Bookmarking am Beispiel BibSonomy}, url = {http://dx.doi.org/10.1007/978-3-540-72216-8_18}, year = 2009 } @inproceedings{1379123, added-at = {2008-10-08T16:12:30.000+0200}, address = {New York, NY, USA}, author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/2c7f43f2f922de1e7febedd10347e80cb/nepomuk}, booktitle = {HT '08: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia}, description = {HT: HT '08, Logsonomy - social information ...}, doi = {http://doi.acm.org/10.1145/1379092.1379123}, interhash = {6d34ea1823d95b9dbf37d4db4d125d2a}, intrahash = {c7f43f2f922de1e7febedd10347e80cb}, isbn = {978-1-59593-985-2}, keywords = {2008 from:jaeschke l3s logsonomy myown}, location = {Pittsburgh, PA, USA}, pages = {157--166}, publisher = {ACM}, timestamp = {2008-10-08T16:12:30.000+0200}, title = {Logsonomy - social information retrieval with logdata}, url = {http://portal.acm.org/citation.cfm?id=1379092.1379123&coll=ACM&dl=ACM&type=series&idx=SERIES399&part=series&WantType=Journals&title=Proceedings%20of%20the%20nineteenth%20ACM%20conference%20on%20Hypertext%20and%20hypermedia}, year = 2008 } @inproceedings{iceis08demartini, abstract = {Enterprise Search Systems are requested to provide more and more functionalities for supporting decision at the management level. An important aspect to consider is the human power and the knowledge which is available. For this reason, in this paper, after extracting a list of requirements out of a specific scenario, and presenting the previous work, we describe an improved approach to compare experts in order to retrieve and present to the user the most appropriate candidates for a given project}, added-at = {2008-08-13T11:22:16.000+0200}, author = {Demartini, Gianluca}, biburl = {http://www.bibsonomy.org/bibtex/2f5e9298a72b40bad37e1d4ab19b88801/nepomuk}, booktitle = {10th International Conference on Enterprise Information Systems, ICEIS 2008}, interhash = {b6ad402072a09ae2d52a6f1d16d35d5c}, intrahash = {f5e9298a72b40bad37e1d4ab19b88801}, keywords = {from:demartini l3s nepomuk wp5}, month = {June}, timestamp = {2008-08-13T11:22:16.000+0200}, title = {Comparing People in the Enterprise}, year = 2008 } @article{fews07demartini, abstract = {When we want to find experts on the Web we might want to search where the knowledge is created by the users. One of such knowledge repository is Wikipedia. People expertises are described in Wikipedia pages and also the Wikipedia users can be considered experts on the topics they produce content on. In this paper we propose algorithms to find experts in Wikipedia. The two different approaches are finding experts in the Wikipedia content or among the Wikipedia users. We also use semantics from WordNet and Yago in order to disambiguate expertise topics and to improve the retrieval effectiveness. In the end, we show how our methodology can be implemented in a system in order to improve the expert retrieval effectiveness.}, added-at = {2008-08-13T11:22:16.000+0200}, author = {Demartini, Gianluca}, biburl = {http://www.bibsonomy.org/bibtex/255d56872b4e905b6cf8612864b3bfa9b/nepomuk}, interhash = {36ad921facf53d5dc7b4f7c4b6e3f9d3}, intrahash = {55d56872b4e905b6cf8612864b3bfa9b}, journal = {FEWS 2007: Finding Experts on the Web with Semantics Workshop at ISWC 2007 + ASWC 2007}, keywords = {from:demartini l3s nepomuk wp5}, month = {November}, timestamp = {2008-08-13T11:22:16.000+0200}, title = {Finding Experts Using Wikipedia}, year = 2007 } @article{pikm07demartini, abstract = {Enterprise search is very different from Web search (for example in the link structure or in the user’s needs and goal) and some steps have been already done to exploit these differences in order to improve the effectiveness of enterprise search. In this paper we present the state of the art of the enterprise search field with some open issues. We also present a research plan that aims at using Information Retrieval, Semantic Web, and User Modelling techniques to cope with these issues improving the current state of enterprise search.}, added-at = {2008-08-13T11:22:16.000+0200}, author = {Demartini, Gianluca}, biburl = {http://www.bibsonomy.org/bibtex/2b3084a6c64ccf9314a1441b6d05b9469/nepomuk}, interhash = {029de3351a2dbf35c918d1f6581e371b}, intrahash = {b3084a6c64ccf9314a1441b6d05b9469}, journal = {PIKM 2007: 1st ACM International Workshop for Ph.D. Students in Information and Knowledge Management}, keywords = {from:demartini l3s nepomuk wp5}, month = {November}, timestamp = {2008-08-13T11:22:16.000+0200}, title = {Leveraging Semantic Technologies for Enterprise Search}, year = 2007 } @inproceedings{pim08chernov, abstract = {The effective evaluation of Personal Information Management is a crucial problem for the research community. While evaluation methodologies for retrieval on the Web and in digital libraries are well-developed, the experiments with the advanced desktop tools are neither repeatable nor comparable. As privacy concerns do not allow to copy and distribute personal data outside the research lab, we suggest to overcome this problem by creation of desktop datasets within different research groups using a single methodology and a common set of tools. A dataset can include not only a static snapshot of the desktop documents, but also the logs of user activity on the desktop within several last months. We present the structure of the required dataset, a set of implemented tools and a sample dataset collected within the L3S Research Center.}, added-at = {2008-08-13T11:22:16.000+0200}, author = {Chernov, Sergey and Demartini, Gianluca and Herder, Eelco and Kopycki, Michał and Nejdl, Wolfgang}, biburl = {http://www.bibsonomy.org/bibtex/249e729a1b7509260f06929d0fb97f86a/nepomuk}, booktitle = {Personal Information Management Workshop at CHI 2008}, interhash = {3723004d4c1f6403bd770971ad992145}, intrahash = {49e729a1b7509260f06929d0fb97f86a}, keywords = {from:demartini l3s nepomuk wp5}, month = {April}, timestamp = {2008-08-13T11:22:16.000+0200}, title = {Evaluating Personal Information Management Using an Activity Logs Enriched Desktop Dataset}, url = {http://pim2008.ethz.ch/papers/pim2008-chernov-etal.pdf}, year = 2008 } @article{DBLP:journals/ijwis/StecherNNB08, abstract = {The discovery of the "right" ontology or ontology part is a central ingredient for effective ontology re-use. We present an approach for supporting a form of adaptive re-use of sub-ontologies, where the ontologies are deeply integrated beyond pure referencing.}, added-at = {2008-07-24T17:14:09.000+0200}, author = {Stecher, Rodolfo and Niederée, Claudia and Nejdl, Wolfgang and Bouquet, Paolo}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {http://www.bibsonomy.org/bibtex/247c6f531a017f4831486a23ac9eae385/nepomuk}, editor = {Ibrahim, Ismail Khalil}, ee = {http://dx.doi.org/10.1108/17440080810882379}, interhash = {899e0d98b41d753c768ad68b7a04443f}, intrahash = {47c6f531a017f4831486a23ac9eae385}, journal = {IJWIS}, keywords = {2008 L3S from:stecher lang:en ontologies reuse}, number = 2, pages = {198-214}, timestamp = {2008-07-24T17:14:09.000+0200}, title = {Adaptive ontology re-use: finding and re-using sub-ontologies}, url = {http://dx.doi.org/10.1108/17440080810882379}, volume = 4, year = 2008 } @inproceedings{krause2008logsonomy, 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.}, added-at = {2008-06-20T14:42:46.000+0200}, address = {New York, NY, USA}, author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/276d81124951ae39060a8bc98f4883435/nepomuk}, booktitle = {HT '08: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia}, doi = {http://doi.acm.org/10.1145/1379092.1379123}, interhash = {6d34ea1823d95b9dbf37d4db4d125d2a}, intrahash = {76d81124951ae39060a8bc98f4883435}, isbn = {978-1-59593-985-2}, keywords = {analysis engine from:jaeschke information l3s logsonomy network retrieval search social wp5}, location = {Pittsburgh, PA, USA}, pages = {157--166}, publisher = {ACM}, timestamp = {2008-06-20T14:42:46.000+0200}, title = {Logsonomy - Social Information Retrieval with Logdata}, url = {http://portal.acm.org/citation.cfm?id=1379092.1379123&coll=ACM&dl=ACM&type=series&idx=SERIES399&part=series&WantType=Journals&title=Proceedings%20of%20the%20nineteenth%20ACM%20conference%20on%20Hypertext%20and%20hypermedia}, year = 2008 } @inproceedings{Jaeschke2008logsonomy, 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.}, added-at = {2008-06-20T14:39:26.000+0200}, author = {Jäschke, Robert and Krause, Beate and Hotho, Andreas and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/2359e1eccdc524334d4a2ad51330f76ae/nepomuk}, booktitle = {Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)}, interhash = {13ec3f45fc7e0364cdc6b9a7c12c5c2c}, intrahash = {359e1eccdc524334d4a2ad51330f76ae}, keywords = {2008 engine folksonomy from:jaeschke l3s logsonomy myown search wp5}, publisher = {AAAI Press}, timestamp = {2008-06-20T14:39:26.000+0200}, title = {Logsonomy — A Search Engine Folksonomy}, url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2008/Krause2008logsonomy_short.pdf}, year = 2008 } @article{jaeschke2008discovering, abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.}, added-at = {2008-04-15T11:58:42.000+0200}, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd}, biburl = {http://www.bibsonomy.org/bibtex/263901930c137df0c2dad84075c564b14/nepomuk}, booktitle = {Semantic Web and Web 2.0}, description = {ScienceDirect - Web Semantics: Science, Services and Agents on the World Wide Web : Discovering shared conceptualizations in folksonomies}, interhash = {cfca594f9dbe30694bfbcdeb40dc4e88}, intrahash = {63901930c137df0c2dad84075c564b14}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, keywords = {2008 analysis concept folksonomy formal from:jaeschke l3s myown tagging wp5}, month = feb, number = 1, pages = {38--53}, timestamp = {2008-04-15T11:58:42.000+0200}, title = {Discovering Shared Conceptualizations in Folksonomies}, url = {http://www.sciencedirect.com/science/article/B758F-4R53WD4-1/2/ae56bd6e7132074272ca2035be13781b}, volume = 6, year = 2008 } @techreport{Minack+2008, abstract = {With the growth of the Semantic Web, the requirements on storing and querying RDF has become more sophisticated. When a larger amount of data has to be managed, queries in structured query languages, such as SPARQL, are not always powerful enough. Use of additional keywords for querying can further reduce the result set towards the actual relevant answers, however, SPARQL only provides complete string matching or filtering based on regular expressions, which is a very slow operation. In contrast, state of the art Information Retrieval (IR) techniques provide sophisticated features such as keyword search, lemmatisation, stemming and ranking. In this paper we present a combination of structured RDF queries and full-text search. It is implemented as an extension of an established RDF store (Sesame) with IR capabilities using the text search library Lucene, without requiring modifications to existing RDF query languages. }, added-at = {2008-02-14T13:50:10.000+0100}, author = {Minack, Enrico and Sauermann, Leo and Grimnes, Gunnar and Fluit, Christiaan and Broekstra, Jeen}, biburl = {http://www.bibsonomy.org/bibtex/2a87a7c940a5236a9bba3e9e258660690/nepomuk}, institution = {NEPOMUK Consortium}, interhash = {a7fa25ef725ca2019f66334ec5ded94b}, intrahash = {a87a7c940a5236a9bba3e9e258660690}, keywords = {02 2008 aduna dfki from:leobard imported l3s lang:en nepomuk wp2}, month = {February}, number = {2008-1}, owner = {sauermann}, pdf = {Minack+2008.pdf}, timestamp = {2008-02-14T13:50:10.000+0100}, title = {The Sesame Lucene Sail: RDF Queries with Full-text Search}, type = {Technical Report}, url = {http://nepomuk.semanticdesktop.org/xwiki/bin/download/Main1/Publications/Minack%202008.pdf}, year = 2008 }