<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-23T21:21:16Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/5966" metadataPrefix="rdf">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/5966</identifier><datestamp>2021-06-23T10:11:08Z</datestamp><setSpec>com_10324_1151</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_1936</setSpec></header><metadata><rdf:RDF xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication rdf:about="oai:uvadoc.uva.es:10324/5966">
<dc:title>Avoiding Spurious Local Maximizers in Mixture Modeling</dc:title>
<dc:creator>García Escudero, Luis Ángel</dc:creator>
<dc:creator>Gordaliza Ramos, Alfonso</dc:creator>
<dc:creator>Matrán Bea, Carlos</dc:creator>
<dc:creator>Mayo Iscar, Agustín</dc:creator>
<dc:contributor>Universidad de Valladolid</dc:contributor>
<dc:subject>Statistics</dc:subject>
<dc:description>Producción Científica</dc:description>
<dc:description>The maximum likelihood estimation in the finite mixture of distributions setting is&#xd;
an ill-posed problem that is treatable, in practice, through the EM algorithm. However,&#xd;
the existence of spurious solutions (singularities and non-interesting local maximizers)&#xd;
makes difficult to find sensible mixture fits for non-expert practitioners. In this work, a&#xd;
constrained mixture fitting approach is presented with the aim of overcoming the troubles&#xd;
introduced by spurious solutions. Sound mathematical support is provided and,&#xd;
which is more relevant in practice, a feasible algorithm is also given. This algorithm&#xd;
allows for monitoring solutions in terms of the constant involved in the restrictions,&#xd;
which yields a natural way to discard spurious solutions and a valuable tool for data&#xd;
analysts.</dc:description>
<dc:date>2014-09-15T20:07:44Z</dc:date>
<dc:date>2014-09-15T20:07:44Z</dc:date>
<dc:date>2014</dc:date>
<dc:type>info:eu-repo/semantics/preprint</dc:type>
<dc:identifier>http://uvadoc.uva.es/handle/10324/5966</dc:identifier>
<dc:language>spa</dc:language>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
<dc:rights>Attribution 4.0 International</dc:rights>
</ow:Publication>
</rdf:RDF></metadata></record></GetRecord></OAI-PMH>