Formal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptualhierarchyleadingtomethodsforconceptuallyanalyzingdataandkno- edge. The theoryitselfstronglyreliesonorderandlatticetheory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning, and, over the last years, the range of applicationshaskeptgrowing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data. Then, they realized that this data, just rough information for them, might become a real treasure if turned into knowledge. FCA is particularly well suited for this purpose. From relational data, FCA can extract implications, - pendencies, concepts and hierarchies of concepts, and thus capture part of the knowledge hidden in the data. The ICFCA conference series gathers researchers from all over the world, being the main forum to present new results in FCA and related ?elds. These results range from theoretical novelties to advances in FCA-related algorithmic issues, as well as application domains of FCA. ICFCA 2008 was in the same vein as its predecessors: high-quality papers and presentations, the place of real debate and exchange of ideas. ICFCA 2008 contributed to strengthening the links between theory and applications. The high quality of the presentations was the result of the remarkable work of the authors and the reviewers. We wish to thank the reviewers for all their valuable comments, which helped the authors to improve their presentations.
Author(s): Rudolf Wille (auth.), Raoul Medina, Sergei Obiedkov (eds.)
Series: Lecture Notes in Computer Science 4933 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Language: English
Pages: 328
Tags: Artificial Intelligence (incl. Robotics); Discrete Mathematics in Computer Science; Mathematical Logic and Formal Languages; Software Engineering; Data Mining and Knowledge Discovery; Order, Lattices, Ordered Algebraic Structures
Front Matter....Pages -
Communicative Rationality, Logic, and Mathematics....Pages 1-13
Actionability and Formal Concepts: A Data Mining Perspective....Pages 14-31
Acquiring Generalized Domain-Range Restrictions....Pages 32-45
A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model....Pages 46-61
Lexico-Logical Acquisition of OWL DL Axioms....Pages 62-77
From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit....Pages 78-89
A Formal Context for Symmetric Dependencies....Pages 90-105
The Number of Plane Diagrams of a Lattice....Pages 106-123
Spectral Lattices of $\mathbb{\overline R}_{\rm max,+}$ -Formal Contexts....Pages 124-139
About Keys of Formal Context and Conformal Hypergraph....Pages 140-149
An Algebraization of Linear Continuum Structures....Pages 150-157
On the Complexity of Computing Generators of Closed Sets....Pages 158-168
Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions....Pages 169-181
On the Merge of Factor Canonical Bases....Pages 182-198
Lattices of Rough Set Abstractions as P -Products....Pages 199-216
Scale Coarsening as Feature Selection....Pages 217-228
Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer....Pages 229-240
Handling Spatial Relations in Logical Concept Analysis to Explore Geographical Data....Pages 241-257
Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices....Pages 258-272
Formal Concept Analysis Enhances Fault Localization in Software....Pages 273-288
Refactorings of Design Defects Using Relational Concept Analysis....Pages 289-304
Contingency Structures and Concept Analysis....Pages 305-320
Comparison of Dual Orderings in Time II....Pages 321-324
Back Matter....Pages -
