Vai al contenuto principale della pagina

Formal concept analysis : 5th international conference, icfca 2007, clermont-ferrand, france, february 12-16, 2007, proceedings / / edited by Sergei O. Kuznetsov, Stefan Schmidt



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Formal concept analysis : 5th international conference, icfca 2007, clermont-ferrand, france, february 12-16, 2007, proceedings / / edited by Sergei O. Kuznetsov, Stefan Schmidt Visualizza cluster
Pubblicazione: Berlin, Germany ; ; New York, United States : , : Springer, , [2007]
©2007
Edizione: 1st ed. 2007.
Descrizione fisica: 1 online resource (X, 329 p.)
Disciplina: 511.33
Soggetto topico: Artificial intelligence - Mathematical models
Lattice theory
Comprehension (Theory of knowledge)
Information theory
Persona (resp. second.): KuznetsovSergei O.
SchmidtStefan E.
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 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.
Altri titoli varianti: ICFCA 2007
Titolo autorizzato: Formal Concept Analysis  Visualizza cluster
ISBN: 1-280-90217-5
9786610902170
3-540-70901-0
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910767528903321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Lecture notes in computer science ; ; 4390. Lecture notes in computer science. . -Lecture notes in artificial intelligence.