@inproceedings{lorince2014supertagger,
  author = {Lorince, Jared and Zorowitz, Sam and Murdock, Jaimie and Todd, Peter},
  interhash = {4af29810e9c882dc18f560527c65de2f},
  intrahash = {014abc7dc30e38859c5e8605dce1a8f6},
  title = {“Supertagger” Behavior in Building Folksonomies},
  year = 2014
}

@techreport{doerfel2014course,
  abstract = {Social tagging systems have established themselves as an important part in
today's web and have attracted the interest from our research community in a
variety of investigations. The overall vision of our community is that simply
through interactions with the system, i.e., through tagging and sharing of
resources, users would contribute to building useful semantic structures as
well as resource indexes using uncontrolled vocabulary not only due to the
easy-to-use mechanics. Henceforth, a variety of assumptions about social
tagging systems have emerged, yet testing them has been difficult due to the
absence of suitable data. In this work we thoroughly investigate three
available assumptions - e.g., is a tagging system really social? - by examining
live log data gathered from the real-world public social tagging system
BibSonomy. Our empirical results indicate that while some of these assumptions
hold to a certain extent, other assumptions need to be reflected and viewed in
a very critical light. Our observations have implications for the design of
future search and other algorithms to better reflect the actual user behavior.},
  author = {Doerfel, Stephan and Zoller, Daniel and Singer, Philipp and Niebler, Thomas and Hotho, Andreas and Strohmaier, Markus},
  interhash = {65f287480af20fc407f7d26677f17b72},
  intrahash = {e360f0bd207806e72305efe16491ebe3},
  note = {cite arxiv:1401.0629},
  title = {Of course we share! Testing Assumptions about Social Tagging Systems},
  url = {http://arxiv.org/abs/1401.0629},
  year = 2014
}

@inproceedings{abrams1998information,
  acmid = {274651},
  address = {New York, NY, USA},
  author = {Abrams, David and Baecker, Ron and Chignell, Mark},
  booktitle = {Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
  doi = {10.1145/274644.274651},
  interhash = {fbb2704604de0954b432c8615a0abf5b},
  intrahash = {a9a25a144cec844bcd7daeace4a548aa},
  isbn = {0-201-30987-4},
  location = {Los Angeles, California, USA},
  numpages = {8},
  pages = {41--48},
  publisher = {ACM Press/Addison-Wesley Publishing Co.},
  series = {CHI '98},
  title = {Information archiving with bookmarks: personal Web space construction and organization},
  url = {http://dx.doi.org/10.1145/274644.274651},
  year = 1998
}

@inproceedings{angelova2008characterizing,
  abstract = {Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect strangers as long as they have common interests. del.icio.us is a social network where people store and share their personal bookmarks. Most importantly, users tag their bookmarks for ease of information dissemination and later look up. However, it is the friendship links, that make delicious a social network. They exist independently of the set of bookmarks that belong to the users and have no relation to the tags typically assigned to the bookmarks. To study the interaction among users, the strength of the existing links and their hidden meaning, we introduce implicit links in the network. These links connect only highly "similar" users. Here, similarity can reflect different aspects of the user’s profile that makes her similar to any other user, such as number of shared bookmarks, or similarity of their tags clouds. We investigate the question whether friends have common interests, we gain additional insights on the strategies that users use to assign tags to their bookmarks, and we demonstrate that the graphs formed by implicit links have unique properties differing from binomial random graphs or random graphs with an expected power-law degree distribution. },
  author = {Angelova, Ralitsa and Lipczak, Marek and Milios, Evangelos and Prałat, Paweł},
  booktitle = {Proceedings of the Mining Social Data Workshop (MSoDa)},
  interhash = {f74d27a66d2754f3d5892d68c4abee4c},
  intrahash = {02d6739886a13180dd92fbb7243ab58b},
  month = jul,
  organization = {ECAI 2008},
  pages = {21--25},
  title = {Characterizing a social bookmarking and tagging network},
  url = {http://www.math.ryerson.ca/~pralat/papers/2008_delicious.pdf},
  year = 2008
}

@inproceedings{Laniado2010,
  author = {Laniado, David and Mika, Peter},
  booktitle = {International Semantic Web Conference (1)},
  crossref = {conf/semweb/2010-1},
  editor = {Patel-Schneider, Peter F. and Pan, Yue and Hitzler, Pascal and Mika, Peter and Zhang, Lei and Pan, Jeff Z. and Horrocks, Ian and Glimm, Birte},
  ee = {http://dx.doi.org/10.1007/978-3-642-17746-0_30},
  interhash = {3a63f88e11f958d548fa91fe442e1dcf},
  intrahash = {58dace4881efbd12c81ef1cc2e6bf7b9},
  isbn = {978-3-642-17745-3},
  pages = {470-485},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Making Sense of Twitter.},
  url = {http://dblp.uni-trier.de/db/conf/semweb/iswc2010-1.html#LaniadoM10},
  volume = 6496,
  year = 2010
}

@inproceedings{jaeschke06trias,
  address = {Hong Kong},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  booktitle = {Proceedings of the 6th IEEE International Conference on Data Mining     (ICDM 06)},
  doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162},
  interhash = {b4964c3bdd2991a80873d7080ef6a73e},
  intrahash = {e387c294129e11f4221514d5fa807e26},
  isbn = {0-7695-2701-9},
  issn = {1550-4786},
  month = {December},
  pages = {907-911},
  publisher = {IEEE Computer Society},
  title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006trias.pdf},
  vgwort = {19},
  year = 2006
}

@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.},
  address = {New York, NY, USA},
  author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd},
  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},
  location = {Pittsburgh, PA, USA},
  pages = {157--166},
  publisher = {ACM},
  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{schmitz2006mining,
  abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. These systems provide currently relatively few structure. We discuss in this paper, how association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics. We demonstrate our approach on a large scale dataset stemming from an online system.},
  address = {Heidelberg},
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  booktitle = {Data Science and Classification. Proceedings of the 10th IFCS Conf.},
  editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and �iberna, A.},
  file = {schmitz2006mining.pdf:schmitz2006mining.pdf:PDF},
  groups = {public},
  interhash = {9f407e0b779aba5b3afca7fb906f579b},
  intrahash = {ed504c16bc4eb561a9446bd98b10dca1},
  lastdatemodified = {2006-12-07},
  lastname = {Schmitz},
  month = {July},
  own = {notown},
  pages = {261--270},
  pdf = {schmitz06-mining.pdf},
  publisher = {Springer},
  read = {notread},
  series = {Studies in Classification, Data Analysis, and Knowledge Organization},
  timestamp = {2007-09-11 13:31:35},
  title = {Mining Association Rules in Folksonomies},
  username = {dbenz},
  year = 2006
}

