Formal Concept Analysis: 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings / Edition 1

Formal Concept Analysis: 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings / Edition 1

by Sergei O. Kuznetsov, Stefan Schmidt
     
 

ISBN-10: 3540708286

ISBN-13: 9783540708285

Pub. Date: 03/12/2007

Publisher: Springer Berlin Heidelberg

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

Overview

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.

Product Details

ISBN-13:
9783540708285
Publisher:
Springer Berlin Heidelberg
Publication date:
03/12/2007
Series:
Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence Series , #4390
Edition description:
2007
Pages:
329
Product dimensions:
0.72(w) x 6.14(h) x 9.21(d)

Table of Contents

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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >