Data mining algorithms in C++: data patterns and algorithms for modern applications
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berkeley, CA
Apress
[2018]
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | xiv, 286 Seiten Illustrationen |
ISBN: | 9781484233146 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV044860663 | ||
003 | DE-604 | ||
005 | 20180605 | ||
007 | t | ||
008 | 180309s2018 a||| |||| 00||| eng d | ||
020 | |a 9781484233146 |c pbk. |9 978-1-4842-3314-6 | ||
035 | |a (OCoLC)1031928061 | ||
035 | |a (DE-599)BVBBV044860663 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-945 |a DE-11 |a DE-739 |a DE-91G |a DE-384 | ||
082 | 0 | |a 005.13 |2 23 | |
084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
084 | |a ST 530 |0 (DE-625)143679: |2 rvk | ||
084 | |a DAT 620f |2 stub | ||
084 | |a DAT 758f |2 stub | ||
100 | 1 | |a Masters, Timothy |e Verfasser |0 (DE-588)1115733699 |4 aut | |
245 | 1 | 0 | |a Data mining algorithms in C++ |b data patterns and algorithms for modern applications |c Timothy Masters |
264 | 1 | |a Berkeley, CA |b Apress |c [2018] | |
264 | 4 | |c © 2018 | |
300 | |a xiv, 286 Seiten |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
650 | 0 | 7 | |a C++ |0 (DE-588)4193909-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Data Mining |0 (DE-588)4428654-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Data Mining |0 (DE-588)4428654-5 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 2 | |a C++ |0 (DE-588)4193909-8 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4842-3315-3 |
856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030255360&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-030255360 |
Datensatz im Suchindex
_version_ | 1804178384245227520 |
---|---|
adam_text | Table of Contents
About the Author........................................................ vii
About the Technical Reviewers......................................................ix
Introduction................................................................... xi
Chapter 1: Information and Entropy..................................................1
Entropy...........................................................................1
Entropy of a Continuous Random Variable........................................5
Partitioning a Continuous Variable for Entropy.................................5
An Example of Improving Entropy...............................................10
Joint and Conditional Entropy....................................................12
Code for Conditional Entropy..................................................16
Mutual Information...............................................................17
Fano’s Bound and Selection of Predictor Variables........................... 19
Confusion Matrices and Mutual Information.....................................21
Extending Fano’s Bound for Upper Limits.......................................23
Simple Algorithms for Mutual Information......................................27
The TESTJDIS Program........................................................ 34
Continuous Mutual Information.................................................. 36
The Parzen Window Method......................................................37
Adaptive Partitioning.........................................................45
The TEST_CON Program..........................................................60
Asymmetric Information Measures..................................................61
Uncertainty Reduction....................................................... 61
Transfer Entropy: Schreiber’s Information Transfer............................65
in
TABLE OF CONTENTS
Chapter 2: Screening for Relationships................................................ 75
Simple Screening Methods................................................................75
Univariate Screening............................................................. 76
Bivariate Screening.................................................................76
Forward Stepwise Selection..........................................................76
Forward Selection Preserving Subsets................................................77
Backward Stepwise Selection....................................................... 77
Criteria for a Relationship.............................................................77
Ordinary Correlation................................................................78
Nonparametric Correlation...........................................................79
Accommodating Simple Nonlinearity................................................. 82
Chi-Square and Cramer’s V...........................................................85
Mutual Information and Uncertainty Reduction........................................88
Multivariate Extensions.............................................................88
Permutation Tests.......................................................................89
A Modestly Rigorous Statement of the Procedure......................................89
A More Intuitive Approach...........................................................91
Serial Correlation Can Be Deadly....................................................93
Permutation Algorithms..............................................................93
Outline of the Permutation Test Algorithm...........................................94
Permutation Testing for Selection Bias..............................................95
Combinatorial^ Symmetric Cross Validation...............................................97
The CSCV Algorithm.................................................................102
An Example of CSCV 00S Testing.....................................................109
Univariate Screening for Relationships.................................................110
Three Simple Examples..............................................................114
Bivariate Screening for Relationships.................................................116
Stepwise Predictor Selection Using Mutual Information................................ 124
Maximizing Relevance While Minimizing Redundancy...................................125
Code for the Relevance Minus Redundancy Algorithm..................................128
IV
TABLE OF CONTENTS
An Example of Relevance Minus Redundancy..........................................132
A Superior Selection Algorithm for Binary Variables...............................136
FREL for High-Dimensionality, Small Size Datasets.................................. 141
Regularization.................................................................. 145
Interpreting Weights..............................................................146
Bootstrapping FREL................................................................146
Monte Carlo Permutation Tests of FREL.............................................147
General Statement of the FREL Algorithm......................................... 149
Multithreaded Code for FREL.......................................................153
Some FREL Examples................................................................164
Chapter 3: Displaying Relationship Anomalies...........................................167
Marginal Density Product.............................................................171
Actual Density.......................................................................171
Marginal Inconsistency...............................................................171
Mutual Information Contribution......................................................172
Code for Computing These Plots.......................................................173
Comments on Showing the Display......................................................183
Chapter 4: Fun with Eigenvectors................................................... 185
Eigenvalues and Eigenvectors.........................................................186
Principal Components (If You Really Must)............................................188
The Factor Structure Is More Interesting.............................................189
A Simple Example..................................................................190
Rotation Can Make Naming Easier...................................................192
Code for Eigenvectors and Rotation...................................................194
Eigenvectors of a Real Symmetric Matrix......................................... 194
Factor Structure of a Dataset.....................................................196
Varimax Rotation..................................................................199
Horn’s Algorithm for Determining Dimensionality......................................202
Code for the Modified Horn Algorithm..............................................203
v
TABLE OF CONTENTS
Clustering Variables in a Subspace.....................................................213
Code for Clustering Variables.......................................................217
Separating Individual from Common Variance.............................................221
Log Likelihood the Slow, Definitional Way..........................................228
Log Likelihood the Fast, Intelligent Way...........................................230
The Basic Expectation Maximization Algorithm.......................................232
Code for Basic Expectation Maximization............................................234
Accelerating the EM Algorithm......................................................237
Code for Quadratic Acceleration with DECME-2s.......................................241
Putting It All Together............................................................246
Thoughts on My Version of the Algorithm.............................................257
Measuring Coherence....................................................................257
Code for Tracking Coherence.........................................................260
Coherence in the Stock Market.......................................................264
Chapter 5: Using the DATAMINE Program.....................................................267
File/Read Data File....................................................................267
File/Exit..............................................................................268
Screen/Univariate Screen...............................................................268
Screen/Bivariate Screen................................................................269
Screen/Relevance Minus Redundancy......................................................271
Screen/FREL............................................................................272
Analyze/Eigen Analysis.................................................................274
Analyze/Factor Analysis................................................................274
Analyze/Rotate.........................................................................275
Analyze/Cluster Variables..............................................................276
Analyze/Coherence......................................................................276
Plot/Series............................................................................277
Plot/Histogram.........................................................................277
Plot/Density...........................................................................277
Index.....................................................................................281
vi
|
any_adam_object | 1 |
author | Masters, Timothy |
author_GND | (DE-588)1115733699 |
author_facet | Masters, Timothy |
author_role | aut |
author_sort | Masters, Timothy |
author_variant | t m tm |
building | Verbundindex |
bvnumber | BV044860663 |
classification_rvk | ST 250 ST 530 |
classification_tum | DAT 620f DAT 758f |
ctrlnum | (OCoLC)1031928061 (DE-599)BVBBV044860663 |
dewey-full | 005.13 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.13 |
dewey-search | 005.13 |
dewey-sort | 15.13 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01720nam a2200433 c 4500</leader><controlfield tag="001">BV044860663</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180605 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">180309s2018 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781484233146</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-1-4842-3314-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1031928061</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044860663</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-945</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 530</subfield><subfield code="0">(DE-625)143679:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 620f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 758f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Masters, Timothy</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1115733699</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data mining algorithms in C++</subfield><subfield code="b">data patterns and algorithms for modern applications</subfield><subfield code="c">Timothy Masters</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berkeley, CA</subfield><subfield code="b">Apress</subfield><subfield code="c">[2018]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 286 Seiten</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">C++</subfield><subfield code="0">(DE-588)4193909-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Data Mining</subfield><subfield code="0">(DE-588)4428654-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Data Mining</subfield><subfield code="0">(DE-588)4428654-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">C++</subfield><subfield code="0">(DE-588)4193909-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4842-3315-3</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030255360&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030255360</subfield></datafield></record></collection> |
id | DE-604.BV044860663 |
illustrated | Illustrated |
indexdate | 2024-07-10T08:03:07Z |
institution | BVB |
isbn | 9781484233146 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030255360 |
oclc_num | 1031928061 |
open_access_boolean | |
owner | DE-945 DE-11 DE-739 DE-91G DE-BY-TUM DE-384 |
owner_facet | DE-945 DE-11 DE-739 DE-91G DE-BY-TUM DE-384 |
physical | xiv, 286 Seiten Illustrationen |
publishDate | 2018 |
publishDateSearch | 2018 |
publishDateSort | 2018 |
publisher | Apress |
record_format | marc |
spelling | Masters, Timothy Verfasser (DE-588)1115733699 aut Data mining algorithms in C++ data patterns and algorithms for modern applications Timothy Masters Berkeley, CA Apress [2018] © 2018 xiv, 286 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier C++ (DE-588)4193909-8 gnd rswk-swf Data Mining (DE-588)4428654-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Data Mining (DE-588)4428654-5 s Algorithmus (DE-588)4001183-5 s C++ (DE-588)4193909-8 s DE-604 Erscheint auch als Online-Ausgabe 978-1-4842-3315-3 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030255360&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Masters, Timothy Data mining algorithms in C++ data patterns and algorithms for modern applications C++ (DE-588)4193909-8 gnd Data Mining (DE-588)4428654-5 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4193909-8 (DE-588)4428654-5 (DE-588)4001183-5 |
title | Data mining algorithms in C++ data patterns and algorithms for modern applications |
title_auth | Data mining algorithms in C++ data patterns and algorithms for modern applications |
title_exact_search | Data mining algorithms in C++ data patterns and algorithms for modern applications |
title_full | Data mining algorithms in C++ data patterns and algorithms for modern applications Timothy Masters |
title_fullStr | Data mining algorithms in C++ data patterns and algorithms for modern applications Timothy Masters |
title_full_unstemmed | Data mining algorithms in C++ data patterns and algorithms for modern applications Timothy Masters |
title_short | Data mining algorithms in C++ |
title_sort | data mining algorithms in c data patterns and algorithms for modern applications |
title_sub | data patterns and algorithms for modern applications |
topic | C++ (DE-588)4193909-8 gnd Data Mining (DE-588)4428654-5 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | C++ Data Mining Algorithmus |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030255360&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT masterstimothy dataminingalgorithmsincdatapatternsandalgorithmsformodernapplications |