Central Library

Normal view MARC view ISBD view

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

Contributor(s): Kuznetsov, Sergei O [editor.] | Schmidt, Stefan [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Artificial Intelligence: 4390Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: X, 329 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540709015.Subject(s): Artificial intelligence | Computer science -- Mathematics | Discrete mathematics | Machine theory | Software engineering | Data mining | Algebra | Artificial Intelligence | Discrete Mathematics in Computer Science | Formal Languages and Automata Theory | Software Engineering | Data Mining and Knowledge Discovery | Order, Lattices, Ordered Algebraic StructuresAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.