|
|
|
|
| LEADER |
03461nam a22006015i 4500 |
| 001 |
978-3-540-32204-7 |
| 003 |
DE-He213 |
| 005 |
20151123194721.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100419s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540322047
|9 978-3-540-32204-7
|
| 024 |
7 |
|
|a 10.1007/11671404
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a Q334-342
|
| 050 |
|
4 |
|a TJ210.2-211.495
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a TJFM1
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 006.3
|2 23
|
| 245 |
1 |
0 |
|a Formal Concept Analysis
|h [electronic resource] :
|b 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006. Proceedings /
|c edited by Rokia Missaoui, Jürg Schmidt.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
| 300 |
|
|
|a X, 314 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3874
|
| 505 |
0 |
|
|a 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 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Information storage and retrieval.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Algebra.
|
| 650 |
|
0 |
|a Ordered algebraic structures.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Information Storage and Retrieval.
|
| 650 |
2 |
4 |
|a Order, Lattices, Ordered Algebraic Structures.
|
| 700 |
1 |
|
|a Missaoui, Rokia.
|e editor.
|
| 700 |
1 |
|
|a Schmidt, Jürg.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540322030
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3874
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11671404
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
