Publication Analysis of the Formal Concept Analysis Community
Doerfel, S.; Jäschke, R. & Stumme, G.
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.
Mining Association Rules in Folksonomies
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.
Batagelj, V.; Bock, H.-H.; Ferligoj, A. & vZiberna, A., ed., 'Data Science and Classification: Proc. of the 10th IFCS Conf.', Studies in Classification, Data Analysis, and Knowledge Organization, Springer, Berlin, Heidelberg, 261-270 (2006)
Efficient Mining of Association Rules Based on Formal Concept Analysis
Lakhal, L. & Stumme, G.
Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies
Cimiano, P.; Hotho, A.; Stumme, G. & Tane, J.
Among many other knowledge representations formalisms, Ontologies
d Formal Concept Analysis (FCA) aim at modeling 'concepts'. We
scuss how these two formalisms may complement another from an
plication point of view. In particular, we will see how FCA can
used to support Ontology Engineering, and how ontologies can be
ploited in FCA applications. The interplay of FCA and ontologies
studied along the life cycle of an ontology:
i) FCA can support the building of the ontology as a
earning technique.
ii) The established ontology can be analyzed and navigated by
sing techniques of FCA.
iii) Last but not least, the ontology may be used to improve an FCA
pplication.
Computing iceberg concept lattices with TITANIC
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.
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.