<?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-28T19:03:01Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/32023" metadataPrefix="rdf">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/32023</identifier><datestamp>2025-01-22T13:24:29Z</datestamp><setSpec>com_10324_1151</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_1278</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/32023">
<dc:title>Finding the number of normal groups in model-based clustering via constrained likelihoods</dc:title>
<dc:creator>Cerioli, Andrea</dc:creator>
<dc:creator>García Escudero, Luis Ángel</dc:creator>
<dc:creator>Mayo Iscar, Agustín</dc:creator>
<dc:creator>Riani, Marco</dc:creator>
<dc:description>Producción Científica</dc:description>
<dc:description>Deciding the number of clusters k is one of the most difficult problems in clus-&#xd;
ter analysis. For this purpose, complexity-penalized likelihood approaches have been&#xd;
introduced in model-based clustering, such as the well known BIC and ICL crite-&#xd;
ria. However, the classi cation/mixture likelihoods considered in these approaches&#xd;
are unbounded without any constraint on the cluster scatter matrices. Constraints&#xd;
also prevent traditional EM and CEM algorithms from being trapped in (spurious)&#xd;
local maxima. Controlling the maximal ratio between the eigenvalues of the scatter&#xd;
matrices to be smaller than a  xed constant c   1 is a sensible idea for setting such&#xd;
constraints. A new penalized likelihood criterion which takes into account the higher&#xd;
model complexity that a higher value of c entails, is proposed. Based on this criterion,&#xd;
a novel and fully automated procedure, leading to a small ranked list of optimal (k; c)&#xd;
couples is provided. A new plot called \car-bike" which provides a concise summary&#xd;
of the solutions is introduced. The performance of the procedure is assessed both in&#xd;
empirical examples and through a simulation study as a function of cluster overlap.&#xd;
Supplemental materials for the article are available online.</dc:description>
<dc:date>2018-10-05T21:57:07Z</dc:date>
<dc:date>2018-10-05T21:57:07Z</dc:date>
<dc:date>2018</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>Journal of Computational and Graphical Statistics, 2016, vol. 27, p. 404-416</dc:identifier>
<dc:identifier>1061-8600</dc:identifier>
<dc:identifier>http://uvadoc.uva.es/handle/10324/32023</dc:identifier>
<dc:identifier>10.1080/10618600.2017.1390469</dc:identifier>
<dc:identifier>1537-2715</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>https://www.tandfonline.com/doi/full/10.1080/10618600.2017.1390469</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>https://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
<dc:rights>© 2018 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America</dc:rights>
<dc:rights>Atribución-NoComercial-SinDerivados 4.0 Internacional</dc:rights>
<dc:publisher>Taylor &amp; Francis</dc:publisher>
<dc:peerreviewed>SI</dc:peerreviewed>
</ow:Publication>
</rdf:RDF></metadata></record></GetRecord></OAI-PMH>