TY - CONF AU - Doerfel, Stephan AU - Jäschke, Robert AU - Stumme, Gerd A2 - Domenach, F. A2 - Ignatov, D.I. A2 - Poelmans, J. T1 - Publication Analysis of the Formal Concept Analysis Community T2 - ICFCA 2012 PB - Springer CY - Berlin/Heidelberg PY - 2012/ M2 - VL - 7278 IS - SP - 77 EP - 95 UR - https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2012publication.pdf M3 - KW - 2012 KW - analysis KW - community KW - concept KW - fca KW - home KW - info20pub KW - itegpub KW - l3s KW - myown KW - scientometrics L1 - SN - N1 - N1 - AB - 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.

ER - TY - JOUR AU - Jäschke, Robert AU - Hotho, Andreas AU - Schmitz, Christoph AU - Ganter, Bernhard AU - Stumme, Gerd T1 - Discovering Shared Conceptualizations in Folksonomies JO - Journal of Web Semantics PY - 2008/ VL - 6 IS - 1 SP - 38 EP - 53 UR - http://dx.doi.org/10.1016/j.websem.2007.11.004 M3 - KW - 2008 KW - FCA KW - OntologyHandbook KW - analysis KW - bibsonomy KW - concept KW - discovering KW - fca KW - folksonomies KW - formal KW - itegpub KW - l3s KW - myown KW - shared KW - triadic L1 - SN - N1 - N1 - AB - ER - TY - CHAP AU - Cimiano, Philipp AU - Hotho, Andreas AU - Stumme, Gerd AU - Tane, Julien A2 - Eklund, Peter T1 - Conceptual Knowledge Processing with Formal Concept

Analysis and Ontologies T2 - Concept Lattices PB - Springer CY - Berlin/Heidelberg PY - 2004/ VL - 2961 IS - SP - 189 EP - 207 UR - http://dx.doi.org/10.1007/978-3-540-24651-0_18 M3 - KW - 2004 KW - citedBy:doerfel2012publication KW - fca KW - icfca KW - itegpub KW - knowledge KW - l3s KW - myown KW - processing L1 - SN - 978-3-540-21043-6 N1 - N1 - AB - ER - TY - CONF AU - Stumme, Gerd A2 - Wolff, Karl Erich A2 - Pfeiffer, Heather D. A2 - Delugach, Harry S. T1 - Iceberg Query Lattices for Datalog T2 - Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004) PB - Springer CY - Heidelberg PY - 2004/ M2 - VL - 3127 IS - SP - 109 EP - 125 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf M3 - KW - 2004 KW - analysis KW - concept KW - context KW - datalog KW - families KW - family KW - fca KW - formal KW - iceberg KW - itegpub KW - l3s KW - lattices KW - myown KW - pcf KW - power KW - queries KW - query L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - JOUR AU - Stumme, Gerd AU - Taouil, Rafik AU - Bastide, Yves AU - Pasquier, Nicolas AU - Lakhal, Lotfi T1 - Computing iceberg concept lattices with TITANIC JO - Data & Knowledge Engineering PY - 2002/ VL - 42 IS - 2 SP - 189 EP - 222 UR - http://portal.acm.org/citation.cfm?id=606457 M3 - 10.1016/S0169-023X(02)00057-5 KW - citedBy:doerfel2012publication KW - fca KW - icfca KW - itegpub KW - l3s KW - myown KW - titanic L1 - SN - N1 - N1 - AB - 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. ER -