<?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-22T05:42:08Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/50994" metadataPrefix="mods">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/50994</identifier><datestamp>2022-01-17T10:16:54Z</datestamp><setSpec>com_10324_32197</setSpec><setSpec>com_10324_952</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_32199</setSpec></header><metadata><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:namePart>García Escudero, Luis Ángel</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Mayo Iscar, Agustín</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Riani, Marco</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2021-12-20T10:58:44Z</mods:dateAvailable>
</mods:extension>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2021-12-20T10:58:44Z</mods:dateAccessioned>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2021</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">Statistics and Computing, 2021, vol. 32, n. 1.</mods:identifier>
<mods:identifier type="issn">0960-3174</mods:identifier>
<mods:identifier type="uri">https://uvadoc.uva.es/handle/10324/50994</mods:identifier>
<mods:identifier type="doi">10.1007/s11222-021-10061-3</mods:identifier>
<mods:identifier type="publicationissue">1</mods:identifier>
<mods:identifier type="publicationtitle">Statistics and Computing</mods:identifier>
<mods:identifier type="publicationvolume">32</mods:identifier>
<mods:identifier type="essn">1573-1375</mods:identifier>
<mods:abstract>A new methodology for constrained parsimonious model-based clustering is introduced, where some tuning parameter allows to control the strength of these constraints. The methodology includes the 14 parsimonious models that are often applied in model-based clustering when assuming normal components as limit cases. This is done in a natural way by filling the gap among models and providing a smooth transition among them. The methodology provides mathematically well-defined problems and is also useful to prevent us from obtaining spurious solutions. Novel information criteria are proposed to help the user in choosing parameters. The interest of the proposed methodology is illustrated through simulation studies and a real-data application on COVID data.</mods:abstract>
<mods:language>
<mods:languageTerm>eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">info:eu-repo/semantics/openAccess</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">http://creativecommons.org/licenses/by/4.0/</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">© 2021 The Authors</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">Atribución 4.0 Internacional</mods:accessCondition>
<mods:titleInfo>
<mods:title>Constrained parsimonious model-based clustering</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/article</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>