|
|
|
|
| LEADER |
02838nmm a2200409 u 4500 |
| 001 |
EB000378258 |
| 003 |
EBX01000000000000000231310 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540709015
|
| 100 |
1 |
|
|a Kuznetsov, Sergei O.
|e [editor]
|
| 245 |
0 |
0 |
|a Formal Concept Analysis
|h Elektronische Ressource
|b 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings
|c edited by Sergei O. Kuznetsov, Stefan Schmidt
|
| 250 |
|
|
|a 1st ed. 2007
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2007, 2007
|
| 300 |
|
|
|a X, 329 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Data mining
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Algebra
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Order, Lattices, Ordered Algebraic Structures
|
| 653 |
|
|
|a Data Mining and Knowledge Discovery
|
| 653 |
|
|
|a Discrete mathematics
|
| 700 |
1 |
|
|a Schmidt, Stefan
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
| 028 |
5 |
0 |
|a 10.1007/978-3-540-70901-5
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-70901-5?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 006.3
|