This book constitutes the refereed proceedings of the 4th International Conference on Formal Concept Analysis, ICFCA 2006, held in Dresden, Germany in February 2006.
The 17 revised full papers presented together with 4 invited papers were carefully reviewed and selected for inclusion in the book.
The papers show advances in applied lattice and order theory and in particular scientific advances related to formal concept analysis and its practical applications: data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management.
Author(s): Rudolf Wille (auth.), Rokia Missaoui, Jürg Schmidt (eds.)
Series: Lecture Notes in Computer Science 3874 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 314
Tags: Artificial Intelligence (incl. Robotics); Discrete Mathematics in Computer Science; Mathematical Logic and Formal Languages; Software Engineering; Information Storage and Retrieval; Order, Lattices, Ordered Algebraic Structures
Front Matter....Pages -
Methods of Conceptual Knowledge Processing....Pages 1-29
An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms....Pages 30-44
Attribute Implications in a Fuzzy Setting....Pages 45-60
The Assessment of Knowledge, in Theory and in Practice....Pages 61-79
The Basic Theorem on Preconcept Lattices....Pages 80-88
The Tensor Product as a Lattice of Regular Galois Connections....Pages 89-104
Two Instances of Peirce’s Reduction Thesis....Pages 105-118
Very Fast Instances for Concept Generation....Pages 119-129
Negation, Opposition, and Possibility in Logical Concept Analysis....Pages 130-145
A Note on Negation: A PCS-Completion of Semilattices....Pages 146-160
Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes....Pages 161-176
Interactive Association Rules Discovery....Pages 177-190
About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base....Pages 191-204
Spatial Indexing for Scalability in FCA....Pages 205-220
Homograph Disambiguation Using Formal Concept Analysis....Pages 221-232
Using Concept Lattices to Uncover Causal Dependencies in Software....Pages 233-247
An FCA Interpretation of Relation Algebra....Pages 248-263
Spring-Based Lattice Drawing Highlighting Conceptual Similarity....Pages 264-279
Characterizing Planar Lattices Using Left-Relations....Pages 280-290
Automated Layout of Small Lattices Using Layer Diagrams....Pages 291-305
Counting Pseudo-intents and #P-completeness....Pages 306-308
Back Matter....Pages -
