Custom cover image
Custom cover image

Formal Concept Analysis : 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007. Proceedings / edited by Sergei O. Kuznetsov, Stefan Schmidt

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 4390Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2007Description: Online-Ressource (X, 329 p. Also available online, digital)ISBN:
  • 9783540709015
Subject(s): Genre/Form: Additional physical formats: 9783540708285 | Buchausg. u.d.T.: Formal concept analysis. Berlin : Springer, 2007. X, 327 S.DDC classification:
  • 511.33
  • 006.3
MSC: MSC: *68-06 | 68T30 | 00B25LOC classification:
  • Q334-342 TJ210.2-211.495
  • QA171.5
DOI: DOI: 10.1007/978-3-540-70901-5Online resources: Summary: 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.PPN: PPN: 1646875869Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT