<?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-27T13:47:13Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/72365" metadataPrefix="rdf">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/72365</identifier><datestamp>2024-12-11T20:04:19Z</datestamp><setSpec>com_10324_1146</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_1262</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/72365">
<dc:title>Clustering alternatives in preference-approvals via novel pseudometrics</dc:title>
<dc:creator>Albano, Alessandro</dc:creator>
<dc:creator>García Lapresta, José Luis</dc:creator>
<dc:creator>Plaia, Antonella</dc:creator>
<dc:creator>Sciandra, Mariangela</dc:creator>
<dc:description>Producción Científica</dc:description>
<dc:description>Preference-approval structures combine preference rankings and approval voting for declaring opinions over a set of alternatives. In this paper, we propose a new procedure for clustering alternatives in order to reduce the complexity of the preference-approval space and provide a more accessible interpretation of data. To that end, we present a new family of pseudometrics on the set of alternatives that take into account voters’ preferences via preference-approvals. To obtain clusters, we use the Ranked k-medoids (RKM) partitioning algorithm, which takes as input the similarities between pairs of alternatives based on the proposed pseudometrics. Finally, using non-metric multidimensional scaling, clusters are represented in 2-dimensional space.</dc:description>
<dc:date>2024-12-11T10:04:08Z</dc:date>
<dc:date>2024-12-11T10:04:08Z</dc:date>
<dc:date>2023</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>Statistical Methods &amp; Applications, 2024, vol. 33, n. 1, pp. 61-87</dc:identifier>
<dc:identifier>1618-2510</dc:identifier>
<dc:identifier>https://uvadoc.uva.es/handle/10324/72365</dc:identifier>
<dc:identifier>10.1007/s10260-023-00718-w</dc:identifier>
<dc:identifier>61</dc:identifier>
<dc:identifier>1</dc:identifier>
<dc:identifier>87</dc:identifier>
<dc:identifier>Statistical Methods &amp; Applications</dc:identifier>
<dc:identifier>33</dc:identifier>
<dc:identifier>1613-981X</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>https://link.springer.com/article/10.1007/s10260-023-00718-w</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
<dc:rights>© 2023, The Author(s)</dc:rights>
<dc:rights>Atribución 4.0 Internacional</dc:rights>
<dc:publisher>Springer</dc:publisher>
<dc:peerreviewed>SI</dc:peerreviewed>
</ow:Publication>
</rdf:RDF></metadata></record></GetRecord></OAI-PMH>