|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-662-49291-8 |
003 |
DE-He213 |
005 |
20220203140900.0 |
007 |
cr nn 008mamaa |
008 |
160526s2016 gw | s |||| 0|eng d |
020 |
|
|
|a 9783662492918
|9 978-3-662-49291-8
|
024 |
7 |
|
|a 10.1007/978-3-662-49291-8
|2 doi
|
050 |
|
4 |
|a QA76.9.D343
|
072 |
|
7 |
|a UNF
|2 bicssc
|
072 |
|
7 |
|a UYQE
|2 bicssc
|
072 |
|
7 |
|a COM021030
|2 bisacsh
|
072 |
|
7 |
|a UNF
|2 thema
|
072 |
|
7 |
|a UYQE
|2 thema
|
082 |
0 |
4 |
|a 006.312
|2 23
|
100 |
1 |
|
|a Ganter, Bernhard.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Conceptual Exploration
|h [electronic resource] /
|c by Bernhard Ganter, Sergei Obiedkov.
|
250 |
|
|
|a 1st ed. 2016.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2016.
|
300 |
|
|
|a XVII, 315 p. 148 illus.
|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
|
505 |
0 |
|
|a What to expect from this book -- Concept lattices -- An algorithm for closure systems -- The canonical basis -- Attribute exploration -- Non-implicational background knowledge -- Enhancing the expressive power -- Relational Exploration -- Concept exploration. .
|
520 |
|
|
|a This is the first textbook on attribute exploration, its theory, its algorithms for applications, and some of its many possible generalizations. Attribute exploration is useful for acquiring structured knowledge through an interactive process, by asking queries to an expert. Generalizations that handle incomplete, faulty, or imprecise data are discussed, but the focus lies on knowledge extraction from a reliable information source. The method is based on Formal Concept Analysis, a mathematical theory of concepts and concept hierarchies, and uses its expressive diagrams. The presentation is self-contained. It provides an introduction to Formal Concept Analysis with emphasis on its ability to derive algebraic structures from qualitative data, which can be represented in meaningful and precise graphics.
|
650 |
|
0 |
|a Data mining.
|
650 |
|
0 |
|a Algebra.
|
650 |
1 |
4 |
|a Data Mining and Knowledge Discovery.
|
650 |
2 |
4 |
|a Order, Lattices, Ordered Algebraic Structures.
|
700 |
1 |
|
|a Obiedkov, Sergei.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662492901
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662492925
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662569993
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-662-49291-8
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|