This book constitutes the refereed proceedings of the Fourth International Conference on Concept Lattices and their Applications, CLA 2006, held in Tunis, Tunisia, October 30-November 1, 2006.
The 18 revised full papers together with 3 invited contributions presented were carefully reviewed and selected from 41 submissions. The topics include formal concept analysis, foundations of FCA, mathematical structures related to FCA, relationship of FCA to other methods of data analysis, visualization of data in FCA, and applications of FCA.
Author(s): Jon Ducrou, Peter Eklund, Tim Wilson (auth.), Sadok Ben Yahia, Engelbert Mephu Nguifo, Radim Belohlavek (eds.)
Series: Lecture Notes in Computer Science 4923
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Language: English
Pages: 283
Tags: Data Mining and Knowledge Discovery; Artificial Intelligence (incl. Robotics); Information Storage and Retrieval; Data Structures; Data Storage Representation
Front Matter....Pages -
An Intelligent User Interface for Browsing and Searching MPEG-7 Images Using Concept Lattices....Pages 1-21
First Elements on Knowledge Discovery Guided by Domain Knowledge (KDDK)....Pages 22-41
Formal Concept Analysis as Applied Lattice Theory....Pages 42-67
Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data....Pages 68-79
Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions....Pages 80-95
Closure Systems of Equivalence Relations and Their Labeled Class Geometries....Pages 96-106
Generalizations of Approximable Concept Lattice....Pages 107-122
Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Means....Pages 123-138
Graded LinClosure and Its Role in Relational Data Analysis....Pages 139-154
Yet Another Approach for Completing Missing Values....Pages 155-169
Efficient Generic Association Rules Based Classifier Approach....Pages 170-185
Galois Lattices and Bases for M GK -Valid Association Rules....Pages 186-197
Generic Association Rule Bases: Are They so Succinct?....Pages 198-213
Concept Lattice Representations of Annotated Taxonomies....Pages 214-225
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy....Pages 226-231
Unique Factorization Theorem and Formal Concept Analysis....Pages 232-239
Towards Concise Representation for Taxonomies of Epistemic Communities....Pages 240-255
Towards an Iterative Classification Based on Concept Lattice....Pages 256-262
Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Network....Pages 263-268
Using FCA to Suggest Refactorings to Correct Design Defects....Pages 269-275
Type Signature Induction with FCAType ....Pages 276-281
Back Matter....Pages -
