Research Article Open Access

A Novel Linear-Polynomial Kernel to Construct Support Vector Machines for Speech Recognition

Balwant A. Sonkamble1 and D.D. Doye2
  • 1 ,
  • 2 , Afganistan
Journal of Computer Science
Volume 7 No. 7, 2011, 991-996

DOI: https://doi.org/10.3844/jcssp.2011.991.996

Submitted On: 23 January 2011 Published On: 28 June 2011

How to Cite: Sonkamble, B. A. & Doye, D. (2011). A Novel Linear-Polynomial Kernel to Construct Support Vector Machines for Speech Recognition. Journal of Computer Science, 7(7), 991-996. https://doi.org/10.3844/jcssp.2011.991.996

Abstract

Problem statement: To accept the inputs as spoken word utterances uttered by various speakers, recognize the corresponding spoken words and initiate action pertaining to that word. Approach: A novel Linear-Polynomial (LP) Kernel function was used to construct support vector machines to classify the spoken word utterances. The support vector machines were constructed using various kernel functions. The use of well known one-versus-one approach considered with voting algorithm. Results: The empirical results compared by implementing various kernel functions such as linear kernel function, polynomial kernel function and LP kernel functions to construct different SVMs. Conclusion: The generalization performances based on the One-versus- One approach for speech recognition were compared with the novel LP kernel function. The SVMs using LP kernel function classifies the spoken utterances very efficiently as compared to other kernel functions. The performance of the novel LP kernel function was outstanding as compared to other kernel functions.

  • 1,033 Views
  • 1,742 Downloads
  • 4 Citations

Download

Keywords

  • Hidden Markov Model (HMM)
  • neural network
  • Empirical Risk Minimization (ERM)
  • kernel function
  • voting algorithm
  • Modified Fuzzy-Hyper sphere Neural Networks (MFHNN)
  • Support Vector Machines (SVM)
  • hyperplane
  • Vapnik-Chervonenkis (VC)
  • Linear-Polynomial (LP)