| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466152203316 |
|
|
Titolo |
Formal Concept Analysis [[electronic resource] ] : 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006, Proceedings / / edited by Rokia Missaoui, Jürg Schmid |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 314 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 3874 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Artificial intelligence |
Computer science—Mathematics |
Mathematical logic |
Software engineering |
Information storage and retrieval |
Algebra |
Ordered algebraic structures |
Artificial Intelligence |
Discrete Mathematics in Computer Science |
Mathematical Logic and Formal Languages |
Software Engineering |
Information Storage and Retrieval |
Order, Lattices, Ordered Algebraic Structures |
|
|
|
|
|
|
|
|
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 Drawing Highlighting Conceptual Similarity -- Characterizing Planar Lattices Using Left-Relations -- Automated Layout of Small Lattices Using Layer Diagrams -- Counting Pseudo-intents and #P-completeness. |
|
|
|
|
|
| |