|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-36681-9 |
003 |
DE-He213 |
005 |
20220119085934.0 |
007 |
cr nn 008mamaa |
008 |
130228s2013 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642366819
|9 978-3-642-36681-9
|
024 |
7 |
|
|a 10.1007/978-3-642-36681-9
|2 doi
|
050 |
|
4 |
|a Q342
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a TEC009000
|2 bisacsh
|
072 |
|
7 |
|a UYQ
|2 thema
|
082 |
0 |
4 |
|a 006.3
|2 23
|
100 |
1 |
|
|a Garriga, Gemma C.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Formal Methods for Mining Structured Objects
|h [electronic resource] /
|c by Gemma C Garriga.
|
250 |
|
|
|a 1st ed. 2013.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2013.
|
300 |
|
|
|a X, 109 p. 50 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
|
490 |
1 |
|
|a Studies in Computational Intelligence,
|x 1860-9503 ;
|v 475
|
505 |
0 |
|
|a Introduction -- Preliminaries -- Horn Axiomatizations for Sequences -- Transformations on Injective Partial Orders -- Transformations on General Partial Orders -- Towards Other Structured Data.
|
520 |
|
|
|a In the field of knowledge discovery, graphs of concepts are an expressive and versatile modeling technique providing ways to reason about information implicit in a set of data. Interesting examples of this can be found under the mathematical theory of formal concept analysis, dedicated to the construction of a lattice of concepts by defining a Galois connection on a binary relationship. This book present such graph of concepts under the more complex case of data that comes in a set of structured objects; e.g. a set of sequences, trees or graphs. Nodes of this graph will represent patterns in the data and edges will correspond to relationships of specificity. From this combinatorial object results are derived such as a full characterization of logical implications and closed partial orders. The results presented in this book are coupled with examples and empirical experiments that illustrate the derived theoretical contributions.
|
650 |
|
0 |
|a Computational intelligence.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Computational Intelligence.
|
650 |
2 |
4 |
|a Artificial Intelligence.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642430633
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642366826
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642366802
|
830 |
|
0 |
|a Studies in Computational Intelligence,
|x 1860-9503 ;
|v 475
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-36681-9
|z Texto Completo
|
912 |
|
|
|a ZDB-2-ENG
|
912 |
|
|
|a ZDB-2-SXE
|
950 |
|
|
|a Engineering (SpringerNature-11647)
|
950 |
|
|
|a Engineering (R0) (SpringerNature-43712)
|