Kernel Based Algorithms for Mining Huge Data Sets (original) (raw)

Overview

Authors:

  1. Te-Ming Huang
    1. Faculty of Engineering, The University of Auckland, Auckland, New Zealand
  2. Vojislav Kecman
    1. Faculty of Engineering, The University of Auckland, Auckland, New Zealand
  3. Ivica Kopriva
    1. Department of Electrical and Computer Engineering, Washington D.C., USA

Access this book

Log in via an institution

Other ways to access

About this book

"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.

Similar content being viewed by others

Table of contents (6 chapters)

Authors and Affiliations

Te-Ming Huang, Vojislav Kecman

Ivica Kopriva

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Back to top