Vai al contenuto principale della pagina
| Titolo: |
Formal Concept Analysis : 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings / / edited by Sergei O. Kuznetsov, Stefan Schmidt
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Edizione: | 1st ed. 2007. |
| Descrizione fisica: | 1 online resource (X, 329 p.) |
| Disciplina: | 511.33 |
| Soggetto topico: | Artificial intelligence |
| Computer science - Mathematics | |
| Discrete mathematics | |
| Machine theory | |
| Software engineering | |
| Data mining | |
| Algebra | |
| Artificial Intelligence | |
| Discrete Mathematics in Computer Science | |
| Formal Languages and Automata Theory | |
| Software Engineering | |
| Data Mining and Knowledge Discovery | |
| Order, Lattices, Ordered Algebraic Structures | |
| Persona (resp. second.): | KuznetsovSergei O. |
| SchmidtStefan E. | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| 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. |
| Sommario/riassunto: | This book constitutes the refereed proceedings of the 5th International Conference on Formal Concept Analysis, ICFCA 2007, held in Clermont-Ferrand, France in February 2007. The 19 revised full papers presented together with 1 invited lecture comprise state of the art research from foundational to applied lattice theory and related fields, all of which involve methods and techniques of formal concept analysis. |
| Titolo autorizzato: | Formal Concept Analysis ![]() |
| ISBN: | 1-280-90217-5 |
| 9786610902170 | |
| 3-540-70901-0 | |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910767528903321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |