000 | 03673nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-540-32204-7 | ||
003 | DE-He213 | ||
005 | 20240423125554.0 | ||
007 | cr nn 008mamaa | ||
008 | 100419s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540322047 _9978-3-540-32204-7 |
||
024 | 7 |
_a10.1007/11671404 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aFormal Concept Analysis _h[electronic resource] : _b4th International Conference, ICFCA 2006, Dresden, Germany, Feburary 13-17, 2006, Proceedings / _cedited by Rokia Missaoui, Jürg Schmid. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aX, 314 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v3874 |
|
505 | 0 | _aInvited 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 Generalisation 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. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aInformation storage and retrieval systems. | |
650 | 0 | _aAlgebra. | |
650 | 1 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aInformation Storage and Retrieval. |
650 | 2 | 4 | _aOrder, Lattices, Ordered Algebraic Structures. |
700 | 1 |
_aMissaoui, Rokia. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSchmid, Jürg. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540322030 |
776 | 0 | 8 |
_iPrinted edition: _z9783540820437 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v3874 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11671404 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c179426 _d179426 |