國立虎尾科技大學 |

Modern Data Mining Algorithms in C++ and CUDA C = Recent Developments in Feature Extraction and Selection Algorithms for Data Science /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Modern Data Mining Algorithms in C++ and CUDA C/ by Timothy Masters.
Reminder of title:	Recent Developments in Feature Extraction and Selection Algorithms for Data Science /
Author:	Masters, Timothy.
Description:	IX, 228 p. 2 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Programming Languages, Compilers, Interpreters. -
Online resource:	https://doi.org/10.1007/978-1-4842-5988-7
ISBN:	9781484259887

Modern Data Mining Algorithms in C++ and CUDA C = Recent Developments in Feature Extraction and Selection Algorithms for Data Science /
Masters, Timothy.

Modern Data Mining Algorithms in C++ and CUDA CRecent Developments in Feature Extraction and Selection Algorithms for Data Science /[electronic resource] :by Timothy Masters. - 1st ed. 2020. - IX, 228 p. 2 illus.online resource.

1. Introduction -- 2. Forward Selection Component Analysis -- 3. Local Feature Selection -- 4. Memory in Time Series Features -- 5. Stepwise Selection on Steroids -- 6. Nominal-to-Ordinal Conversion.

As a serious data miner you will often be faced with thousands of candidate features for your prediction or classification application, with most of the features being of little or no value. You’ll know that many of these features may be useful only in combination with certain other features while being practically worthless alone or in combination with most others. Some features may have enormous predictive power, but only within a small, specialized area of the feature space. The problems that plague modern data miners are endless. This book helps you solve this problem by presenting modern feature selection techniques and the code to implement them. Some of these techniques are: Forward selection component analysis Local feature selection Linking features and a target with a hidden Markov model Improvements on traditional stepwise selection Nominal-to-ordinal conversion All algorithms are intuitively justified and supported by the relevant equations and explanatory material. The author also presents and explains complete, highly commented source code. The example code is in C++ and CUDA C but Python or other code can be substituted; the algorithm is important, not the code that's used to write it. You will: Combine principal component analysis with forward and backward stepwise selection to identify a compact subset of a large collection of variables that captures the maximum possible variation within the entire set. Identify features that may have predictive power over only a small subset of the feature domain. Such features can be profitably used by modern predictive models but may be missed by other feature selection methods. Find an underlying hidden Markov model that controls the distributions of feature variables and the target simultaneously. The memory inherent in this method is especially valuable in high-noise applications such as prediction of financial markets. Improve traditional stepwise selection in three ways: examine a collection of 'best-so-far' feature sets; test candidate features for inclusion with cross validation to automatically and effectively limit model complexity; and at each step estimate the probability that our results so far could be just the product of random good luck. We also estimate the probability that the improvement obtained by adding a new variable could have been just good luck. Take a potentially valuable nominal variable (a category or class membership) that is unsuitable for input to a prediction model, and assign to each category a sensible numeric value that can be used as a model input.

ISBN: 9781484259887

Standard No.: 10.1007/978-1-4842-5988-7doiSubjects--Topical Terms:

669782
Programming Languages, Compilers, Interpreters.

LC Class. No.: QA76.9.D343

Dewey Class. No.: 006.312

Modern Data Mining Algorithms in C++ and CUDA C = Recent Developments in Feature Extraction and Selection Algorithms for Data Science /
LDR:04182nam a22003975i 4500 001 1028492
003 DE-He213
005 20200704024001.0
007 cr nn 008mamaa
008 210318s2020 xxu| s |||| 0|eng d
020 $a 9781484259887 $9 978-1-4842-5988-7
024 7 $a 10.1007/978-1-4842-5988-7 $2 doi
035 $a 978-1-4842-5988-7
050 4 $a QA76.9.D343
072 7 $a UNF $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 Masters, Timothy. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1204136
245 1 0 $a Modern Data Mining Algorithms in C++ and CUDA C $h [electronic resource] : $b Recent Developments in Feature Extraction and Selection Algorithms for Data Science / $c by Timothy Masters.
250 $a 1st ed. 2020.
264 1 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2020.
300 $a IX, 228 p. 2 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 1. Introduction -- 2. Forward Selection Component Analysis -- 3. Local Feature Selection -- 4. Memory in Time Series Features -- 5. Stepwise Selection on Steroids -- 6. Nominal-to-Ordinal Conversion.
520 $a As a serious data miner you will often be faced with thousands of candidate features for your prediction or classification application, with most of the features being of little or no value. You’ll know that many of these features may be useful only in combination with certain other features while being practically worthless alone or in combination with most others. Some features may have enormous predictive power, but only within a small, specialized area of the feature space. The problems that plague modern data miners are endless. This book helps you solve this problem by presenting modern feature selection techniques and the code to implement them. Some of these techniques are: Forward selection component analysis Local feature selection Linking features and a target with a hidden Markov model Improvements on traditional stepwise selection Nominal-to-ordinal conversion All algorithms are intuitively justified and supported by the relevant equations and explanatory material. The author also presents and explains complete, highly commented source code. The example code is in C++ and CUDA C but Python or other code can be substituted; the algorithm is important, not the code that's used to write it. You will: Combine principal component analysis with forward and backward stepwise selection to identify a compact subset of a large collection of variables that captures the maximum possible variation within the entire set. Identify features that may have predictive power over only a small subset of the feature domain. Such features can be profitably used by modern predictive models but may be missed by other feature selection methods. Find an underlying hidden Markov model that controls the distributions of feature variables and the target simultaneously. The memory inherent in this method is especially valuable in high-noise applications such as prediction of financial markets. Improve traditional stepwise selection in three ways: examine a collection of 'best-so-far' feature sets; test candidate features for inclusion with cross validation to automatically and effectively limit model complexity; and at each step estimate the probability that our results so far could be just the product of random good luck. We also estimate the probability that the improvement obtained by adding a new variable could have been just good luck. Take a potentially valuable nominal variable (a category or class membership) that is unsuitable for input to a prediction model, and assign to each category a sensible numeric value that can be used as a model input.
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Statistics, general. $3 671463
650 2 4 $a Professional Computing. $3 1115983
650 1 4 $a Data Mining and Knowledge Discovery. $3 677765
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Statistics . $3 1253516
650 0 $a Computer software. $3 528062
650 0 $a Data mining. $3 528622
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9781484259870
776 0 8 $i Printed edition: $z 9781484259894
856 4 0 $u https://doi.org/10.1007/978-1-4842-5988-7
912 $a ZDB-2-CWD
912 $a ZDB-2-SXPC
950 $a Professional and Applied Computing (SpringerNature-12059)
950 $a Professional and Applied Computing (R0) (SpringerNature-43716)