@inproceedings{cattuto2007vocabulary,
  abstract = { We analyze a large-scale snapshot of del.icio.us and investigate how the number of different tags in the system grows as a function of a suitably defined notion of time. We study the temporal evolution of the global vocabulary size, i.e. the number of distinct tags in the entire system, as well as the evolution of local vocabularies, that is the growth of the number of distinct tags used in the context of a given resource or user. In both cases, we find power-law behaviors with exponents smaller than one. Surprisingly, the observed growth behaviors are remarkably regular throughout the entire history of the system and across very different resources being bookmarked. Similar sub-linear laws of growth have been observed in written text, and this qualitative universality calls for an explanation and points in the direction of non-trivial cognitive processes in the complex interaction patterns characterizing collaborative tagging.},
  author = {Cattuto, Ciro and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio},
  interhash = {7de017393b2d48335e209a9db23e08b6},
  intrahash = {fb163dd424fa1eb40640340f27ee0ea4},
  title = {Vocabulary growth in collaborative tagging systems},
  url = {http://www.citebase.org/abstract?id=oai:arXiv.org:0704.3316},
  year = 2007
}

@inproceedings{schmitz2006mining,
  abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. These systems provide currently relatively few structure. We discuss in this paper, how association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics. We demonstrate our approach on a large scale dataset stemming from an online system.},
  address = {Heidelberg},
  author = {Schmitz, Christoph and Hotho, Andreas and J�schke, Robert and Stumme, Gerd},
  booktitle = {Data Science and Classification. Proceedings of the 10th IFCS Conf.},
  editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and �iberna, A.},
  file = {schmitz2006mining.pdf:schmitz2006mining.pdf:PDF},
  interhash = {9f407e0b779aba5b3afca7fb906f579b},
  intrahash = {91a9a847b72a77e8f7d7db4de52716e5},
  lastdatemodified = {2006-12-07},
  lastname = {Schmitz},
  month = {July},
  own = {notown},
  pages = {261--270},
  pdf = {schmitz06-mining.pdf},
  publisher = {Springer},
  read = {notread},
  series = {Studies in Classification, Data Analysis, and Knowledge Organization},
  title = {Mining Association Rules in Folksonomies},
  year = 2006
}

