- 主頁 /
- 書 /
- Science & Math /
- Mathematics /
- Applied /
- Probability & Statistics /
- Modern Data Mining Algorithms in C++ and CUDA...
Modern Data Mining Algorithms in C++ and CUDA C: Recent Developments in Feature Extraction and Selection Algorithms for Data Science
HKD 539
Price Details
Excluding Shipping & Custom charges ( Shipping and custom charges will be calculated on checkout )
*All items will import from 美國
QTY:
Ubuy works hard to protect your security and privacy. Our advanced payment security system ensures confidentiality by encrypting your information during transmission using AES (Advanced Encryption Standards) and SSL (Secure Socket Layer) protocols. Your payment details are 100% secure as we do not share your payment details with third party sellers.
Discover a variety of data-mining algorithms that are useful for selecting small sets of important features from among unwieldy masses of candidates or extracting useful features from measured variables.
Fast
Shipping
Free
Return*
Secure Packaging
100% Original Products
PCI DSS Compliance
ISO 27001 Certified
What Stands Out
產品詳情
- Discover a variety of data-mining algorithms that are useful for selecting small sets of important features from among unwieldy masses of candidates, or extracting useful features from measured variables. 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 analysisLocal feature selectionLinking features and a target with a hidden Markov modelImprovements on traditional stepwise selectionNominal-to-ordinal conversionAll 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. What You Will LearnCombine 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.Who This Book Is ForIntermediate to advanced data science programmers and analysts.
| Publisher | Apress |
| Publication date | June 6, 2020 |
| Edition | First Edition |
| Language | English |
| Print length | 237 pages |
| ISBN-10 | 1484259874 |
| ISBN-13 | 978-1484259870 |
| Item Weight | 15.2 ounces (430.92 grams) |
| Dimensions | 7.01 x 0.55 x 10 inches (17.8 x 1.4 x 25.4 cm) |
Who Should Buy?
-
Data Scientists
Ideal for data scientists seeking to implement advanced mining algorithms using C++ and CUDA for performance improvements.
-
C++ Developers
C++ developers looking to expand their knowledge on data mining algorithms and their practical applications in data science.
-
Academics Researchers
Researchers in academia who require a deeper understanding of feature extraction and selection algorithms for their studies.
-
Beginners
Not suitable for beginners in programming or data mining, as it assumes a high level of prior knowledge.
產品敘述
客戶問題與解答
-
題:
如何從 Ubuy 在線購物 Modern Data Mining Algorithms in C++ and CUDA C:?
回答: 從 Ubuy 在線購物 Modern Data Mining Algorithms in C++ and CUDA C: 非常簡單。. 您只需搜索產品,在結賬時選擇運輸方式,然後將其運送到您所在的位置。 -
題:
Modern Data Mining Algorithms in C++ and CUDA C: 可以在 Hong Kong 在線購物嗎?
回答: 是的,您可以在 Ubuy Hong Kong 以合理的價格購買該產品。. Modern Data Mining Algorithms in C++ and CUDA C: 在本地不可用,但您可以信任我們的快遞服務。 -
題:
下訂單後需要多長時間才能收到產品?
回答: 您訂購的產品的交貨時間根據您訂購的商品和您選擇的運輸方式而有所不同。. 結賬時會提到預計送貨時間,所以購物時請放心。
Probability & Statistics Editorial Review
Modern Data Mining Algorithms in C++ and CUDA C: Recent Developments in Feature Extraction and Selection Algorithms for Data Science offers a deep dive into advanced techniques for data science and machine learning. Published by Apress, the first edition of this book is packed with 237 pages of insightful content designed for practitioners and researchers alike. The book provides modern approaches to feature extraction and selection, crucial for enhancing the performance of data mining algorithms. Readers appreciate the clarity in explaining complex concepts, making it a valuable resource for both newcomers and experienced professionals in the field of data science.
Customer Reviews & Ratings
-
5 星
75%
-
4 星
0%
-
3 星
25%
-
2 星
0%
-
1 星
0%
評價此產品
與其他客戶分享您的想法
優點
- Comprehensive coverage of modern data mining techniques
- Focus on both C++ and CUDA C programming languages
- Clear explanations make complex topics accessible
- Ideal for researchers and data science practitioners
- Well-organized content enhances learning experience
缺點
- Minor typographical errors found in some sections
Product Price History
重要資訊
- 限制:如跨國購買產品,請注意製造商的保固有可能無效;製造商服務選項可能無法使用;產品手冊、教學、以及安全警示可能不會是目的地國家的語言;產品(與附加材料)設計也許不會符合目的地國家的標準、規格、以及標示要求;且產品也許不會符合目的地國家的伏特數值與其他電力標準(需要使用合適的變壓器或轉接器)。收件者須負責確定該產品在目的地國家可合法進口。當在 Ubuy 或其聯盟夥伴網站上訂購時,收件者為記錄上的進口者,且必須遵從目的地國家的法律與規範。
- 由於 Ubuy 是一個全球搜尋引擎,並不是所有列於 Ubuy 的產品都有出售。產品須受出口/貿易法規規範。
HKD 539
現在訂購,約可在下列時間收貨: 星期六, 十月 17
This item is not restrict in my country.(Please click on above link if this item is not restrict in your country, So our team will review and allow.)
QTY:
PCI DSS compliant and ISO 27001:2022 certified, with encrypted payments and full buyer protection on every order.
特色和優勢
- Learn techniques like forward selection component analysis.
- Combine principal component analysis with stepwise selection.
- Identify features with predictive power over specific feature subsets.
- Understand hidden Markov models for feature and target distributions.
- Improve traditional stepwise selection methods.
- Convert nominal variables for model input.
Ubuy Assurance
Experience worry-free shopping with 100% original products, PCI DSS-compliant payment security, ISO 27001-certified data protection, the fastest cross-border delivery, free returns *, and secure packaging on every order.