Publication Analysis of the Formal Concept Analysis Community.
In: F. Domenach, D. Ignatov and J. Poelmans, editors,
ICFCA 2012, volume 7278, series Lecture Notes in Artificial Intelligence, pages 77-95.
Springer, Berlin/Heidelberg, 2012.
Stephan Doerfel, Robert Jäschke and Gerd Stumme.
[doi]
[abstract]
[BibTeX]
We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences’ history.
Discovering Shared Conceptualizations in Folksonomies.
Journal of Web Semantics, 6(1):38-53, 2008.
Robert Jäschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter and Gerd Stumme.
[doi]
[BibTeX]
Network Properties of Folksonomies.
AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering'', 20(4):245-262, 2007.
Ciro Cattuto, Christoph Schmitz, Andrea Baldassarri, Vito D. P. Servedio, Vittorio Loreto, Andreas Hotho, Miranda Grahl and Gerd Stumme.
[doi]
[BibTeX]
Network Properties of Folksonomies.
In:
Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''.
Banff, 2007.
Christoph Schmitz, Miranda Grahl, Andreas Hotho, Gerd Stumme, Ciro Catutto, Andrea Baldassarri, Vittorio Loreto and Vito D. P. Servedio.
[doi]
[BibTeX]
Information Retrieval in Folksonomies: Search and Ranking.
In: Y. Sure and J. Domingue, editors,
The Semantic Web: Research and Applications, volume 4011, series LNAI, pages 411-426.
Springer, Heidelberg, 2006.
Andreas Hotho, Robert Jäschke, Christoph Schmitz and Gerd Stumme.
[BibTeX]
TRIAS - An Algorithm for Mining Iceberg Tri-Lattices.
In:
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06), pages 907-911.
IEEE Computer Society, Hong Kong, 2006.
Robert Jäschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter and Gerd Stumme.
[doi]
[BibTeX]
Mining Association Rules in Folksonomies.
In: V. Batagelj, H.-H. Bock, A. Ferligoj and A. vZiberna, editors,
Data Science and Classification: Proc. of the 10th IFCS Conf., series Studies in Classification, Data Analysis, and Knowledge Organization, pages 261-270.
Springer, Berlin, Heidelberg, 2006.
Christoph Schmitz, Andreas Hotho, Robert Jäschke and Gerd Stumme.
[BibTeX]
Formal Concept Analysis - Foundations and Applications.
LNAI. volume 3626.
Springer, Heidelberg, 2005.
B. Ganter, G. Stumme and R. Wille.
[BibTeX]
Efficient Mining of Association Rules Based on Formal Concept Analysis.
2005.
Lotfi Lakhal and Gerd Stumme.
[doi]
[abstract]
[BibTeX]
Association rules are a popular knowledge discovery technique for
warehouse basket analysis. They indicate which items of the
warehouse are frequently bought together. The problem of association
rule mining has first been stated in 1993. Five years later, several
research groups discovered that this problem has a strong connection
to Formal Concept Analysis (FCA). In this survey, we will first
introduce some basic ideas of this connection along a specific
algorithm, and show how FCA helps in reducing the number
of resulting rules without loss of information, before giving a
general overview over the history and state of the art of applying
FCA for association rule mining.
Generating a Condensed Representation for Association Rules.
Journal Intelligent Information Systems (JIIS), 24(1):29-60, 2005.
Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme and Lotfi Lakhal.
[doi]
[BibTeX]
A Finite State Model for On-Line Analytical Processing in
Triadic Contexts.
In: B. Ganter and R. Godin, editors,
Proc. 3rd Intl. Conf. on Formal Concept Analysis, volume 3403, series Lecture Notes in Computer Science, pages 315-328.
Springer, Heidelberg, 2005.
Gerd Stumme.
[doi]
[BibTeX]
A Finite State Model for On-Line Analytical Processing in Triadic
Contexts..
In: B. Ganter and R. Godin, editors,
Proc. 3rd Intl. Conf. on Formal Concept Analysis, volume 3403, series LNCS, pages 315-328.
Springer, 2005.
Gerd Stumme.
[BibTeX]
Conceptual Knowledge Processing (Invited Talk).
In: M. Collard and J.-L. Cavarero, editors,
Ontologies-based techniques for DataBases and Information Systems, pages 5.
Trondheim, 2005.
Gerd Stumme.
[doi]
[BibTeX]
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies.
In:
P. Eklund, editor,
Concept Lattices, pages 189-207.
Springer, Berlin/Heidelberg, 2004.
Philipp Cimiano, Andreas Hotho, Gerd Stumme and Julien Tane.
[doi]
[BibTeX]
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies.
In: P. Eklund, editor,
Concept Lattices, volume 2961, series LNAI, pages 189-207.
Springer, Heidelberg, 2004.
Philipp Cimiano, Andreas Hotho, Gerd Stumme and Julien Tane.
[doi]
[abstract]
[BibTeX]
Among many other knowledge representations formalisms, Ontologies
and Formal Concept Analysis (FCA) aim at modeling 'concepts'. We
discuss how these two formalisms may complement another from an
application point of view. In particular, we will see how FCA can
be used to support Ontology Engineering, and how ontologies can be
exploited in FCA applications. The interplay of FCA and ontologies
is studied along the life cycle of an ontology:
(i) FCA can support the building of the ontology as a
learning technique.
(ii) The established ontology can be analyzed and navigated by
using techniques of FCA.
(iii) Last but not least, the ontology may be used to improve an FCA
application.
Iceberg Query Lattices for Datalog.
In: K. E. Wolff, H. D. Pfeiffer and H. S. Delugach, editors,
Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004), volume 3127, series LNCS, pages 109-125.
Springer, Heidelberg, 2004.
Gerd Stumme.
[doi]
[BibTeX]
Semantic resource management for the web: an e-learning application.
In:
Proc. 13th International World Wide Web Conference (WWW 2004), pages 1-10.
2004.
Julien Tane, Christoph Schmitz and Gerd Stumme.
[doi]
[BibTeX]
Computing iceberg concept lattices with TITANIC.
Data & Knowledge Engineering, 42(2):189-222, 2002.
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier and Lotfi Lakhal.
[doi]
[abstract]
[BibTeX]
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.