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.

@article{jaeschke2008discovering, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd}, title = {Discovering Shared Conceptualizations in Folksonomies}, editor = {Finin, T. and Mizoguchi, R. and Staab, S.}, booktitle = {Semantic Web and Web 2.0}, journal = {Web Semantics: Science, Services and Agents on the World Wide Web}, publisher = {Elsevier}, address = {New York}, year = {2008}, volume = {6}, number = {1}, pages = {38--53}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2008discovering.pdf}, doi = {10.1016/j.websem.2007.11.004}, issn = {1570-8268}, keywords = {2008, analysis, concept, fca, folksonomy, formal, l3s, myown, ol_tut2010, tagging, top, trias}, 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.} }

%0 = article %A = Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd %B = Semantic Web and Web 2.0 %C = New York %D = 2008 %I = Elsevier %T = Discovering Shared Conceptualizations in Folksonomies %U = http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2008discovering.pdf

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.

@inproceedings{jaeschke2007analysis, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd}, title = {Analysis of the Publication Sharing Behaviour in BibSonomy}, editor = {Priss, U. and Polovina, S. and Hill, R.}, booktitle = {Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)}, series = {Lecture Notes in Artificial Intelligence}, publisher = {Springer-Verlag}, address = {Berlin, Heidelberg}, year = {2007}, volume = {4604}, pages = {283--295}, isbn = {3-540-73680-8}, keywords = {2007, analysis, bibsonomy, bookmarking, fca, folksonomy, iccs, l3s, myown, ol_tut2010, social, trias}, 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.} }

%0 = inproceedings %A = Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd %B = Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007) %C = Berlin, Heidelberg %D = 2007 %I = Springer-Verlag %T = Analysis of the Publication Sharing Behaviour in BibSonomy

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 folk-sonomies. 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.

@inproceedings{jaeschke2006trias, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd}, title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices}, booktitle = {ICDM '06: Proceedings of the Sixth International Conference on Data Mining}, publisher = {IEEE Computer Society}, address = {Washington, DC, USA}, year = {2006}, pages = {907--911}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2006trias.pdf}, doi = {10.1109/ICDM.2006.162}, isbn = {0-7695-2701-9}, keywords = {2006, fca, iceberg, myown, ol_tut2010, triadic, trias}, abstract = {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 folk-sonomies. 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.} }

%0 = inproceedings %A = Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd %B = ICDM '06: Proceedings of the Sixth International Conference on Data Mining %C = Washington, DC, USA %D = 2006 %I = IEEE Computer Society %T = TRIAS - An Algorithm for Mining Iceberg Tri-Lattices %U = http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2006trias.pdf

@inproceedings{jaeschke2006trias, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd}, title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices}, booktitle = {Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)}, publisher = {IEEE Computer Society}, address = {Hong Kong}, year = {2006}, pages = {907-911}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2006trias.pdf}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162}, isbn = {0-7695-2701-9}, keywords = {12, 2006, algorithm, fca, iccs_example, l3s, myown, ol_tut2010, trias, trias_example} }

%0 = inproceedings %A = Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd %B = Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06) %C = Hong Kong %D = 2006 %I = IEEE Computer Society %T = TRIAS - An Algorithm for Mining Iceberg Tri-Lattices %U = http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2006trias.pdf