|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910483079403321 |
|
|
Titolo |
Formal concept analysis : 4th international conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006 : proceedings / / Rokia Missaoui, Jurg Schmid (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, : Springer, c2006 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 314 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science. Lecture notes in artificial intelligence, , 0302-9743 ; ; 3874 |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
MissaouiR |
SchmidJurg <1944-> |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Lattice theory |
Comprehension (Theory of knowledge) - Mathematical models |
Information theory |
Artificial intelligence - Mathematical models |
Logic, Symbolic and mathematical |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Lectures -- Methods of Conceptual Knowledge Processing -- An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms -- Attribute Implications in a Fuzzy Setting -- The Assessment of Knowledge, in Theory and in Practice -- Regular Papers -- The Basic Theorem on Preconcept Lattices -- The Tensor Product as a Lattice of Regular Galois Connections -- Two Instances of Peirce’s Reduction Thesis -- Very Fast Instances for Concept Generation -- Negation, Opposition, and Possibility in Logical Concept Analysis -- A Note on Negation: A PCS-Completion of Semilattices -- Towards a Generalization of Formal Concept Analysis for Data Mining Purposes -- Interactive Association Rules Discovery -- About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base -- Spatial Indexing for Scalability in FCA -- Homograph Disambiguation Using Formal Concept Analysis -- Using Concept Lattices to Uncover Causal Dependencies in Software -- An FCA Interpretation of Relation Algebra -- Spring-Based Lattice |
|
|
|
|