@inproceedings{jaeschke2007analysis,
  abstract = {BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.},
  address = {Berlin, Heidelberg},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd},
  booktitle = {Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)},
  editor = {Priss, U. and Polovina, S. and Hill, R.},
  file = {jaeschke2007analysis.pdf:jaeschke2007analysis.pdf:PDF},
  groups = {public},
  interhash = {4352d1142afa561460511b22d4ce5103},
  intrahash = {0c2b212b9ea3d822bf4729fd5fe6b6e1},
  isbn = {3-540-73680-8},
  month = {July},
  pages = {283--295},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  timestamp = {2010-11-10 15:35:25},
  title = {Analysis of the Publication Sharing Behaviour in {BibSonomy}},
  username = {dbenz},
  vgwort = {22},
  volume = 4604,
  year = 2007
}

@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.},
  address = {New York},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  booktitle = {Semantic Web and Web 2.0},
  doi = {10.1016/j.websem.2007.11.004},
  editor = {Finin, T. and Mizoguchi, R. and Staab, S.},
  file = {jaeschke2008discovering.pdf:jaeschke2008discovering.pdf:PDF},
  groups = {public},
  interhash = {cfca594f9dbe30694bfbcdeb40dc4e88},
  intrahash = {18e8babe208fae2c0342438617b0ec31},
  issn = {1570-8268},
  journal = {Web Semantics: Science, Services and Agents on the World Wide Web},
  journalpub = {1},
  month = feb,
  number = 1,
  pages = {38--53},
  publisher = {Elsevier},
  timestamp = {2010-11-10 15:35:25},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://www.sciencedirect.com/science/article/B758F-4R53WD4-1/2/ae56bd6e7132074272ca2035be13781b},
  username = {dbenz},
  vgwort = {59},
  volume = 6,
  year = 2008
}

@book{jaeschke2011formal,
  abstract = {One of the most noticeable innovation that emerged with the advent of the Web 2.0 and the focal point of this thesis are collaborative tagging systems. They allow users to annotate arbitrary resources with freely chosen keywords, so called tags. The tags are used for navigation, finding resources, and serendipitous browsing and thus provide an immediate benefit for the user. By now, several systems for tagging photos, web links, publication references, videos, etc. have attracted millions of users which in turn annotated countless resources. Tagging gained so much popularity that it spread into other applications like web browsers, software packet managers, and even file systems. Therefore, the relevance of the methods presented in this thesis goes beyond the Web 2.0. The conceptual structure underlying collaborative tagging systems is called folksonomy. It can be represented as a tripartite hypergraph with user, tag, and resource nodes. Each edge of the graph expresses the fact that a user annotated a resource with a tag. This social network constitutes a lightweight conceptual structure that is not formalized, but rather implicit and thus needs to be extracted with knowledge discovery methods. In this thesis a new data mining task – the mining of all frequent tri-concepts – is presented, together with an efficient algorithm for discovering such 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. Extending the theory of triadic Formal Concept Analysis, we provide a formal definition of the problem, and present an efficient algorithm for its solution. We show the applicability of our approach on three large real-world examples and thereby perform a conceptual clustering of two collaborative tagging systems. Finally, we introduce neighborhoods of triadic concepts as basis for a lightweight visualization of tri-lattices. The social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind, has been developed by our research group. Besides being a useful tool for many scientists, it provides interested researchers a basis for the evaluation and integration of their knowledge discovery methods. This thesis introduces BibSonomy as an exemplary collaborative tagging system and gives an overview of its architecture and some of its features. Furthermore, BibSonomy is used as foundation for evaluating and integrating some of the discussed approaches. Collaborative tagging systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In this thesis we evaluate and compare several recommendation algorithms on large-scale real-world datasets: an adaptation of user-based Collaborative Filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag co-occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag co-occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We demonstrate how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. Furthermore, we show how to integrate recommendation methods into a real tagging system, record and evaluate their performance by describing the tag recommendation framework we developed for BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. We also present an evaluation of the framework which demonstrates its power. The folksonomy graph shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Clicklogs of web search engines 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 folksonomy snapshot and on query logs of two large search engines. We find that all of the three datasets exhibit similar structural properties and thus conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of collaborative tagging users is driven by similar dynamics.  In this thesis we further transfer the folksonomy paradigm to the Social Semantic Desktop – a new model of computer desktop that uses Semantic Web technologies to better link information items. There we apply community support methods to the folksonomy found in the network of social semantic desktops. Thus, we connect knowledge discovery for folksonomies with semantic technologies. Alltogether, the research in this thesis is centered around collaborative tagging systems and their underlying datastructure – folksonomies – and thereby paves the way for the further dissemination of this successful knowledge management paradigm.  },
  address = {Heidelberg, Germany},
  author = {Jäschke, Robert},
  interhash = {dcb2cd1cd72ae45d77c4d8755d199405},
  intrahash = {9db90c2ff04f514ada9f6b50fde46065},
  isbn = {978-3-89838-332-5},
  month = jan,
  publisher = {Akademische Verlagsgesellschaft AKA},
  series = {Dissertationen zur Künstlichen Intelligenz},
  title = {Formal Concept Analysis and Tag Recommendations in Collaborative Tagging Systems},
  url = {http://www.aka-verlag.com/de/detail?ean=978-3-89838-332-5},
  vgwort = {413},
  volume = 332,
  year = 2011
}

@article{cattuto2007network,
  abstract = {Social resource sharing systems like YouTube and del.icio.us have acquired a large number of users within the last few years. They provide rich resources for data analysis, information retrieval, and knowledge discovery applications. A first step towards this end is to gain better insights into content and structure of these systems. In this paper, we will analyse the main network characteristics of two of these systems. We consider their underlying data structures - so-called folksonomies - as tri-partite hypergraphs, and adapt classical network measures like characteristic path length and clustering coefficient to them.  Subsequently, we introduce a network of tag co-occurrence and investigate some of its statistical properties, focusing on correlations in node connectivity and pointing out features that reflect emergent semantics within the folksonomy. We show that simple statistical indicators unambiguously spot non-social behavior such as spam. },
  address = {Amsterdam, The Netherlands},
  author = {Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd},
  interhash = {fc5f2df61d28bc99b7e15029da125588},
  intrahash = {f15cc7613101babb2c3ed1927e35213a},
  issn = {0921-7126},
  journal = {AI Communications},
  month = dec,
  number = 4,
  pages = {245--262},
  publisher = {IOS Press},
  title = {Network Properties of Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/pub/pdf/cattuto2007network.pdf},
  volume = 20,
  year = 2007
}

@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.},
  address = {New York},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  booktitle = {Semantic Web and Web 2.0},
  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},
  month = feb,
  number = 1,
  pages = {38--53},
  publisher = {Elsevier},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2008discovering.pdf},
  vgwort = {59},
  volume = 6,
  year = 2008
}

