Sergei O. Kuznetsov / Stefan Schmidt (eds.)

Formal Concept Analysis

5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings
Herausgegeben:Kuznetsov, Sergei O.; Schmidt, Stefan

• Broschiertes Buch

Produktbeschreibung

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 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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 4390
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 12018079, 978-3-540-70828-5
• 2007
• Seitenzahl: 344
• Erscheinungstermin: 26. Januar 2007
• Englisch
• Abmessung: 235mm x 155mm x 19mm
• Gewicht: 485g
• ISBN-13: 9783540708285
• ISBN-10: 3540708286
• Artikelnr.: 22745862

Autorenporträt

Sergei O. Kuznetsov, Higher School of Economics, Moscow, Russia / Stefan Schmidt, Technical University, Dresden, Germany

Inhaltsangabe

Relational Galois Connections.- Semantology as Basis for Conceptual Knowledge Processing.- A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets.- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data.- Computing Intensions of Digital Library Collections.- Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis.- The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.- A Parameterized Algorithm for Exploring Concept Lattices.- About the Lossless Reduction of the Minimal Generator Family of a Context.- Some Notes on Pseudo-closed Sets.- Performances of Galois Sub-hierarchy-building Algorithms.- Galois Connections Between Semimodules and Applications in Data Mining.- On Multi-adjoint Concept Lattices: Definition and Representation Theorem.- Base Points, Non-unit Implications, and Convex Geometries.- Lattices of Relatively Axiomatizable Classes.- A Solution of the Word Problem for Free Double Boolean Algebras.- On the MacNeille Completion of Weakly Dicomplemented Lattices.- Polynomial Embeddings and Representations.- The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices.- Bipartite Ferrers-Graphs and Planar Concept Lattices.