|
|
|
|
LEADER |
04990cam a2200709M 4500 |
001 |
1019740732 |
003 |
OCoLC |
005 |
20180331072603.7 |
006 |
m o d |
007 |
cr |n||||||||| |
008 |
180116s2017 sz ob 000 0 eng d |
019 |
|
|
|a 1019680770
|a 1021188183
|a 1026807735
|
020 |
|
|
|a 9783319728896
|q (electronic bk.)
|
020 |
|
|
|a 331972889X
|q (electronic bk.)
|
020 |
|
|
|z 9783319728889
|
020 |
|
|
|z 3319728881
|
024 |
7 |
|
|a 10.1007/978-3-319-72889-6
|2 doi
|
035 |
|
|
|a (OCoLC)1019740732
|z (OCoLC)1019680770
|z (OCoLC)1021188183
|z (OCoLC)1026807735
|
040 |
|
|
|a YDX
|b eng
|c YDX
|d N$T
|d EBLCP
|d GW5XE
|d N$T
|d AZU
|d OCLCF
|d UAB
|d UPM
|d MERER
|d IOG
|
049 |
|
|
|a COM6
|
050 |
|
4 |
|a QA76.9.D343
|
072 |
|
7 |
|a COM
|x 000000
|2 bisacsh
|
072 |
|
7 |
|a UNF
|2 bicssc
|
072 |
|
7 |
|a UYQE
|2 bicssc
|
082 |
0 |
4 |
|a 006.3/12
|2 23
|
100 |
1 |
|
|a Galbrun, Esther.
|
245 |
1 |
0 |
|a Redescription mining
|h [electronic resource] /
|c Esther Galbrun, Pauli Miettinen.
|
264 |
|
1 |
|a Cham :
|b Springer,
|c [2017]
|
264 |
|
4 |
|c ©2017.
|
300 |
|
|
|a 1 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 SpringerBriefs in computer science.
|
505 |
0 |
|
|a Intro; Preface; Contents; List of Figures; List of Symbols; 1 What Is Redescription Mining; 1.1 First Examples of Redescriptions; 1.2 Formal Definitions; 1.2.1 The Data; 1.2.2 The Descriptions; 1.2.3 The Redescriptions; 1.2.4 Other Constraints; 1.2.5 Distance Functions: Why Jaccard?; 1.2.6 Sets of Redescriptions; 1.3 Related Data Mining Problems; 1.4 A Short History; References; 2 Algorithms for Redescription Mining; 2.1 Finding Queries Using Itemset Mining; 2.1.1 The MID Algorithm; 2.1.2 Mining Redescriptions with the CHARM-L Algorithm; 2.2 Queries Based on Decision Trees and Forests.
|
505 |
8 |
|
|a 2.2.1 The CARTwheels Algorithm2.2.2 The SplitT and LayeredT Algorithms; 2.2.3 The CLUS-RM Algorithm; 2.3 Growing the Queries Greedily; 2.3.1 The ReReMi Algorithm; 2.4 A Comparative Discussion; 2.5 Handling Missing Values; References; 3 Applications, Variants, and Extensions of Redescription Mining; 3.1 Applications of Redescription Mining; 3.1.1 In Biology; 3.1.2 In Ecology; 3.1.3 In Social and Political Sciences and in Economics; 3.1.4 In Engineering; 3.2 Relational Redescription Mining; 3.2.1 An Example of Relational Redescriptions; 3.2.2 Formal Definition; 3.3 Storytelling.
|
505 |
8 |
|
|a 3.3.1 Definition and Algorithms3.3.2 Applications; 3.4 Future Work: Richer Query Languages; 3.4.1 Time-Series Redescriptions; 3.4.2 Subgraph Redescriptions; 3.4.3 Multi-Query and Multimodal Redescriptions; References.
|
504 |
|
|
|a Includes bibliographical references.
|
520 |
|
|
|a This book provides a gentle introduction to redescription mining, a versatile data mining tool that is useful to find distinct common characterizations of the same objects and, vice versa, to identify sets of objects that admit multiple shared descriptions. It is intended for readers who are familiar with basic data analysis techniques such as clustering, frequent itemset mining, and classification. Redescription mining is defined in a general way, making it applicable to different types of data. The general framework is made more concrete through many practical examples that show the versatility of redescription mining. The book also introduces the main algorithmic ideas for mining redescriptions, together with applications from various domains. The final part of the book contains variations and extensions of the basic redescription mining problem, and discusses some future directions and open questions.#xE000;
|
650 |
|
0 |
|a Data mining.
|
650 |
|
7 |
|a COMPUTERS / General.
|2 bisacsh.
|
650 |
|
7 |
|a Data mining.
|2 fast.
|
650 |
1 |
0 |
|a Computer science.
|
630 |
0 |
0 |
|a Chapman & Hall/CRC data mining and knowledge discovery series.
|
655 |
|
4 |
|a Electronic books.
|
700 |
1 |
|
|a Miettinen, Pauli.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
776 |
0 |
8 |
|c Original
|z 3319728881
|z 9783319728889
|w (OCoLC)1013171365.
|
830 |
|
0 |
|a SpringerBriefs in computer science.
|
907 |
|
|
|a .b57389111
|b multi
|c -
|d 180308
|e 230207
|
998 |
|
|
|a cue
|a cu
|b 180402
|c m
|d z
|e -
|f eng
|g sz
|h 0
|i 2
|
948 |
|
|
|a MARCIVE Overnight, in 2023.01
|
948 |
|
|
|a MARCIVE Comp, 2019.12
|
948 |
|
|
|a MARCIVE Q2, 2018
|
994 |
|
|
|a 92
|b COM
|
995 |
|
|
|a Loaded with m2btab.ltiac in 2023.01
|
995 |
|
|
|a Loaded with m2btab.ltiac in 2019.12
|
995 |
|
|
|a Loaded with m2btab.ltiac in 2018.08
|
995 |
0 |
0 |
|a OCLC offline update by CMU and loaded with m2btab.elec in 2018.04
|
995 |
0 |
0 |
|a OCLC offline update by CMU and loaded with m2btab.elec in 2018.03
|
989 |
|
|
|d cueme
|e - -
|f - -
|g -
|h 0
|i 0
|j 200
|k 180402
|l $0.00
|m
|n - -
|o -
|p 0
|q 0
|t 0
|x 0
|w SpringerLink
|1 .i118820813
|u http://ezproxy.coloradomesa.edu/login?url=http://link.springer.com/10.1007/978-3-319-72889-6
|3 SpringerLink
|z Click here for access
|