@article{journals/www/EdaYUU09,
  author = {Eda, Takeharu and Yoshikawa, Masatoshi and Uchiyama, Toshio and Uchiyama, Tadasu},
  ee = {http://dx.doi.org/10.1007/s11280-009-0069-1},
  interhash = {a560796c977bc7582017f662bf88c16d},
  intrahash = {ec3c256e7d1f24cd9d407d3ce7e41d96},
  journal = {World Wide Web},
  number = 4,
  pages = {421-440},
  title = {The Effectiveness of Latent Semantic Analysis for Building Up a Bottom-up Taxonomy from Folksonomy Tags.},
  url = {http://dblp.uni-trier.de/db/journals/www/www12.html#EdaYUU09},
  volume = 12,
  year = 2009
}

@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.},
  address = {New York, NY, USA},
  author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd},
  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},
  location = {Pittsburgh, PA, USA},
  pages = {157--166},
  publisher = {ACM},
  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
}

@article{mislove2007measurement,
  author = {Mislove, A. and Marcon, M. and Gummadi, K.P. and Druschel, P. and Bhattacharjee, B.},
  booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement},
  interhash = {cb29c839ea0b125778ae58934f35082f},
  intrahash = {aa568938d581a2885e7898e4852ee62f},
  organization = {ACM},
  pages = 42,
  title = {{Measurement and analysis of online social networks}},
  url = {http://scholar.google.de/scholar.bib?q=info:HmucgVkM3hQJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0},
  year = 2007
}

@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.},
  address = {New York, NY, USA},
  author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd},
  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},
  location = {Pittsburgh, PA, USA},
  pages = {157--166},
  publisher = {ACM},
  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{schmitz2006mining,
  abstract = {Social bookmark tools are rapidly emerging on the Web. In such
systems users are setting up lightweight conceptual structures
called folksonomies. These systems provide currently relatively few
structure. We discuss in this paper, how association rule mining
can be adopted to analyze and structure folksonomies, and how the results can be used
for ontology learning and supporting emergent semantics. We
demonstrate our approach on a large scale dataset stemming from an
online system.},
  address = {Heidelberg},
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  booktitle = {Data Science and Classification. Proceedings of the 10th IFCS Conf.},
  editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and Žiberna, A.},
  interhash = {20650d852ca3b82523fcd8b63e7c12d7},
  intrahash = {11b2a59a568d246d7f36cb68169a464a},
  month = {July},
  pages = {261--270},
  publisher = {Springer},
  series = {Studies in Classification, Data Analysis, and Knowledge Organization},
  title = {Mining Association Rules in Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006mining.pdf},
  year = 2006
}