Formal Concept Analysis  5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings /  [electronic resource] : 
edited by Sergei O. Kuznetsov, Stefan Schmidt. 
 - 1st ed. 2007. 
 - X, 329 p.  online resource. 
 - Lecture Notes in Artificial Intelligence,  4390  2945-9141 ; .
 - Lecture Notes in Artificial Intelligence,  4390 .
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9783540709015 
<br/><br/><label>Standard No.: </label>10.1007/978-3-540-70901-5  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Artificial intelligence.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Machine theory.<br/>Software engineering.<br/>Data mining.<br/>Algebra.<br/>Artificial Intelligence.<br/>Discrete Mathematics in Computer Science.<br/>Formal Languages and Automata Theory.<br/>Software Engineering.<br/>Data Mining and Knowledge Discovery.<br/>Order, Lattices, Ordered Algebraic Structures.
<br/><br/><label>LC Class. No.: </label>Q334-342 TA347.A78 
<br/><br/><label>Dewey Class. No.: </label>006.3