| Author | Te-Ming Huang,Vojislav Kecman,Ivica Kopriva |
| Format | Hardcover |
| ISBN | 9783540316817 |
| Publication Date | 17/05/2009 |
| Publisher | Springer-Verlag Berlin and Heidelberg Gmbh & Co. K |
| Manufacturer | Springer-verlag Berlin And Heidelberg Gmbh & Co. K |
"Kernel Based Algorithms for Mining Huge Data Sets" is the first book treating the fields of supervised, semi-supervised and unsupervised machine learning collectively. The book presents both the theory and the algorithms for mining huge data sets by using support vector machines (SVMs) in an iterative way.
It demonstrates how kernel based SVMs can be used for dimensionality reduction (feature elimination) and shows the similarities and differences between the two most popular unsupervised techniques, the principal component analysis (PCA) and the independent component analysis (ICA). The book presents various examples, software, algorithmic solutions enabling the reader to develop their own codes for solving the problems.
The book is accompanied by a website for downloading both data and software for huge data sets modeling in a supervised and semi supervised manner, as well as MATLAB based PCA and ICA routines for unsupervised learning. The book focuses on a broad range of machine learning algorithms and it is particularly aimed at students, scientists, and practicing researchers in bioinformatics (gene micro arrays), text-categorization, numerals recognition, as well as in the images and audio signals de-mixing (blind source separation) areas.
Loading similar products...
Stay informed about the best deals and price drops. Choose which notifications you'd like to receive from PriceCheck.