LEADER 03660oam 2200685 450 001 9910767528903321 005 20210513110235.0 010 $a1-280-90217-5 010 $a9786610902170 010 $a3-540-70901-0 024 7 $a10.1007/978-3-540-70901-5 035 $a(CKB)1000000000284097 035 $a(SSID)ssj0000296710 035 $a(PQKBManifestationID)11267042 035 $a(PQKBTitleCode)TC0000296710 035 $a(PQKBWorkID)10327212 035 $a(PQKB)11078670 035 $a(DE-He213)978-3-540-70901-5 035 $a(MiAaPQ)EBC3036654 035 $a(MiAaPQ)EBC6408055 035 $a(PPN)123160154 035 $a(EXLCZ)991000000000284097 100 $a20210513d2007 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aFormal concept analysis $e5th international conference, icfca 2007, clermont-ferrand, france, february 12-16, 2007, proceedings /$fedited by Sergei O. Kuznetsov, Stefan Schmidt 205 $a1st ed. 2007. 210 1$aBerlin, Germany ;$aNew York, United States :$cSpringer,$d[2007] 210 4$d©2007 215 $a1 online resource (X, 329 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v4390 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-70828-6 320 $aIncludes bibliographical references and index. 327 $aRelational 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. 410 0$aLecture notes in computer science ;$v4390. 410 0$aLecture notes in computer science.$pLecture notes in artificial intelligence. 517 3 $aICFCA 2007 606 $aArtificial intelligence$xMathematical models$vCongresses 606 $aLattice theory$vCongresses 606 $aComprehension (Theory of knowledge)$vCongresses 606 $aInformation theory$vCongresses 615 0$aArtificial intelligence$xMathematical models 615 0$aLattice theory 615 0$aComprehension (Theory of knowledge) 615 0$aInformation theory 676 $a511.33 702 $aKuznetsov$b Sergei O. 702 $aSchmidt$b Stefan E. 712 12$aInternational Conference on Formal Concept Analysis 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910767528903321 996 $aFormal Concept Analysis$9772457 997 $aUNINA