ConferenceProceedingsinproceedingsjaeschke2007analysisAnalysis of the Publication Sharing Behaviour in {BibSonomy}2007JäschkeRobertHothoAndreasSchmitzChristophStummeGerdPrissU.PolovinaS.HillR.283-2954604 ISBN: 3-540-73680-8Springer-VerlagBerlin, HeidelbergProceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)JulyLecture Notes in Artificial IntelligenceBibSonomy 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.2007, analysis, bibsonomy, bookmarking, fca, folksonomy, iccs, l3s, ol_web2.0, social, trias, widely_related, emergentsemantics_evidenceJournalArticlecimiano_hotho_staab_2005Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis2005CimianoP.HothoA.StaabS.305-33924Journal of Artificial Intelligence Research1http://ontology.csse.uwa.edu.au/reference/browse_paper.php?pid=233281549fca, ol_web2.0, ontology_learning, taxonomy_learningConferenceProceedingsinproceedingshotho2006bibsonomy{BibSonomy}: A Social Bookmark and Publication Sharing System2006HothoAndreasJäschkeRobertSchmitzChristophStummeGerdde MoorAldoPolovinaSimonDelugachHarry87-102 ISBN: 87-7307-769-0Aalborg UniversitetsforlagAalborgProceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual StructuresProceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structureshttp://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006bibsonomy.pdfSocial 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 and briefly describe our own system BibSonomy, which allows for sharing both bookmarksand publication references in a kind of personal library.2006, bookmarking, social, nepomuk, bibsonomy, OntologyHandbook, FCA, folksonomy, tagorapub, iccs, l3sConferenceProceedingsinproceedingsjaeschke2006triasTRIAS - An Algorithm for Mining Iceberg Tri-Lattices2006JäschkeRobertHothoAndreasSchmitzChristophGanterBernhardStummeGerd907-911 ISBN: 0-7695-2701-9 ISSN: 1550-4786 DOI: http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162IEEE Computer SocietyHong KongProceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)Decemberhttp://www.kde.cs.uni-kassel.de/jaeschke/paper/jaeschke06trias.pdfIn 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.12, 2006, algorithm, fca, iccs_example, l3s, ol_web2.0, trias, trias_example, methods_conceptsConferenceProceedingsinproceedingscerf2008datapeelerData-Peeler: Constraint-based Closed Pattern Mining in n-ary Relations2008CerfLoïcBessonJérémyRobardetCélineBoulicautJean-Francois37-48Proc. SIAM International Conference on Data Mining SDM'08Proc. SIAM International Conference on Data Mining SDM'08Aprilhttp://www.siam.org/proceedings/datamining/2008/dm08_04_Cerf.pdfSet pattern discovery from binary relations has been extensively studied during the last decade. In particular, many complete and efficient algorithms which extract frequent closed sets are now available. Generalizing such a task to n-ary relations (n ≥ 2) appears as a timely challenge. It may be important for many applications, e.g., when adding the time dimension to the popular objects × features binary case. The generality of the task — no assumption being made on the relation arity or on the size of its attribute domains — makes it computationally challenging. We introduce an algorithm called Data-Peeler. From a n-ary relation, it extracts all closed n-sets satisfying given piecewise (anti)-monotonic constraints. This new class of constraints generalizes both monotonic and anti-monotonic constraints. Considering the special case of ternary relations, Data-Peeler outperforms the state-of-the-art algorithms CubeMiner and Trias by orders of magnitude. These good performances must be granted to a new clever enumeration strategy allowing an efficient closeness checking. An original application on a real-life 4-ary relation is used to assess the relevancy of closed n-sets constraint-based mining.ol_web2.0, triadic, trias, three, mode, fcaJournalArticlecattuto2007networkbNetwork Properties of Folksonomies2007CattutoCiroSchmitzChristophBaldassarriAndreaServedioD. P.VitoLoretoVittorioHothoAndreasGrahlMirandaStummeGerdHocheSusanneNürnbergerAndreasFlachJürgen245-26220 ISSN: 0921-7126IOS PressAI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering''4http://www.kde.cs.uni-kassel.de/stumme/papers/2007/cattuto2007network.pdf2007, semantics, emergent, folksonomy, tagorapub, folksonomies, l3s, network, itegpub, fcaJournalArticlecerf2009closedClosed patterns meet n-ary relations2009CerfLoïcBessonJérémyRobardetCélineBoulicautJean-François1-363 ISSN: 1556-4681 DOI: 10.1145/1497577.1497580ACMNew York, NY, USAACM Transactions on Knowledge Discovery from Data1Set pattern discovery from binary relations has been extensively studied during the last decade. In particular, many complete and efficient algorithms for frequent closed set mining are now available. Generalizing such a task to n-ary relations (n ≥ 2) appears as a timely challenge. It may be important for many applications, for example, when adding the time dimension to the popular objects × features binary case. The generality of the task (no assumption being made on the relation arity or on the size of its attribute domains) makes it computationally challenging. We introduce an algorithm called Data-Peeler. From an n-ary relation, it extracts all closed n-sets satisfying given piecewise (anti) monotonic constraints. This new class of constraints generalizes both monotonic and antimonotonic constraints. Considering the special case of ternary relations, Data-Peeler outperforms the state-of-the-art algorithms CubeMiner and Trias by orders of magnitude. These good performances must be granted to a new clever enumeration strategy allowing to efficiently enforce the closeness property. The relevance of the extracted closed n-sets is assessed on real-life 3-and 4-ary relations. Beyond natural 3-or 4-ary relations, expanding a relation with an additional attribute can help in enforcing rather abstract constraints such as the robustness with respect to binarization. Furthermore, a collection of closed n-sets is shown to be an excellent starting point to compute a tiling of the dataset.ol_web2.0, triadic, trias, three, mode, fca