By Topic

The Application of Improved Sparse Least-Squares Support Vector Machine in Speaker Identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ruiling Luo ; Coll. of Inf. Sci. & Technol., Shihezi Univ., Shihezi, China ; Wenqing Cai ; Min Chen ; Zhongling Han

SVM is a novel type of statistical learning method that has been successfully used in speaker recognition. However, training SVM consumes long computing time and large storage space with all training examples. This paper proposes an improved sparse least-squares support vector machine (LS-SVM) for speaker identification. Firstly KPCA is exploited to reduce the dimension of input vectors and to denoise speech signal by extracting the nonlinear principal components of feature vectors. Since LS-SVM simplifies the computation by solving a set of linear equations instead of the quadratic programming problems involved by the standard SVM, LS-SVM classification algorithm has been run in our identification system. However before training samples, we have used pruning method to reduce the number of training samples which have been preprocessed by KPCA without discounting the generalization performance. A number of experimental results illustrate that the proposed method shows faster speed and greater accuracy with less storage than other models.

Published in:

Intelligent Systems and Applications (ISA), 2011 3rd International Workshop on

Date of Conference:

28-29 May 2011