Clustering alternatives in preference-approvals via novel pseudometrics
Open Access
- 29 August 2023
- journal article
- research article
- Published by Springer Nature in Statistical Methods & Applications
- Vol. 33 (1) , 61-87
Abstract
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 Rankedk-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.Keywords
Funding Information
- Agencia Estatal de Investigación (PID2021-122506NB-I0)
- Università degli Studi di Palermo
This publication has 25 references indexed in Scilit:
- Measuring consensus in a preference-approval contextInformation Fusion, 2014
- Clustering and Prediction of Rankings Within a Kemeny Distance Framework2013
- Ranked k-medoids: A fast and accurate rank-based partitioning algorithm for clustering large datasetsKnowledge-Based Systems, 2013
- Measuring Consensus in Weak Orders2011
- Mathematics and democracy: Designing better voting and fair-division proceduresMathematical and Computer Modelling, 2008
- Data clusteringACM Computing Surveys, 1999
- The number of weak orderings of a finite setSocial Choice and Welfare, 1998
- Partial justification of the Borda countPublic Choice, 1976
- Aggregation of Preferences with Variable ElectorateEconometrica, 1973
- Nonmetric Multidimensional Scaling: A Numerical MethodPsychometrika, 1964