Formal Concept Analysis

5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings

AvSergei O. Kuznetsov,Stefan Schmidt

Häftad, Engelska, 2007

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2007-01-26
Mått:155 x 235 x 19 mm
Vikt:522 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:329
Upplaga:2007
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540708285

Utforska kategorier

Informationsteknik: allmänt inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av