Doerfel, S.; Jäschke, R. & Stumme, G. (2012), Publication Analysis of the Formal Concept Analysis Community, in F. Domenach; D.I. Ignatov & J. Poelmans, ed., 'ICFCA 2012' , Springer, Berlin/Heidelberg , pp. 77--95 .
[BibTeX] [Endnote]

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.

Jäschke, R.; Hotho, A.; Schmitz, C.; Ganter, B. & Stumme, G. (2008), 'Discovering Shared Conceptualizations in Folksonomies', Journal of Web Semantics 6 (1) , 38-53 .
[BibTeX] [Endnote]

2007

Cattuto, C.; Schmitz, C.; Baldassarri, A.; Servedio, V. D. P.; Loreto, V.; Hotho, A.; Grahl, M. & Stumme, G. (2007), 'Network Properties of Folksonomies', AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering'' 20 (4) , 245-262 .
[BibTeX] [Endnote]

Schmitz, C.; Grahl, M.; Hotho, A.; Stumme, G.; Catutto, C.; Baldassarri, A.; Loreto, V. & Servedio, V. D. P. (2007), Network Properties of Folksonomies, in 'Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''' .
[BibTeX] [Endnote]

2006

Hotho, A.; Jäschke, R.; Schmitz, C. & Stumme, G. (2006), Information Retrieval in Folksonomies: Search and Ranking, in York Sure & John Domingue, ed., 'The Semantic Web: Research and Applications' , Springer, Heidelberg , pp. 411-426 .
[BibTeX] [Endnote]

Jäschke, R.; Hotho, A.; Schmitz, C.; Ganter, B. & Stumme, G. (2006), TRIAS - An Algorithm for Mining Iceberg Tri-Lattices, in 'Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)' , IEEE Computer Society, Hong Kong , pp. 907-911 .
[BibTeX] [Endnote]

Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G. (2006), Mining Association Rules in Folksonomies, in V. Batagelj; H.-H. Bock; A. Ferligoj & A. vZiberna, ed., 'Data Science and Classification: Proc. of the 10th IFCS Conf.' , Springer, Berlin, Heidelberg , pp. 261--270 .
[BibTeX] [Endnote]

2005

Ganter, B.; Stumme, G. & Wille, R., ed. (2005), Formal Concept Analysis -- Foundations and Applications , Vol. 3626 , Springer , Heidelberg .
[BibTeX] [Endnote]

Lakhal, L. & Stumme, G. (2005), Efficient Mining of Association Rules Based on Formal Concept Analysis , Springer , Heidelberg , pp. 180-195 .
[BibTeX] [Endnote]

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.

Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L. (2005), 'Generating a Condensed Representation for Association Rules', Journal Intelligent Information Systems (JIIS) 24 (1) , 29-60 .
[BibTeX] [Endnote]

Stumme, G. (2005), A Finite State Model for On-Line Analytical Processing in
Triadic Contexts, in Bernhard Ganter & Robert Godin, ed., 'Proc. 3rd Intl. Conf. on Formal Concept Analysis' , Springer, Heidelberg , pp. 315-328 .
[BibTeX] [Endnote]

Stumme, G. (2005), A Finite State Model for On-Line Analytical Processing in Triadic
Contexts., in Bernhard Ganter & Robert Godin, ed., 'Proc. 3rd Intl. Conf. on Formal Concept Analysis' , Springer, , pp. 315-328 .
[BibTeX] [Endnote]

Stumme, G. (2005), Conceptual Knowledge Processing (Invited Talk), in Martine Collard & Jean-Louis Cavarero, ed., 'Ontologies-based techniques for DataBases and Information Systems' , pp. 5 .
[BibTeX] [Endnote]

2004

Cimiano, P.; Hotho, A.; Stumme, G. & Tane, J. (2004), Conceptual Knowledge Processing with Formal Concept
Analysis and Ontologies, in Peter Eklund, ed., 'Concept Lattices' , Springer, Berlin/Heidelberg , pp. 189--207 .
[BibTeX] [Endnote]

Cimiano, P.; Hotho, A.; Stumme, G. & Tane, J. (2004), Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies, in Peter Eklund, ed., 'Concept Lattices' , Springer, Heidelberg , pp. 189-207 .
[BibTeX] [Endnote]

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.

Stumme, G. (2004), Iceberg Query Lattices for Datalog, in Karl Erich Wolff; Heather D. Pfeiffer & Harry S. Delugach, ed., 'Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)' , Springer, Heidelberg , pp. 109-125 .
[BibTeX] [Endnote]

Tane, J.; Schmitz, C. & Stumme, G. (2004), Semantic resource management for the web: an e-learning application, in 'Proc. 13th International World Wide Web Conference (WWW 2004)' , pp. 1-10 .
[BibTeX] [Endnote]

2002

Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L. (2002), 'Computing iceberg concept lattices with TITANIC', Data & Knowledge Engineering 42 (2) , 189--222 .
[BibTeX] [Endnote]

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.