Formal Concept Analysis

1. Front Matter

   PDF

2. Invited Talks

   1. About the Enumeration Algorithms of Closed Sets

      • Alain Gély, Raoul Medina, Lhouari Nourine

      Pages 1-16

   2. Mathematics Presenting, Reflecting, Judging

      • Rudolf Wille

      Pages 17-33

   3. The Role of Concept, Context, and Component for Dependable Software Development

      • Vasu Alagar, Mubarak Mohammad, Kaiyu Wan

      Pages 34-50

   4. Statistical Methods for Data Mining and Knowledge Discovery

      • Jean Vaillancourt

      Pages 51-60

3. Regular Contributions

   1. Formal Concept Analysis of Two-Dimensional Convex Continuum Structures

      • Rudolf Wille

      Pages 61-71

   2. Counting of Moore Families for n=7

      • Pierre Colomb, Alexis Irlande, Olivier Raynaud

      Pages 72-87

   3. Lattice Drawings and Morphisms

      • Vincent Duquenne

      Pages 88-103

   4. Approximations in Concept Lattices

      • Christian Meschke

      Pages 104-123

   5. Hardness of Enumerating Pseudo-intents in the Lectic Order

      • Felix Distel

      Pages 124-137

   6. On Links between Concept Lattices and Related Complexity Problems

      • Mikhail A. Babin, Sergei O. Kuznetsov

      Pages 138-144

   7. An Algorithm for Extracting Rare Concepts with Concise Intents

      • Yoshiaki Okubo, Makoto Haraguchi

      Pages 145-160

   8. Conditional Functional Dependencies: An FCA Point of View

      • Raoul Medina, Lhouari Nourine

      Pages 161-176

   9. Constrained Closed Datacubes

      • Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal

      Pages 177-192

   10. Conceptual Navigation in RDF Graphs with SPARQL-Like Queries

       • Sébastien Ferré

       Pages 193-208

   11. An Approach to Exploring Description Logic Knowledge Bases

       • Felix Distel

       Pages 209-224

   12. On Categorial Grammars as Logical Information Systems

       • Annie Foret, Sébastien Ferré

       Pages 225-240

   13. Describing Role Models in Terms of Formal Concept Analysis

       • Henri Mühle, Christian Wende

       Pages 241-254

   14. Approaches to the Selection of Relevant Concepts in the Case of Noisy Data

       • Mikhail Klimushkin, Sergei Obiedkov, Camille Roth

       Pages 255-266

   15. Concept Analysis as a Framework for Mining Functional Features from Legacy Code

       • Amal El Kharraz, Petko Valtchev, Hafedh Mili

       Pages 267-282

This volume contains selected papers presented at ICFCA 2010, the 8th Int- national Conference on Formal Concept Analysis. The ICFCA conference series aims to be the prime forum for dissemination of advances in applied lattice and order theory, and in particular advances in theory and applications of Formal Concept Analysis. Formal Concept Analysis (FCA) is a ?eld of applied mathematics with its mathematical root in order theory, in particular the theory of complete lattices. Researchershadlongbeenawareofthefactthatthese?eldshavemanypotential applications.FCAemergedinthe1980sfrome?ortstorestructurelattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathematical formalization of c- cept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical community and an - creasingnumberofapplicationsindataandknowledgeprocessingincludingdatavisualization, information retrieval, machine learning, sofware engineering, data analysis, data mining in Web 2.0, analysis of social networks, concept graphs, contextual logic and description logics. ICFCA 2010 took place during March 15–18, 2010 in Agadir, Morocco. We received 37 high-quality submissions out of which 17 were chosen as regular papers in these proceedings after a competitive selection process. Less mature works that were still considered valuable for discussion at the conference were collected in the supplementary proceedings. The papers in the present volume coveradvancesinvariousaspectsofFCArangingfromitstheoreticalfoundations to its applications in numerous other ?elds. In addition to the regular papers, thisvolumealsocontainsfourkeynotepapersarisingfromtheseveninvitedtalks given at the conference. We are also delighted to include a reprint of Bernhard Ganter’sseminalpaper on hiswell-knownalgorithmfor enumerating closedsets.

• Information Retrieval
• algorithms
• calculus
• complexity
• data analysis
• data mining
• databases
• knowledge management
• logic
• machine learning
• order theory

• School of Engineering, Zurich University of Applied Sciences, Winterthur, Switzerland

  Léonard Kwuida

• SAP Research Center, Dresden, Germany

  Barış Sertkaya

Policies and ethics