This book constitutes the refereed proceedings of the 5th International Conference on Formal Concept Analysis, ICFCA 2007, held in Clermont-Ferrand, France in February 2007.
The 19 revised full papers presented together with 1 invited lecture were carefully reviewed and selected for inclusion in the book. The papers comprise state of the art research from foundational to applied lattice theory and related fields, all of which involve methods and techniques of formal concept analysis such as data visualization, information retrieval, machine learning, data analysis and knowledge management.
Author(s): Bernhard Ganter (auth.), Sergei O. Kuznetsov, Stefan Schmidt (eds.)
Series: Lecture Notes in Computer Science 4390
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007
Language: English
Pages: 329
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 -
Relational Galois Connections....Pages 1-17
Semantology as Basis for Conceptual Knowledge Processing....Pages 18-38
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets....Pages 39-50
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data....Pages 51-65
Computing Intensions of Digital Library Collections....Pages 66-81
Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis....Pages 82-97
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees....Pages 98-113
A Parameterized Algorithm for Exploring Concept Lattices....Pages 114-129
About the Lossless Reduction of the Minimal Generator Family of a Context....Pages 130-150
Some Notes on Pseudo-closed Sets....Pages 151-165
Performances of Galois Sub-hierarchy-building Algorithms....Pages 166-180
Galois Connections Between Semimodules and Applications in Data Mining....Pages 181-196
On Multi-adjoint Concept Lattices: Definition and Representation Theorem....Pages 197-209
Base Points, Non-unit Implications, and Convex Geometries....Pages 210-220
Lattices of Relatively Axiomatizable Classes....Pages 221-239
A Solution of the Word Problem for Free Double Boolean Algebras....Pages 240-270
On the MacNeille Completion of Weakly Dicomplemented Lattices....Pages 271-280
Polynomial Embeddings and Representations....Pages 281-302
The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices....Pages 303-312
Bipartite Ferrers-Graphs and Planar Concept Lattices....Pages 313-327
Back Matter....Pages -
