Discovering Shared Conceptualizations in Folksonomies.
Web Semantics: Science, Services and Agents on the World Wide Web, 6(1):38-53, 2008.
Robert Jäschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
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.
Analysis of the Publication Sharing Behaviour in BibSonomy.
In: U. Priss, S. Polovina und R. Hill
(Herausgeber):
Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), Band 4604, Reihe Lecture Notes in Artificial Intelligence, Seiten 283-295.
Springer-Verlag, Berlin, Heidelberg, 2007.
Robert Jäschke, Andreas Hotho, Christoph Schmitz und Gerd Stumme.
[Kurzfassung]
[BibTeX]
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.
Emergent Semantics in BibSonomy.
In: C. Hochberger und R. Liskowsky
(Herausgeber):
Informatik 2006 - Informatik für Menschen. Band 2, Band P-94, Reihe Lecture Notes in Informatics.
Gesellschaft für Informatik, Bonn, 2006.
Proc. Workshop on Applications of Semantic Technologies, Informatik 2006
Andreas Hotho, Robert Jäschke, Christoph Schmitz und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
Social bookmark tools are rapidly emerging on the Web. In suchsystems users are setting up lightweight conceptual structurescalled folksonomies. The reason for their immediate success is thefact that no specific skills are needed for participating. In thispaper we specify a formal model for folksonomies, briefly describeour own system BibSonomy, which allows for sharing both bookmarks andpublication references, and discuss first steps towards emergent semantics.
Information Retrieval in Folksonomies: Search and Ranking.
In: Y. Sure und J. Domingue
(Herausgeber):
The Semantic Web: Research and Applications, Band 4011, Reihe Lecture Notes in Computer Science, Seiten 411-426.
Springer, Heidelberg, 2006.
Andreas Hotho, Robert Jäschke, Christoph Schmitz und Gerd Stumme.
[pdf]
[Kurzfassung]
[BibTeX]
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.
TRIAS - An Algorithm for Mining Iceberg Tri-Lattices.
In:
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06), Seiten 907-911.
IEEE Computer Society, Hong Kong, 2006.
Robert Jäschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution as well as experimental results on a large real-world example.