<?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:29:49Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/72365" metadataPrefix="etdms">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><thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.0/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>Clustering alternatives in preference-approvals via novel pseudometrics</title>
<creator>Albano, Alessandro</creator>
<creator>García Lapresta, José Luis</creator>
<creator>Plaia, Antonella</creator>
<creator>Sciandra, Mariangela</creator>
<description>Producción Científica</description>
<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.</description>
<date>2024-12-11</date>
<date>2024-12-11</date>
<date>2023</date>
<type>info:eu-repo/semantics/article</type>
<identifier>Statistical Methods &amp; Applications, 2024, vol. 33, n. 1, pp. 61-87</identifier>
<identifier>1618-2510</identifier>
<identifier>https://uvadoc.uva.es/handle/10324/72365</identifier>
<identifier>10.1007/s10260-023-00718-w</identifier>
<identifier>61</identifier>
<identifier>1</identifier>
<identifier>87</identifier>
<identifier>Statistical Methods &amp; Applications</identifier>
<identifier>33</identifier>
<identifier>1613-981X</identifier>
<language>eng</language>
<relation>https://link.springer.com/article/10.1007/s10260-023-00718-w</relation>
<rights>info:eu-repo/semantics/openAccess</rights>
<rights>http://creativecommons.org/licenses/by/4.0/</rights>
<rights>© 2023, The Author(s)</rights>
<rights>Atribución 4.0 Internacional</rights>
<publisher>Springer</publisher>
</thesis></metadata></record></GetRecord></OAI-PMH>