An Empirical Comparison of SVM and Some Supervised Learning Algorithms for Vowel recognition

07/22/2015

∙

In this article, we conduct a study on the performance of some supervised learning algorithms for vowel recognition. This study aims to compare the accuracy of each algorithm. Thus, we present an empirical comparison between five supervised learning classifiers and two combined classifiers: SVM, KNN, Naive Bayes, Quadratic Bayes Normal (QDC) and Nearst Mean. Those algorithms were tested for vowel recognition using TIMIT Corpus and Mel-frequency cepstral coefficients (MFCCs).

READ FULL TEXT

An Empirical Comparison of SVM and Some Supervised Learning Algorithms for Vowel recognition

A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation

A Comparison of Machine Learning Algorithms for the Surveillance of Autism Spectrum Disorder

Study and Observation of the Variation of Accuracies of KNN, SVM, LMNN, ENN Algorithms on Eleven Different Datasets from UCI Machine Learning Repository

Naive Bayes and Exemplar-Based approaches to Word Sense Disambiguation Revisited

Relevance As a Metric for Evaluating Machine Learning Algorithms

The Labeling Distribution Matrix (LDM): A Tool for Estimating Machine Learning Algorithm Capacity

Neutralized Empirical Risk Minimization with Generalization Neutrality Bound

An Empirical Comparison of SVM and Some Supervised Learning Algorithms for Vowel recognition

Related Research

A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation

A Comparison of Machine Learning Algorithms for the Surveillance of Autism Spectrum Disorder

Study and Observation of the Variation of Accuracies of KNN, SVM, LMNN, ENN Algorithms on Eleven Different Datasets from UCI Machine Learning Repository

Naive Bayes and Exemplar-Based approaches to Word Sense Disambiguation Revisited

Relevance As a Metric for Evaluating Machine Learning Algorithms

The Labeling Distribution Matrix (LDM): A Tool for Estimating Machine Learning Algorithm Capacity

Neutralized Empirical Risk Minimization with Generalization Neutrality Bound