Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Formal concept analysis : 5th international conference, icfca 2007, clermont-ferrand, france, february 12-16, 2007, proceedings / / edited by Sergei O. Kuznetsov, Stefan Schmidt
| Formal concept analysis : 5th international conference, icfca 2007, clermont-ferrand, france, february 12-16, 2007, proceedings / / edited by Sergei O. Kuznetsov, Stefan Schmidt |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (X, 329 p.) |
| Disciplina | 511.33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence - Mathematical models
Lattice theory Comprehension (Theory of knowledge) Information theory |
| ISBN |
1-280-90217-5
9786610902170 3-540-70901-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Altri titoli varianti | ICFCA 2007 |
| Record Nr. | UNISA-996465840803316 |
| Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal concept analysis : 5th international conference, icfca 2007, clermont-ferrand, france, february 12-16, 2007, proceedings / / edited by Sergei O. Kuznetsov, Stefan Schmidt
| Formal concept analysis : 5th international conference, icfca 2007, clermont-ferrand, france, february 12-16, 2007, proceedings / / edited by Sergei O. Kuznetsov, Stefan Schmidt |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (X, 329 p.) |
| Disciplina | 511.33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence - Mathematical models
Lattice theory Comprehension (Theory of knowledge) Information theory |
| ISBN |
1-280-90217-5
9786610902170 3-540-70901-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Altri titoli varianti | ICFCA 2007 |
| Record Nr. | UNINA-9910767528903321 |
| Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||