Cantitate/Preț
Produs

Kernel Based Algorithms for Mining Huge Data Sets

Autor Te-Ming Huang, Vojislav Kecman, Ivica Kopriva
en Limba Engleză Hardback – 2 mar 2006
"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 semisupervised 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 microarrays), text-categorization, numerals recognition, as well as in the images and audio signals de-mixing (blind source separation) areas.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 61976 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 25 noi 2010 61976 lei  6-8 săpt.
Hardback (1) 62671 lei  6-8 săpt.
  Springer – 2 mar 2006 62671 lei  6-8 săpt.

Preț: 62671 lei

Preț vechi: 78338 lei
-20% Nou

Puncte Express: 940

Preț estimativ în valută:
11088 13036$ 9711£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540316817
ISBN-10: 3540316817
Pagini: 284
Ilustrații: XVI, 260 p.
Dimensiuni: 160 x 241 x 20 mm
Greutate: 0.59 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Support Vector Machines in Classification and Regression — An Introduction.- Iterative Single Data Algorithm for Kernel Machines from Huge Data Sets: Theory and Performance.- Feature Reduction with Support Vector Machines and Application in DNA Microarray Analysis.- Semi-supervised Learning and Applications.- Unsupervised Learning by Principal and Independent Component Analysis.

Textul de pe ultima copertă

"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 semisupervised 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 microarrays), text-categorization, numerals recognition, as well as in the images and audio signals de-mixing (blind source separation) areas.

Caracteristici

Reports recent research results on Kernel Based Algorithms for Mining Huge Data Sets A book about (machine) learning from (experimental) data Includes supplementary material: sn.pub/extras