<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0120-6230</journal-id>
<journal-title><![CDATA[Revista Facultad de Ingeniería Universidad de Antioquia]]></journal-title>
<abbrev-journal-title><![CDATA[Rev.fac.ing.univ. Antioquia]]></abbrev-journal-title>
<issn>0120-6230</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería, Universidad de Antioquia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0120-62302009000400010</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Dissimilarity-based classification for stochastic models of embedding spaces applied to voice pathology detection]]></article-title>
<article-title xml:lang="es"><![CDATA[Clasificación basada en disimilaridades para modelos estocásticos de espacios de embebimiento aplicada a detección de patologías de voz]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Londoño]]></surname>
<given-names><![CDATA[Julián Arias]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Godino Llorente]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Jaramillo Garzón]]></surname>
<given-names><![CDATA[Jorge]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Castellanos Domínguez]]></surname>
<given-names><![CDATA[Germán]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Nacional de Colombia, Sede Manizales GC&PDS ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad Politécnica de Madrid  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>España</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2009</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2009</year>
</pub-date>
<numero>50</numero>
<fpage>111</fpage>
<lpage>121</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0120-62302009000400010&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0120-62302009000400010&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0120-62302009000400010&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[This paper investigates a new way for modelling the nonlinear behavior present in athological voice signals. The main idea is modelling the timedelay reconstructed attractors, taking into account the spatial and temporal information of the trajectories by means of a discrete Hidden Markov model (HMM). When the attractors are modeled with HMM it is possible to compute a probabilistic kernel-based distance among models to construct a dissimilarity space. This approach enables the possibility of comparing attractor families by their profiles, rather than evaluating individual nonlinear features of each subject. Classification of dissimilarity space is carried out by using a naive 1-nearest neighbors rule and it is compared with another classification scheme that employs two conventional nonlinear statistics: largest Lyapunov exponent and correlation dimension. Results show that the maximum accuracy with the proposed scheme is a 18.71% greater than the maximum accuracy obtained from the classification based on the conventional nonlinear statistics.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[En este trabajo se investiga una forma alternativa de modelar el comportamiento no lineal presente en las señales de voz patológicas. El método consiste en modelar atractores reconstruidos mediante la técnica de retardo de tiempo, teniendo en cuenta la información espacial y temporal de las trayectorias en el atractor a partir de modelos ocultos de Markov (HMM) discretos. A partir de modelos HMM entrenados para los espacios embebidos es posible calcular una medida de distancia basada en un kernel probabilístico, que posibilita la construcción de un espacio de disimilitud. Esta aproximación permite la comparación de familias de atractores a partir de la comparación de prototipos en lugar de evaluar características no lineales individuales de cada sujeto. La clasificación del espacio de disimilitud se lleva a cabo usando un clasificador por vecino más cercano y se compara con otro esquema de clasificación que emplea dos características convencionalmente empleadas en análisis no lineal: máximo exponente de Lyapunov y dimensión de correlación. Los resultados muestran que la máxima eficiencia alcanzada con el esquema propuesto es un 18,71% más alta que la máxima exactitud obtenida a partir de clasificación basada en estadísticas no lineales convencionales.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Nonlinear analysis of pathological voices]]></kwd>
<kwd lng="en"><![CDATA[embedding spaces]]></kwd>
<kwd lng="en"><![CDATA[hidden Markov models]]></kwd>
<kwd lng="en"><![CDATA[dissimilarity space classification]]></kwd>
<kwd lng="es"><![CDATA[Análisis no lineal de voces patológicas]]></kwd>
<kwd lng="es"><![CDATA[espacios de embebimiento]]></kwd>
<kwd lng="es"><![CDATA[modelos ocultos de Markov]]></kwd>
<kwd lng="es"><![CDATA[clasificación de espacios de disimilitud]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="center"><font face="Verdana" size="4"> <b>Dissimilarity&#45;based classification for stochastic models of embedding spaces applied to voice pathology detection</b></font></p>     <p align="center"><font face="Verdana" size="4"> <b>Clasificaci&oacute;n basada en disimilaridades para modelos estoc&aacute;sticos de espacios de embebimiento aplicada a detecci&oacute;n de patolog&iacute;as de voz</b></font></p>     <p> <font face="Verdana" size="2"> <i>Juli&aacute;n Arias Londo&ntilde;o<sup>1,2*</sup>, Juan Godino Llorente<sup>2</sup>, Jorge Jaramillo Garz&oacute;n<sup>1</sup>, Germ&aacute;n Castellanos Dom&iacute;nguez<sup>1</sup></i></font></p>     <p> <font face="Verdana" size="2"><sup>1</sup>Universidad Nacional de Colombia, Sede Manizales, GC&amp;PDS, Campus La Nubia, Km. 9 V&iacute;a Al Aeropuerto La Nubia, Caldas, Colombia</font></p>     <p> <font face="Verdana" size="2"><sup>2</sup>Universidad Polit&eacute;cnica de Madrid, Dept. ICS, EUIT Telecomunicaci&oacute;n, Ctra. Valencia, km. 7, 28031, Madrid, Espa&ntilde;a</font></p>     <p><font face="Verdana" size="2">&nbsp;</font></p> <hr noshade size="1">      <p><font face="Verdana" size="3"> <b>Abstract</b></font></p>     <p><font face="Verdana" size="2">This paper investigates a new way for modelling the nonlinear behavior present in athological voice signals. The main idea is modelling the timedelay reconstructed attractors, taking into account the spatial and temporal information of the trajectories by means of a discrete Hidden Markov model &#40;HMM&#41;. When the attractors are modeled with HMM it is possible to compute a probabilistic kernel&#45;based distance among models to construct a dissimilarity space. This approach enables the possibility of comparing attractor families by their profiles, rather than evaluating individual nonlinear features of each subject. Classification of dissimilarity space is carried out by using a naive 1&#45;nearest neighbors rule and it is compared with another classification scheme that employs two conventional nonlinear statistics: largest Lyapunov exponent and correlation dimension. Results show that the maximum accuracy with the proposed scheme is a 18.71&#37; greater than the maximum accuracy obtained from the classification based on the conventional nonlinear statistics.</font></p>     <p><font face="Verdana" size="2"><b>Keywords:</b> Nonlinear analysis of pathological voices, embedding spaces, hidden Markov models, dissimilarity space classification</font></p>     <p><font face="Verdana" size="2">&nbsp;</font></p> <hr noshade size="1">     ]]></body>
<body><![CDATA[<p><font face="Verdana" size="3"> <b>Resumen</b></font></p>      <p><font face="Verdana" size="2">En este trabajo se investiga una forma alternativa de modelar el comportamiento no lineal presente en las se&ntilde;ales de voz patol&oacute;gicas. El m&eacute;todo consiste en modelar atractores reconstruidos mediante la t&eacute;cnica de retardo de tiempo, teniendo en cuenta la informaci&oacute;n espacial y temporal de las trayectorias en el atractor a partir de modelos ocultos de Markov &#40;HMM&#41; discretos. A partir de modelos HMM entrenados para los espacios embebidos es posible calcular una medida de distancia basada en un kernel probabil&iacute;stico, que posibilita la construcci&oacute;n de un espacio de disimilitud. Esta aproximaci&oacute;n permite la comparaci&oacute;n de familias de atractores a partir de la comparaci&oacute;n de prototipos en lugar de evaluar caracter&iacute;sticas no lineales individuales de cada sujeto. La clasificaci&oacute;n del espacio de disimilitud se lleva a cabo usando un clasificador por vecino m&aacute;s cercano y se compara con otro esquema de clasificaci&oacute;n que emplea dos caracter&iacute;sticas convencionalmente empleadas en an&aacute;lisis no lineal: m&aacute;ximo exponente de Lyapunov y dimensi&oacute;n de correlaci&oacute;n. Los resultados muestran que la m&aacute;xima eficiencia alcanzada con el esquema propuesto es un 18,71&#37; m&aacute;s alta que la m&aacute;xima exactitud obtenida a partir de clasificaci&oacute;n basada en estad&iacute;sticas no lineales convencionales.</font></p>      <p><font face="Verdana" size="2"><b>Palabras clave:</b> An&aacute;lisis no lineal de voces patol&oacute;gicas, espacios de embebimiento, modelos ocultos de Markov, clasificaci&oacute;n de espacios de disimilitud</font></p>      <p><font face="Verdana" size="2">&nbsp;</font></p> <hr noshade size="1">     <p><font face="Verdana" size="3"> <b>Introduction</b></font></p>      <p><font face="Verdana" size="2">In the analysis of physiological signals there exist several approaches that attempt to characterize the non&#45;linear behavior of the underlying system. Different investigations have shown that changes in nonlinear dynamic measures may indicate states of pathophysiological dysfunction [1]. This fact suggests that chaos theory and nonlinear dynamic methods might potentially be applied to diagnose physiological disorders and to evaluate the effects of clinical treatments [1]. For the particular case of automatic detection of voice disorders, it has been shown that there exist several factors that lead to nonlinear behavior in the speech signal [2, 3]. Much of the work done in this area is based on the use of acoustic parameters, noise measurements and cepstral coefficients [4,5]. However, several researchers have shown that there is a physical phenomenon involved in the voice production process that can not be characterized by the above measures, termed Nonlinear Behavior. Such a behavior in speech is produced by some mechanics as: nonlinear pressure&#45;flow relation in the glottis, nonlinear stress&#45;strain curves of vocal fold tissues, and nonlinearities associated with vocal fold collision [1]. In reference [6], the authors introduced a classification for sustained vowel speech sounds, taking into account nonlinear dynamic concepts. Type I sounds are those that are nearly periodic. Type II sounds are those that are aperiodic or does not have dominant period. Type III sounds are those that appear to have no periodic pattern at all. From this classification, the problem is that normal voices can usually be classified as Type I and sometimes Type II, whereas voice disorders commonly lead to all three types of sounds [7]. Additionally, conventional parameters as Shimmer and Jitter are defined only for voice signals nearly periodic and thus their usefulness may break down for Type II and Type III signals [1].</font></p>       <p><font face="Verdana" size="2">On the other hand, the conventional method used to perform an analysis over a time series based on nonlinear techniques, employs the Takens&rsquo; theorem to construct the embedding attractor of the signal [8]. From this attractor some nonlinear statistics as the correlation dimension and maximum Lyapunov exponent are estimated [8] in order to perform the automatic classification. However, nonlinear statistics require the dynamics of speech to be purely deterministic &#40;nonlinear statistics rely on a state space reconstruction and are likely to vary when the distribution of points in this state space changes&#41;, and this assumption is inadequate since randomness due to turbulence is an inherent part of speech production [7;9]. There are also numerical, theoretical and algorithmic problems associated with the calculation of nonlinear measures for real speech signals, casting doubt over the reliability of such tools [7]. In the last few years, a new measure called Approximate Entropy &#40;ApEn&#41; has been widely used. This measure can theoretically characterize the complexity of a large variety of systems [10]. ApEn is a measure of the rate of generation of new information, which can be applied to the typically short and noisy time series of clinical data. Nevertheless, in practice it has been shown that ApEn is heavily dependent on the record length and is uniformly lower than expected for short records [10]. Additionally, its calculation is expensive because it requires the evaluation of several trajectories for different embedding dimensions. In this work, a new way to characterize attractor trajectories is proposed. The main idea is modelling the embedding spaces taking into account the spatial and temporal information of the trajectories using a discrete Hidden Markov Model &#40;HMM&#41;. A HMM is a stochastic model that models the variability of a time series allowing the comparison between sequences of different lengths with no obvious alignment principle across temporal observations [11]. By using this class of models it is possible to represent the dynamic behavior of the state space without any assumption about the nature of the underlying system &#40;deterministic or stochastic&#41;. This approach enables the possibility of comparing attractor families by their profiles, rather than evaluating individual nonlinear features of each subject. In order to establish the discriminant capacities of the proposed approach in the problem of automatic detection of pathological voices, we carried out some experiments using conventional nonlinear statistics &#40;correlation dimension and maximum Lyapunov exponent&#41; as baseline in the framework of nonlinear analysis. The paper is organized as follow: section 2 describes the mathematical models and technique used to construct the patter recognition system. The section 3 presents the database, experiments and results. In the section 4 conclusions and discussions are pointed out and finally, some acknowledgments are presented.</font></p>       <p><font face="Verdana" size="3"><b>Methodology</b></font></p>      <p><font face="Verdana" size="2">Figure 1 shows a sequential scheme for the particular patter recognition system proposed in this work. Each of the stages in the scheme will be explained in the follow. </font></p>        <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i01.gif" ><a name="Figura1"></a></font></p>      ]]></body>
<body><![CDATA[<p><font face="Verdana" size="2"><b>Figure 1</b> Pattern recognition system for classifying nonlinear components of the normal/pathologic speech signals. The dashed box is equivalent to the extraction and selection stages in a conventional patter recognition system</font></p>      <p><font face="Verdana" size="2"><b>Attractor reconstruction</b></font></p>     <p><font face="Verdana" size="2">The state space reconstruction is based on the Time&#45;Delay Embedding Theorem [8], which can be written as follows: Given a dynamic system with a <i>m</i>&#45;dimensional solution space and an evolving solution <i><b>h</b>&#40;t&#41;</i>, let <i>x</i> be some observation <i>x&#40;<b>h</b>&#40;t&#41;&#41;</i>. Let us also define the lag vector &#40;with dimension m and common time lag &tau;&#41; <i>x&#40;t&#41;</i> &#61; &#40;<i>x<sub>t</sub> , x<sub>t&#45;&tau;</sub>, x<sub>t&#45;2 &tau;</sub>, x<sub>t&#45;&#40;m&#45;1&#41;&tau;</sub></i>&#41;. Then, under very general conditions, the space of vectors <i>x&#40;t&#41;</i> generated by the dynamics contains all the information of the space of solution vectors <i><b>h</b>&#40;t&#41;</i>. The mapping between them is smooth and invertible. This property is referred to as diffeomorphism and this kind of mapping is referred to as an embedding. Thus, the study of the time series <i>x&#40;t&#41;</i> is also the study of the solutions of the underlying dynamical system<i><b> h</b>&#40;t&#41;</i> via a particular coordinate system given by the observable <i>x</i>.</font></p>      <p><font face="Verdana" size="2">The embedding theorem establishes that, when there is only a single sampled quantity from a dynamical system, it is possible to reconstruct a state space that is equivalent to the original &#40;but unknown&#41; state space composed of all the dynamical variables [8]. In this work the embedding dimension <i>m</i> was chosen by using the false neighbors method and time&#45;delay &tau; by using the first minimum of the auto mutual information function [8]. For the case of pathological voices, it is known that if the laryngeal vibrations are stable, the energy in the system is constant and the orbits in the attractor are tightly wound. If laryngeal vibrations are unstable, the energy in the system can not be maintained at a constant level and trajectories will tend to deviate [12]. <a href="#Figura2">Figures 2</a> and<a href="#Figura3"> 3</a> show the attractors for a normal and a pathologic signal respectively extracted of the database [13].</font></p>      <p><font face="Verdana" size="2"><b>Stochastic modelling</b></font></p>     <p><font face="Verdana" size="2">The technique used at this stage was chosen on the basis of the modelling capabilities that it presents. The HMMs are stochastic models that allow the representation of time series. The use of hidden states makes the model generic enough to handle a variety of complex realworld time series, while the relatively simple prior dependence structure still allows the use of efficient computational procedures [14]. A HMM is a Markov chain whose outputs are random variables generated from probability functions associated to each state. Let <b>x</b> &#61; {<i>x<sub>0</sub>,&#8230;, x<sub>T</sub></i>} be an ordered multivariate sequence of length <i>T</i> and <i><b>q</b></i> &#61; {<i>q<sub>o</sub>,&#8230;, q<sub>T</sub></i>} a particular state sequence. A firstorder discrete HMM can be denoted by:</font></p>         <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i02.gif" ><a name="Eacuación1"></a></font></p>      <p><font face="Verdana" size="2">where<b> A</b> &#61; {<i>a<sub>ij</sub></i>} is the matrix of state transition probabilities in which <i>a<sub>ij</sub></i> &#61; <i>p &#40;q<sub>t</sub> &#61;  j&#124; q<sub>t&#45;1</sub> &#61; i&#41;</i>.</font></p>      <p><font face="Verdana" size="2"><b>B</b> &#61; { <sup>&#8230;</sup><sub>j</sub>&#40;<sup>.</sup>&#41;}, <i><sub>j</sub> &#40;<sub>t</sub>&#41;</i> &#61; &#40;<i><sub>t</sub> &#124; <sub>t</sub></i> &#61; &#41; is the emission matrix. The <i>x<sub>t</sub></i> takes values of a finite set of symbols <i><b>v &#61; {v<sub>1</sub>,&#8230;, v<sub>M</sub>}</b></i> called codebook, where <i>M</i> is the number of symbols. The models with this output structure are referred as discrete HMMs.&pi; is the column vector of initial state probabilities. The number of states of the model is denoted by <i>n<sub>q</sub></i>.</font></p>      <p><font face="Verdana" size="2">The parameters of the model were estimated in a standard procedure employing the maximum likelihood criterion by means of a Baum&#45;Welch algorithm.</font></p>      ]]></body>
<body><![CDATA[<p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i03.gif" ><a name="Figura2"></a></font></p>       <p><font face="Verdana" size="2"><b>Figure 2</b> Three&#45;dimensional phase portrait of the normal register AXH1NAL.wav of the database [13]</font></p>       <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i04.gif" ><a name="Figura3"></a></font></p>      <p><font face="Verdana" size="2"><b>Figure 3</b> Three&#45;dimensional phase portrait of the pathological register LB18AN.wav of the database [13]</font></p>     <p><font face="Verdana" size="2"><b>Kernel between HMMs</b></font></p>     <p><font face="Verdana" size="2">The similarity measure based on probability product kernel &#40;PPK&#41; used in this work was proposed in [11]. The Kernel function computes a generalized inner product between two probability distributions and allows integrating generative models as HMMs within a discriminative learning paradigm. The PPK between distributions <i>p</i> and <i>p</i>&rsquo; is defined as</font></p>       <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i05.gif" ><a name="Eacuación2"></a></font></p>      <p><font face="Verdana" size="2">where normally &rho; <img src="/img/revistas/rfiua/n50/n50a03i02.gif" > {1&#47; 2, 2,3,&#8230;}. For HMMs, the PPK is considered as the statistical average of similarities of all possible <i>co&#45;state</i> sequences drawn from the two HMMs [15]. Based on <a href="#Eacuación2">eq. &#40;2&#41;</a>, the PPK of two different emission matrices is given by [11]:</font></p>       <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i06.gif" ><a name="Eacuación3"></a></font></p>      <p><font face="Verdana" size="2">For HMM with discrete emissions, given the observations sequence <b>x</b> and the model &lambda;, the likelihood is [14]:</font></p>        ]]></body>
<body><![CDATA[<p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i07.gif" ><a name="Eacuación4"></a></font></p>     <p><font face="Verdana" size="2">When &rho; &#61; 1, the PPK of two HMMs with discrete emissions is given by</font></p>       <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i08.gif" ><a name="Eacuación5"></a></font></p>       <p><font face="Verdana" size="2">In this work the forward procedure described in [15] was used for the calculation of PPK, but the computing time for the induction step in such algorithm was decreased by using a Hadamard product into a matricial scheme &#40;see algorithm 1&#41;.</font></p>        <p><font face="Verdana" size="2">Algorithm 1: Probability product kernel for HMM</font></p>       <p><font face="Verdana" size="2"><i>Require:</i> &lambda;<sub>1</sub>, &lambda;<sub>2</sub> and <i>T</i> {<i>T</i> is the profile observation sequence}</font></p>       <p><font face="Verdana" size="2"><i>Initialization</i></font></p>        <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i09.gif" ></font></p>      <p><font face="Verdana" size="2"><i>Induction</i></font></p>      <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i10.gif" ></font></p>      ]]></body>
<body><![CDATA[<p><font face="Verdana" size="2"><i>Termination</i></font></p>      <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i11.gif" ></font></p>      <p><font face="Verdana" size="2"><i>Ensure: K<sub>&rho;</sub></i>  value.</font></p>       <p><font face="Verdana" size="2"><b>Dissimilarity&#45;based classification</b></font></p>      <p><font face="Verdana" size="2">In this step, suppose a set of <i>prototype objects:</i></font></p>       <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i12.gif" ><a name="Eacuación6"></a></font></p>      <p><font face="Verdana" size="2">Called the representation set, and suppose a dissimilarity measure <i>d</i> &#40;<sup>.</sup>, <sup>.</sup>&#41; , computed or derived from the objects. Such a dissimilarity measure must be nonnegative and obey the reflexivity condition, <i>d</i> &#40;x, x&#41; &#61; 0 , but it might be non&#45;metric.</font></p>       <p><font face="Verdana" size="2">An object <i>x</i> is represented as a vector of the dissimilarities computed between <i>x</i> and the prototypes from <b>R</b> :</font></p>     <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i13.gif" ><a name="Eacuación7"></a></font></p>       <p><font face="Verdana" size="2">Then, for a training set T of n objects, a classifiercan be built on the <i>n X r </i>dissimilarity matrix <i>D</i>&#40;<b>T ,R</b>&#41; relating all training objects to allprototypes [16].</font></p>       ]]></body>
<body><![CDATA[<p><font face="Verdana" size="2"><b>Prototype selection</b></font></p>      <p><font face="Verdana" size="2">There exists a number of ways to select the representation set <b>R</b>. One method that has achieved good results is <i>Linear Programming</i> &#40;LP&#41; [17]. In this method, the selection of prototypes is done automatically by training a properly formulated separating hyperplane:</font></p>     <p><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i14.gif" ><a name="Eacuación8"></a></font></p>        <p><font face="Verdana" size="2">In a dissimilarity space <i>D</i> &#40;<b>T ,R</b>&#41; . In this approach, a sparse solution w is obtained, which means that many weights <i>w<sub>j</sub></i> become zero. The objects from the initial set <b>R</b> &#40;<b>R &#61; T</b>, for instance&#41;, corresponding to nonzero weights are the selected prototypes, so the representation set <b>R<sub>LP</sub></b>.</font></p>       <p><font face="Verdana" size="2"><b>Classifier</b></font></p>      <p><font face="Verdana" size="2">In the classification stage a naive 1&#45;nearest neighbor classifier was used [18]. The classifier was designed to compute the ratio between the distances to the closest samples of each class. This measure is called score. The scores given by the detector stage for normal and pathological voices are used to plot the true and false score curves. The decision about presence or absence of pathology is taken by establishing a decision boundary that ensures the minimum classification error. In this work, it is used the threshold that corresponds to the minimum average error rate: the Minimum Cost Point &#40;MCP&#41; [18]. According to the Bayes decision theory, this point could be calculated by taking into account that the risk of the two possible errors &#40;false acceptance or false positive, and false rejection or false negative&#41; is different [18]. However, throughout this paper, it is considered that the risk corresponding to both errors is equal. When a threshold <i>H</i> is chosen, the samples with scores greater or equal to <i>H</i>, are labeled as class 1 &#40;by convention the pathological class&#41; whereas the samples with scores lower than <i>H</i> are labeled as class 2 &#40;normal&#41;.</font></p>       <p><font face="Verdana" size="3"><b>Experiments and results</b></font></p>      <p><font face="Verdana" size="2"><b>Corpus of speakers database</b></font></p>      <p><font face="Verdana" size="2">The used database was developed by The Massachusetts Eye and Ear Infirmary Voice Laboratory &#40;MEEIVL&#41; [13]. Due to the different sampling rates of the recordings stored in this database, a downsampling with a previous half band filtering was carried out, when needed, in order to adjust every utterance to a 25 kHz sampling rate. 16 <i>bits</i> of resolution were used for all the recordings. The registers contain the sustained phonation of the &#47;<i>ah</i>&#47; vowel from patients with a variety of voice pathologies: organic, neurological, and traumatic disorders. The registers were previously edited to remove the beginning and ending of each utterance, removing the onset and offset effects in these parts of each utterance. A subset of 173 registers of pathological and 53 normal speakers was selected according to those enumerated in [19]. The larger number of recordings belonging to the pathological set allows a better modeling of a class that has a larger inherent variability. This fact does not imply a slant of the system towards the pathological class, because typically, the dispersion in the feature space of the pathological voices is greater than in the normal class.</font></p>      <p><font face="Verdana" size="2"><b>Experimental setup</b></font></p>      ]]></body>
<body><![CDATA[<p><font face="Verdana" size="2">To assess the performance of the proposed approach, we performed tests in which we compare the behavior of the system changing the number of the states in the model in the grid {10,15, 20}, the size of the codebook in the grid {32,64,128, 256}. Additionally, due to the fact that embedding dimension &#40;ED&#41; changes in each voice signal, the size of the space to be modeled changes too. Due to this, there were established several criteria for choosing an ED for all signals that henceforth will be called <i>overall</i> embedding dimension &#40;OED&#41;. In a first try, was estimated OED as the average of the ED&rsquo;s for all voices, but in this case, the information used to reconstruct the attractor of the some registers is not enough. In the second scheme, the OED was established as the maximum ED present in the database, for insuring that in all embedding spaces the minimum dimension necessary is used. In the third scheme the OED was established as 30&#37; bigger than the maximum ED in order to have a high tolerance interval for new registers with more complex dynamics. For training the HMMs, the points of the attractor on the embedding space were grouped by means of the <i>k&#45;means</i> clustering algorithm into a set of 200 points. Next, the HMMs obtained from the attractors are used as prototypes to construct a dissimilarity space using a probability product kernel as similarity measure between two HMMs. The construction of dissimilarity spaces from HMM was proposed in [20], and it showed better classification results than conventional method using maximum a posteriori rule.</font></p>       <p><font face="Verdana" size="2">In order to design the dissimilarity based classifier, an initial representation set R of 158 signals &#40;121 pathologic and 37 normal, corresponding to 70&#37; of the samples of each class&#41; was extracted from the database. Then, the distances among all objects in the representation set were calculated by constructing the 158X158 dissimilarity matrix <i>D</i> &#40;<b>R,R</b>&#41;. The linear programming method described in section 2.4.1 was then applied over the dissimilarity space, obtaining a final representation set <b>R<sub>LP</sub></b> of r prototypes. The remaining objects in each case were returned to the training set <b>T</b> for the classification stage. Using the dissimilarity matrices <i>D</i> &#40;<b>T, R<sub>LP</sub></b>&#41;, a naive 1&#45;nearest neighbors classifier was trained and validated using the <i>leave one out</i> schema. In order to compare the performance of the proposed approach, a classification procedure employing conventional non linear statistics was realized. From each signal the Largest Lyapunov exponent &#40;LLE&#41; and the correlation dimension &#40;CD&#41; were estimated [8], and a algorithm for computing LLE was based on [12] and the algorithm for computing the CD was based on [21]. The results are presented by means of confusion matrices [5], giving the following rates: true positive rate &#40;<i>tp</i>&#41; &#40;also called <i>sensitivity</i>, is the ratio between pathological files correctly classified and the total number of pathological voices&#41;; false negative rate &#40;<i>fn</i>&#41; &#40;ratio between pathological files wrongly classified and the total number of pathological files&#41;; true negative rate &#40;<i>tn</i>&#41; &#40;also called <i>specificity</i>, is the ratio between normal files correctly classified and the total number of normal files&#41;; false positive rate &#40;<i>fp</i>&#41;, &#40;is the ratio between normal files wrongly classified and the total number of normal files&#41;. Thus <i>tp</i> + <i>fn</i> &#61;100&#37;, and <i>tn</i> + <i>fp</i> &#61; 100&#37;. The final accuracy of the system is the ratio between all the hits obtained by the system and the total number of files.</font></p>       <p><font face="Verdana" size="2">As a figure of merit the <i>Receiver Operating Characteristic</i> &#40;ROC&#41; curve may be plotted using the scores given by each classifier to show the performance of the proposed architecture. The ROC is a popular tool in medical decision&#45;making [5]. It reveals diagnostic accuracy expressed in terms of sensitivity and 1&#45;specificity or <i>fp</i>. In additions, in this work the <i>Area Under the ROC Curve</i> &#40;AUC&#41; was considered. The AUC is a single scalar representing an estimation of the expected performance of the system.</font></p>       <p><font face="Verdana" size="2">The<a href="#Tabla1"> tables 1</a>, <a href="#Tabla2">2</a> and <a href="#Tabla3">3</a>, show the accuracy obtained for the 1&#45;nearest neighbors rule in the dissimilarity space. Each table corresponds to different OEDs used for the reconstruction of the attractors.</font></p>       <p><font face="Verdana" size="2"><b>Table 1 </b>Accuracy for the 1&#45;nearest neighbor classifier for 5&#45;dimensional attractors</font></p>     <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i15.gif" ><a name="Tabla1"></a></font></p>        <p><font face="Verdana" size="2"><b>Table 2</b> Accuracy for the 1&#45;nearest neighbor classifier for 7&#45;dimensional attractors</font></p>      <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i16.gif" ><a name="Tabla2"></a></font></p>      <p><font face="Verdana" size="2"><b>Table 3</b> Accuracy for the 1&#45;nearest neighbor classifier for 10&#45;dimensional attractors</font></p>      <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i17.gif" ><a name="Tabla3"></a></font></p>      ]]></body>
<body><![CDATA[<p><font face="Verdana" size="2">From the <a href="#Tabla1">tables 1</a>, <a href="#Tabla2">2</a> and <a href="#Tabla3">3</a>, can be observed that the best performance is obtained for OED &#61; 10, which shows that the representation of voice signals was better in the embedding space of high dimension. Table 4 shows the matrix confusion for the best result obtained form the dissimilarity space.</font></p>      <p><font face="Verdana" size="2"><b>Table 4</b> Confusion matrix for the best result by using 1&#45;nearest neighbor classifier of dissimilarity space</font></p>      <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i18.gif" ><a name="Tabla4"></a></font></p>     <p><font face="Verdana" size="2">On the other hand, the number of selected prototypes was almost constant through the different experiments. However, it is important to notice that in all cases, the strategy used for prototype selection, did not exclude any normal sample. Figure 4 shows the feature space obtained from two nonlinear statistics over the database [13].</font></p>       <p><font face="Verdana" size="2">It can be observed that the pathological voices are more sparse distributed than the normal voices in the feature space. Also, it is clear that features used are not discriminant because both classes are overlapped. From the point of view of the nonlinear analysis, since many voice signals have a positive LLE, this fact implies that the trajectories in the embedding space diverge exponentially fast &#40;i.e. there is presence of chaos&#41; and many other are close of this behavior. <a href="#Tabla5">Table 5</a> shows some statistical moments for the nonlinear features of the<a href="#Figura4"> figure 4</a>.</font></p>      <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i19.gif" ><a name="Figura4"></a></font></p>     <p><font face="Verdana" size="2"><b>Figure 4</b> Feature space obtained from two nonlinear statistics: Largest Lyapunov exponent and Correlation dimension for the database [13]. The distributions of both classes in the feature space are highly overlapped</font></p>      <p><font face="Verdana" size="2"><a href="#Tabla6">Figure 5</a> shows ROC curves for the best accuracy for the two different schemes and their AUCs. It is clear that the performance of the system by using dissimilarities is much better than using conventional nonlinear statistics. However, the proposed approach attempts to improve the nonlinear behavior characterization of the speech signals and this one can be combined with schemes that employ acoustical and noise features &#40;systems using these measures have been employed with success [4;5]&#41; in order to obtain better results.</font></p>      <p><font face="Verdana" size="2"><a href="#Tabla6">Table 6</a> shows the confusion matrix obtained for the classification performed. It can be observed that the maximum accuracy with this method is 18.71&#37; lower than the maximum accuracy obtained from the dissimilarity based classification.</font></p>     <p><font face="Verdana" size="2"><b>Table 5 </b>Attributes of the nonlinear statistics</font></p>      ]]></body>
<body><![CDATA[<p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i20.gif" ><a name="Tabla5"></a></font></p>     <p><font face="Verdana" size="2"><b>Table 6</b> Confusion matrix for 1&#45;nearest neighbor classifier by using nonlinear features</font></p>      <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i21.gif" ><a name="Tabla6"></a></font></p>      <p align="center"><font face="Verdana" size="2"><img src="/img/revistas/rfiua/n50/n50a10i22.gif" ><a name="Figura5"></a></font></p>     <p><font face="Verdana" size="2"><b>Figure 5</b> ROC curve for the best accuracy obtained by using dissimilarity space and nonlinear features. The AUC for the dissimilarity space is 0.9845 and for the nonlinear statistics is 0.7150. The difference between both schemes is clear</font></p>      <p><font face="Verdana" size="3"><b>Conclusions</b></font></p>     <p><font face="Verdana" size="2">The proposed scheme for nonlinear analysis does not depend on the signal length, because for all samples the same number of points was taken into account for training the attractor model. The study shows that the time analysis of the nonlinear component from the signal, allows extracting more discriminant information to carry out an accurate detection of the presence of voice pathology. Although the HMMs used in this work are of first order, the methodology followed has shown its capability of modelling the representations of the voices in the embedding space. Increasing the order of the HMMs could improve the attractor modelling capabilities, but also increase the computational complexity, so it is necessary to explore the feasibility and limitations of using higher order models. The methodology presented in this work does not attempt to replace the more classical acoustic parameters&#45;based analysis, but proportionate a different alternative for the nonlinear analysis of voice signals, that can be used in conjunction with traditional methods. Additionally, the dissimilarity based classification scheme allows the comparison among different pathological voices with respect to some prototypes. This fact, opens the possibility of building dissimilarity spaces that could help identify grades of pathology &#40;levels of voice quality&#41;, by using the distance between a sample to the normal prototypes as rate of disease.</font></p>      <p><font face="Verdana" size="3"><b>Acknowledgements</b></font></p>     <p><font face="Verdana" size="2">This work was supported by: “Convocatoria de apoyo a doctorados nacionales del Instituto Colombiano para el Desarrollo de la Ciencia y la Tecnolog&iacute;a Francisco Jos&eacute; de Caldas, Colciencias 2007”, and TEC2006&#45;12887&#45;C02 by the Ministry of Science and Technology of Spain.</font></p>      <p><font face="Verdana" size="3"><b>References</b></font></p>     ]]></body>
<body><![CDATA[<!-- ref --><p><font face="Verdana" size="2">1. J. J. Jiang, Y. Zhang, C. McGilligan. “Chaos in voice, from modeling to measurement,” Journal of Voice. Vol. 20. 2006. pp. 2&#45;17.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000103&pid=S0120-6230200900040001000001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">2. Y. Zhang, J. Jiang, L. Biazzo, M. Jorgensen. “Perturbation and nonlinear dynamic analysis of voices from patients with laryngeal paralysis,” Journal of Voice. Vol. 19. 2004. pp. 519&#45;528.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000104&pid=S0120-6230200900040001000002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">3. Y. Zhang, C. McGilligan, L. Zhou, M. Vig, J. Jiang. “Nonlinear dynamic analysis of voices before and after surgical excision of vocal polyps.” Journal of the Acoustical Society of America. Vol. 115. 2008. pp. 2270&#45;2277.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000105&pid=S0120-6230200900040001000003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">4. J. I. Godino&#45;Llorente, P. G&oacute;mez&#45;Vilda, M. Blanco&#45; Velasco. “Dimensionality Reduction of a Pathological Voice Quality Assessment System Based on Gaussian Mixture Models and Short&#45;Term Cepstral Parameters”. IEEE Transactions on Biomedical Engineering. Vol. 53. 2006. pp. 1943&#45;1953.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000106&pid=S0120-6230200900040001000004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">5. N. S&aacute;enz&#45;Lech&oacute;n, J. I.Godino&#45;Llorente, V. Osma&#45; Ruiz, P. G&oacute;mez&#45;Vilda. “Methodological issues in the development of automatic systems for voice pathology detection”. Biomedical Signal Processing and Control. Vol.1. 2006. pp. 120&#45;128.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000107&pid=S0120-6230200900040001000005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">6. I. R. Titze, R. Baken, H. Herzel. “Evidence of chaos in vocal fold vibration”. Vocal Fold Physiology: New Frontiers in Basic Science. Singular Publishing Group. San Diego. CA. 1993. pp 143&#45;188.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000108&pid=S0120-6230200900040001000006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">7. M. A. Little. P. E. McSharry. S. J. Roberts, D. A. Costello, I. M. Moroz. “Exploiting nonlinear recurrence and fractal scaling properties for voice disorder detection”. Biomedical Engineering Online. Vol. 6. 2007. pp. 1&#45;35.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000109&pid=S0120-6230200900040001000007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">8. H. Kantz, T.Schreiber. Nonlinear time series analysis, 2<sup>a</sup> ed., Cambridge University Press. Cambridge. UK. 2003.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000110&pid=S0120-6230200900040001000008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">9. M. C. Scharry, “Detection of dynamical transitions in biomedical signals using nonlinear methods,” Proceedings of 8th International Conference KES, Lecture Notes in Computer Science. Ed. Springer. Wellington. New Zeland. Vol. 3215. 2004. pp. 483&#45; 490.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000111&pid=S0120-6230200900040001000009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">10. J. S. Richman, J. R. Moorman. “Physiological timeseries analysis using approximate entropy and sample entropy”. Am J Physiol HeartCirc Physiol. Vol. 278. 2000. pp. H2039&#45;H2049.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000112&pid=S0120-6230200900040001000010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">11. T. Jebara, R. Kondor, A. Howard. “Probabilistic product kernels”. Journal of Machine Learning Research. Vol. 5. 2004. pp. 819&#45;844.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000113&pid=S0120-6230200900040001000011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">12. A. Giovanni, M. Ouaknine, J. M. Triglia. “Determination of largest lyapunov exponents of vocal signal: Application to unilateral laryngeal paralysis”. Journal of Voice. Vol. 13. 1999. pp. 341&#45;454.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000114&pid=S0120-6230200900040001000012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">13. Massachusetts Eye and Ear Infirmary. Voice disorders database. version 1.03. [CD&#45;ROM]. 1994. Lincoln Park. N.J. Kay Elemetrics Corp. </font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000115&pid=S0120-6230200900040001000013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">14. O. Capp&eacute;, E. Moulines, T. Ryd&eacute;n. Inference in Hidden Markov Models. Ed. Springer. New York. 2005. pp. 1&#45;654.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000116&pid=S0120-6230200900040001000014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">15. L. Chen, H. Man. “Fast schemes for computing similarities between Gaussian HMMs and their applications in texture image classification,” EURASIP Journal on Applied Signal Processing. Vol. 13. 2005. pp. 1984&#45;1993.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000117&pid=S0120-6230200900040001000015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">16. E. Pekalska, R. Duin. “Dissimilarity representations allow for building good classifiers,” Pattern Recognition Letters. Vol. 23. 2002. pp 943&#45;956.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000118&pid=S0120-6230200900040001000016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">17. E. Pekalska, R. Duin, P. Plac&iacute;k. “Prototype selection for dissimilarity&#45;based classifiers” Pattern Recognition. Vol. 39. 2006. pp. 189&#45;208.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000119&pid=S0120-6230200900040001000017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">18. R.O. Duda, P. E.Hart, D. G. Stork. Pattern Classification. Ed. Jhon Wiley &amp; Sons.. New York. 2001. pp. 305&#45;307</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000120&pid=S0120-6230200900040001000018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">19. V. Parsa, D.Jamieson. “Identification of pathological voices using glottal noise measures.” Journal of Speech, Language and Hearing Research. Vol. 43. 2000. pp. 469&#45;485.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000121&pid=S0120-6230200900040001000019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">20. M. Bicego, V. Murino, M. Figueiredo, “Similaritybased classification of sequences using Hidden Markov Models”. Pattern Recognition. Vol 37. 2004. pp 2281&#45;2291.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000122&pid=S0120-6230200900040001000020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p><font face="Verdana" size="2">21. M. Small, Applied Nonlinear Time Series Analysis: Applications in Physics, Physiology and Finance. Ed. World Scientific. Singapore. 2005. pp. 1&#45;245.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000123&pid=S0120-6230200900040001000021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><p><font face="Verdana" size="2">&#40;Recibido el 27 de noviembre de 2008. Aceptado el 9 de mayo de 2009&#41;</font></p>     <p><font face="Verdana" size="2"><sup>*</sup>Autor de correspondencia: tel&eacute;fono: + 57 + 6 + 887 94 00 ext 55793, fax: + 57 + 6 + 887 94 00 ext. 55713, correo electr&oacute;nico: <a href="mailto:jdariasl@unal.edu.co">jdariasl@unal.edu.co</a> &#40;J. Arias&#41;</font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[J. J]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[McGilligan]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Chaos in voice, from modeling to measurement]]></article-title>
<source><![CDATA[Journal of Voice]]></source>
<year>2006</year>
<volume>20</volume>
<page-range>2-17</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Biazzo]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Jorgensen]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Perturbation and nonlinear dynamic analysis of voices from patients with laryngeal paralysis]]></article-title>
<source><![CDATA[Journal of Voice]]></source>
<year>2004</year>
<volume>19</volume>
<page-range>519-528</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[McGilligan]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Vig]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Nonlinear dynamic analysis of voices before and after surgical excision of vocal polyps]]></article-title>
<source><![CDATA[Journal of the Acoustical Society of America]]></source>
<year>2008</year>
<volume>115</volume>
<page-range>2270-2277</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Godino-Llorente]]></surname>
<given-names><![CDATA[J. I]]></given-names>
</name>
<name>
<surname><![CDATA[Gómez-Vilda]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Blanco- Velasco]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Dimensionality Reduction of a Pathological Voice Quality Assessment System Based on Gaussian Mixture Models and Short-Term Cepstral Parameters]]></article-title>
<source><![CDATA[IEEE Transactions on Biomedical Engineering]]></source>
<year>2006</year>
<volume>53</volume>
<page-range>1943-1953</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sáenz-Lechón]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Godino-Llorente]]></surname>
<given-names><![CDATA[J. I]]></given-names>
</name>
<name>
<surname><![CDATA[Osma- Ruiz]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Methodological issues in the development of automatic systems for voice pathology detection]]></article-title>
<source><![CDATA[Biomedical Signal Processing and Control]]></source>
<year>2006</year>
<volume>1</volume>
<page-range>120-128</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Titze]]></surname>
<given-names><![CDATA[I. R]]></given-names>
</name>
<name>
<surname><![CDATA[Baken]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Herzel]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<source><![CDATA[Evidence of chaos in vocal fold vibration: Vocal Fold Physiology]]></source>
<year>1993</year>
<page-range>143-188</page-range><publisher-loc><![CDATA[San Diego ]]></publisher-loc>
<publisher-name><![CDATA[Singular Publishing Group]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Little]]></surname>
<given-names><![CDATA[M. A]]></given-names>
</name>
<name>
<surname><![CDATA[McSharry]]></surname>
<given-names><![CDATA[P. E]]></given-names>
</name>
<name>
<surname><![CDATA[Roberts]]></surname>
<given-names><![CDATA[S. J]]></given-names>
</name>
<name>
<surname><![CDATA[Costello]]></surname>
<given-names><![CDATA[D. A]]></given-names>
</name>
<name>
<surname><![CDATA[Moroz]]></surname>
<given-names><![CDATA[I. M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Exploiting nonlinear recurrence and fractal scaling properties for voice disorder detection]]></article-title>
<source><![CDATA[Biomedical Engineering Online]]></source>
<year>2007</year>
<volume>6</volume>
<page-range>1-35</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kantz]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Schreiber]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonlinear time series analysis]]></source>
<year>2003</year>
<publisher-loc><![CDATA[2Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scharry]]></surname>
<given-names><![CDATA[M. C]]></given-names>
</name>
</person-group>
<source><![CDATA[Detection of dynamical transitions in biomedical signals using nonlinear methods]]></source>
<year>2004</year>
<volume>3215</volume>
<conf-name><![CDATA[8 International Conference KES]]></conf-name>
<conf-loc> </conf-loc>
<page-range>483- 490</page-range><publisher-loc><![CDATA[Wellington ]]></publisher-loc>
<publisher-name><![CDATA[Ed. Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Richman]]></surname>
<given-names><![CDATA[J. S]]></given-names>
</name>
<name>
<surname><![CDATA[Moorman]]></surname>
<given-names><![CDATA[J. R]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Physiological timeseries analysis using approximate entropy and sample entropy]]></article-title>
<source><![CDATA[Am J Physiol HeartCirc Physiol]]></source>
<year>2000</year>
<volume>278</volume>
<page-range>H2039-H2049</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jebara]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Kondor]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Howard]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Probabilistic product kernels]]></article-title>
<source><![CDATA[Journal of Machine Learning Research]]></source>
<year>2004</year>
<volume>5</volume>
<page-range>819-844</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Giovanni]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Ouaknine]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Triglia]]></surname>
<given-names><![CDATA[J. M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Determination of largest lyapunov exponents of vocal signal: Application to unilateral laryngeal paralysis]]></article-title>
<source><![CDATA[Journal of Voice]]></source>
<year>1999</year>
<volume>13</volume>
<page-range>341-454</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="">
<source><![CDATA[]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cappé]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Moulines]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Rydén]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<source><![CDATA[Inference in Hidden Markov Models]]></source>
<year>2005</year>
<page-range>1-654</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Ed. Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Man]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fast schemes for computing similarities between Gaussian HMMs and their applications in texture image classification]]></article-title>
<source><![CDATA[EURASIP Journal on Applied Signal Processing]]></source>
<year>2005</year>
<volume>13</volume>
<page-range>1984-1993</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pekalska]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Duin]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Dissimilarity representations allow for building good classifiers]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>2002</year>
<volume>23</volume>
<page-range>943-956</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pekalska]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Duin]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Placík]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Prototype selection for dissimilarity-based classifiers]]></article-title>
<source><![CDATA[Pattern Recognition]]></source>
<year>2006</year>
<volume>39</volume>
<page-range>189-208</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duda]]></surname>
<given-names><![CDATA[R.O]]></given-names>
</name>
<name>
<surname><![CDATA[Hart]]></surname>
<given-names><![CDATA[P. E]]></given-names>
</name>
<name>
<surname><![CDATA[Stork]]></surname>
<given-names><![CDATA[D. G]]></given-names>
</name>
</person-group>
<source><![CDATA[Pattern Classification]]></source>
<year>2001</year>
<page-range>305-307</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Ed. Jhon Wiley & Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Parsa]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Jamieson]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Identification of pathological voices using glottal noise measures]]></article-title>
<source><![CDATA[Journal of Speech, Language and Hearing Research]]></source>
<year>2000</year>
<volume>43</volume>
<page-range>469-485</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bicego]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Murino]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Figueiredo]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Similaritybased classification of sequences using Hidden Markov Models]]></article-title>
<source><![CDATA[Pattern Recognition]]></source>
<year>2004</year>
<volume>37</volume>
<page-range>2281-2291</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Small]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Applied Nonlinear Time Series Analysis: Applications in Physics, Physiology and Finance]]></source>
<year>2005</year>
<page-range>1-245</page-range><publisher-loc><![CDATA[Singapore ]]></publisher-loc>
<publisher-name><![CDATA[Ed. World Scientific]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
