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.
Material type: TextSeries: Lecture Notes in Computer Science ; 4390Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: X, 329 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540709015Subject(s): Computer science | Software engineering | Computational complexity | Data mining | Artificial intelligence | Algebra | Computer Science | Artificial Intelligence (incl. Robotics) | Discrete Mathematics in Computer Science | Mathematical Logic and Formal Languages | Software Engineering | Data Mining and Knowledge Discovery | Order, Lattices, Ordered Algebraic StructuresAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK7481 |
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 on this title.