Ability of Evolutionary and Recurrent SOM model GA-RSOM in Phonemic Recognition Optimization
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2013, Vol 4, Issue 6
Abstract
The phoneme recognition aims to process a speech signal, characterized by a non-linearity with very high dynamics, allowing to perform various tasks on an information processing machine by an operator using orally address. This paper focuses on a proposed strategy, which implements an evolutionary recurrent self organizing map (SOM) model in phonemes recognition to improve their rates. It is a hybrid model (GARSOM) reflecting the approaches of K-means mobile centers, the evolutionary genetic algorithm (GA) principle and the recurrent temporal appearance of Kohonen map (RSOM) to be a powerful optimization tool for phonemic recognition, even in adverse environmental conditions.
Authors and Affiliations
Mohamed Salah Salhi ; Najet Arous; Noureddine Ellouze
Keywords
Related Articles
- EP ID EP157070
- DOI -
- Views 88
- Downloads 0
A Sparse Twin SVM for multi-classification problems
We propose Sparse TSVM, a multi-class SVM classifier that determines k nonparallel planes by solving k related SVM-type problems. The Sparse TSVM promotes Twin SVM to one-versus-rest approach. And it capture classe...
Fact Type Results in Half Domination in Graphs
Let G = (V, E) be a finite graph with n vertices and m edges. A subset D⊆ V of vertices in a graph G is called half dominating set if at least half of the vertices of V(G) are either in D or adjacent to vertices of D. (i...
Cooperating distributed context-free hexagonal array grammar systems with permitting contexts
In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating the generative power...
Independent Domination of Splitted Graphs
A dominating set D of a splitted graph S(G) = ( V, E ) is an independent dominating set if the induced subgraph <D> has no edges. The independent domination number i[S(G)] of a graph S(G) is the minimum cardinality...
On Semi-Symmetric Metric Connection in a Generalized (k,μ) Space Forms
In this paper we study some properties of curvature tensor on semi-symmetric metric connection in a generalized space forms. As a consequence of these results we investigate the conditions for a generalized space forms t...