Publications
Publication Analysis of the Formal Concept Analysis Community
Doerfel, S.; Jäschke, R. & Stumme, G.
Domenach, F.; Ignatov, D. & Poelmans, J., ed., 'ICFCA 2012', 7278(), Lecture Notes in Artificial Intelligence, Springer, Berlin/Heidelberg, 77-95 (2012) [pdf]
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
Jäschke, R.; Hotho, A.; Schmitz, C.; Ganter, B. & Stumme, G.
Journal of Web Semantics, 6(1) 38-53 (2008) [pdf]
Conceptual Knowledge Processing with Formal Concept
Analysis and Ontologies
Cimiano, P.; Hotho, A.; Stumme, G. & Tane, J.
Eklund, P., ed., 'Concept Lattices', 2961(), Springer, Berlin/Heidelberg, 189-207 (2004) [pdf]
Iceberg Query Lattices for Datalog
Stumme, G.
Wolff, K. E.; Pfeiffer, H. D. & Delugach, H. S., ed., 'Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)', 3127(), LNCS, Springer, Heidelberg, 109-125 (2004) [pdf]
Computing iceberg concept lattices with TITANIC
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.
Data & Knowledge Engineering, 42(2) 189-222 (2002) [pdf]
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.