{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:45:47Z","timestamp":1782485147910,"version":"3.54.5"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:00:00Z","timestamp":1739750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:00:00Z","timestamp":1739750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100013003","name":"Universit\u00e0 degli Studi di Cagliari","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100013003","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Preference learning, or the analysis of preference rankings, is gaining more and more importance in various scientific disciplines. Preference learning methods allow predicting preferences on a set of alternatives. The ingredients are a pool of evaluators and a set of objects or items to be ranked in order of preference. The rank aggregation problem must be solved in order to aggregate preferences or rankings with the aim to find a consensus or collective decision. Branch-and-bound-like procedures are usable up to problems involving a relatively small number of objects, say less than 200. When the number of items becomes very large, the rank aggregation problem becomes increasingly difficult to approach so that it is universally recognized as an NP-hard problem. Several heuristic methods have been proposed to provide increasingly accurate solutions. These assume the Kemeny axiomatic approach that better deals with tied rankings. In this paper, we adopt a strategy based on Particle Swarm Optimization by adapting procedures born to solve optimization problems in continuous spaces to discrete combinatorial optimization problems. A simulation study shows the performance of the proposed algorithm in a controlled environment. A benchmarking complex data set and two real world data sets with large number of items are considered. As a result, the proposed algorithm provides significant savings in computational time and comparable accuracy with respect to other recent algorithms.<\/jats:p>","DOI":"10.1007\/s11634-025-00626-9","type":"journal-article","created":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T19:19:59Z","timestamp":1739819999000},"page":"551-575","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Particle swarm optimization for preference rankings"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8947-2220","authenticated-orcid":false,"given":"Maurizio","family":"Romano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudio","family":"Conversano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberta","family":"Siciliano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"D\u2019Ambrosio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"626_CR1","doi-asserted-by":"crossref","unstructured":"Acampora G, Iorio C, Pandolfo G, Siciliano R, Vitiello A (2021) A memetic algorithm for solving the rank aggregation problem. Algorithms as a Basis of Modern Applied Mathematics, 447\u2013460","DOI":"10.1007\/978-3-030-61334-1_23"},{"key":"626_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106164","volume":"153","author":"S Akbari","year":"2023","unstructured":"Akbari S, Escobedo AR (2023) Approximate condorcet partitioning: Solving large-scale rank aggregation problems. Comput Oper Res 153:106164","journal-title":"Comput Oper Res"},{"key":"626_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102893","volume":"119","author":"S Akbari","year":"2023","unstructured":"Akbari S, Escobedo AR (2023) Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties. Omega 119:102893","journal-title":"Omega"},{"key":"626_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2014.02.001","volume":"17","author":"S Alam","year":"2014","unstructured":"Alam S, Dobbie G, Koh YS, Riddle P, Ur Rehman S (2014) Research on particle swarm optimization based clustering: A systematic review of literature and techniques. Swarm Evol Comput 17:1\u201313. https:\/\/doi.org\/10.1016\/j.swevo.2014.02.001","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"626_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1285\/i20705948v14n1p117","volume":"14","author":"A Albano","year":"2021","unstructured":"Albano A, Plaia A (2021) Element weighted Kemeny distance for ranking data. Electron J Appl Stat Anal 14(1):117\u2013145. https:\/\/doi.org\/10.1285\/i20705948v14n1p117","journal-title":"Electron J Appl Stat Anal"},{"key":"626_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dss.2017.03.006","volume":"97","author":"JA Aledo","year":"2017","unstructured":"Aledo JA, G\u00e1mez JA, Rosete A (2017) Utopia in the solution of the bucket order problem. Decis Support Syst 97:69\u201380","journal-title":"Decis Support Syst"},{"issue":"3","key":"626_CR7","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1016\/j.ejor.2018.04.031","volume":"270","author":"JA Aledo","year":"2018","unstructured":"Aledo JA, G\u00e1mez JA, Rosete A (2018) Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem. Eur J Oper Res 270(3):982\u2013998","journal-title":"Eur J Oper Res"},{"key":"626_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2021.04.034","volume":"570","author":"JA Aledo","year":"2021","unstructured":"Aledo JA, G\u00e1mez JA, Rosete A (2021) A highly scalable algorithm for weak rankings aggregation. Inf Sci 570:144\u2013171","journal-title":"Inf Sci"},{"key":"626_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1471-5","volume-title":"Statistical methods for ranking data","author":"M Alvo","year":"2014","unstructured":"Alvo M, Yu PL (2014) Statistical methods for ranking data, vol (1341). Springer, NP"},{"issue":"2","key":"626_CR10","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.ejor.2015.08.048","volume":"249","author":"S Amodio","year":"2016","unstructured":"Amodio S, D\u2019Ambrosio A, Siciliano R (2016) Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the kemeny axiomatic approach. Eur J Oper Res 249(2):667\u2013676","journal-title":"Eur J Oper Res"},{"key":"626_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.cor.2018.06.007","volume":"98","author":"PS Badal","year":"2018","unstructured":"Badal PS, Das A (2018) Efficient algorithms using subiterative convergence for kemeny ranking problem. Comput Oper Res 98:198\u2013210","journal-title":"Comput Oper Res"},{"issue":"1","key":"626_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11047-007-9050-z","volume":"7","author":"A Banks","year":"2008","unstructured":"Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. part ii: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7(1):109\u2013124","journal-title":"Nat Comput"},{"key":"626_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.csda.2012.08.008","volume":"58","author":"C Biernacki","year":"2013","unstructured":"Biernacki C, Jacques J (2013) A generative model for rank data based on insertion sort algorithm. Comput Stat Data Anal 58:162\u2013176","journal-title":"Comput Stat Data Anal"},{"issue":"7","key":"626_CR14","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1016\/j.neucom.2009.11.025","volume":"73","author":"A Birlutiu","year":"2010","unstructured":"Birlutiu A, Groot P, Heskes T (2010) Multi-task preference learning with an application to hearing aid personalization. Neurocomputing 73(7):1177\u20131185. https:\/\/doi.org\/10.1016\/j.neucom.2009.11.025","journal-title":"Neurocomputing"},{"key":"626_CR15","unstructured":"Boehmer N, Schaar N (2022) Collecting, classifying, analyzing, and using realworld elections. arXiv preprint arXiv:2204.03589"},{"issue":"4","key":"626_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00182575","volume":"9","author":"W Bossert","year":"1992","unstructured":"Bossert W, Storcken T (1992) Strategy-proofness of social welfare functions: the use of the kemeny distance between preference orderings. Soc Choice Welfare 9(4):345\u2013360","journal-title":"Soc Choice Welfare"},{"key":"626_CR17","unstructured":"Claus B (2022) pso: Particle swarm optimization [Computer software manual]. Retrieved from https:\/\/CRAN.R-project.org\/package=pso (R package version 1.0.4)"},{"issue":"4","key":"626_CR18","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.cor.2005.05.030","volume":"34","author":"WD Cook","year":"2007","unstructured":"Cook WD, Golany B, Penn M, Raviv T (2007) Creating a consensus ranking of proposals from reviewers\u2019 partial ordinal rankings. Comput Oper Res 34(4):954\u2013965","journal-title":"Comput Oper Res"},{"issue":"11","key":"626_CR19","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1287\/mnsc.36.11.1302","volume":"36","author":"WD Cook","year":"1990","unstructured":"Cook WD, Kress M (1990) A data envelopment model for aggregating preference rankings. Manag Sci 36(11):1302\u20131310","journal-title":"Manag Sci"},{"issue":"2","key":"626_CR20","first-page":"115","volume":"20","author":"WD Cook","year":"1986","unstructured":"Cook WD, Kress M, Seiford LM (1986) An axiomatic approach to distance on partial orderings. Revue fran\u00e7aise d\u2019automatique, d\u2019informatique et de recherche op\u00e9rationnelle. Recherche op\u00e9rationnelle 20(2):115\u2013122","journal-title":"Revue fran\u00e7aise d\u2019automatique, d\u2019informatique et de recherche op\u00e9rationnelle. Recherche op\u00e9rationnelle"},{"issue":"3","key":"626_CR21","first-page":"337","volume":"18","author":"WD Cook","year":"1976","unstructured":"Cook WD, Saipe A (1976) Committee approach to priority planning: the median ranking method. Cahiers Centre \u00e9tudes Rech Op\u00e9r 18(3):337\u2013351","journal-title":"Cahiers Centre \u00e9tudes Rech Op\u00e9r"},{"issue":"1","key":"626_CR22","first-page":"1","volume":"1","author":"M Crispino","year":"2022","unstructured":"Crispino M, Antoniano-Villalobos I (2022) Informative priors for the consensus ranking in the bayesian mallows model. Bayesian Anal 1(1):1\u201324","journal-title":"Bayesian Anal"},{"issue":"1","key":"626_CR23","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejor.2020.03.008","volume":"286","author":"L Csat\u00f3","year":"2020","unstructured":"Csat\u00f3 L, T\u00f3th C (2020) University rankings from the revealed preferences of the applicants. Eur J Oper Res 286(1):309\u2013320","journal-title":"Eur J Oper Res"},{"key":"626_CR24","unstructured":"D\u2019Ambrosio A (2023) ConsRank: Compute the median ranking(s) according to the Kemeny\u2019s axiomatic approach [Computer software manual]. Retrieved from https:\/\/CRAN.R-project.org\/package=ConsRank (R package version 2.1.4)"},{"issue":"2","key":"626_CR25","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ejor.2015.08.048","volume":"8","author":"A D\u2019Ambrosio","year":"2015","unstructured":"D\u2019Ambrosio A, Amodio S, Iorio C (2015) Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings. Electr J Appl Stat Anal 8(2):198\u2013213. https:\/\/doi.org\/10.1016\/j.ejor.2015.08.048","journal-title":"Electr J Appl Stat Anal"},{"issue":"3","key":"626_CR26","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s11336-016-9505-1","volume":"81","author":"A D\u2019Ambrosio","year":"2016","unstructured":"D\u2019Ambrosio A, Heiser WJ (2016) A recursive partitioning method for the prediction of preference rankings based upon kemeny distances. Psychometrika 81(3):774\u2013794","journal-title":"Psychometrika"},{"issue":"2","key":"626_CR27","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s41237-018-0069-5","volume":"46","author":"A D\u2019Ambrosio","year":"2019","unstructured":"D\u2019Ambrosio A, Heiser WJ (2019) A distribution-free soft-clustering method for preference rankings. Behaviormetrika 46(2):333\u2013351","journal-title":"Behaviormetrika"},{"key":"626_CR28","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00180-018-0858-z","volume":"34","author":"A D\u2019Ambrosio","year":"2019","unstructured":"D\u2019Ambrosio A, Iorio C, Staiano M, Siciliano R (2019) Median constrained bucket order rank aggregation. Comput Stat 34:787\u2013802","journal-title":"Comput Stat"},{"key":"626_CR29","unstructured":"de Borda JC (1781) M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l\u2019Academie Royale des Sciences"},{"key":"626_CR30","unstructured":"de Condorcet M (1785) Essai sur l\u2019application de l\u2019analyse a la probabilite des decisions rendues a la pluralite des voix (essay on the application of analysis to the probability of majority decisions)"},{"key":"626_CR31","doi-asserted-by":"crossref","unstructured":"Diaconis P (1988) Group representations in probability and statistics. Lecture Notes-Monograph Series, 11 , i\u2013192, Retrieved 2024-09-10, from http:\/\/www.jstor.org\/stable\/4355560","DOI":"10.1214\/lnms\/1215467407"},{"key":"626_CR32","doi-asserted-by":"crossref","unstructured":"Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. In: Proceedings of the 10th international conference on world wide web (pp. 613\u2013622)","DOI":"10.1145\/371920.372165"},{"key":"626_CR33","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.cor.2017.01.017","volume":"82","author":"A D\u2019Ambrosio","year":"2017","unstructured":"D\u2019Ambrosio A, Mazzeo G, Iorio C, Siciliano R (2017) A differential evolution algorithm for finding the median ranking under the kemeny axiomatic approach. Comput Oper Res 82:126\u2013138","journal-title":"Comput Oper Res"},{"key":"626_CR34","unstructured":"Emond EJ, Mason DW (2000) A new technique for high level decision support (Tech. Rep.). Ottawa, Canada: Department of National Defence, Operational Research Division"},{"issue":"1","key":"626_CR35","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/mcda.313","volume":"11","author":"EJ Emond","year":"2002","unstructured":"Emond EJ, Mason DW (2002) A new rank correlation coefficient with application to the consensus ranking problem. J Multi-Criteria Decis Anal 11(1):17\u201328","journal-title":"J Multi-Criteria Decis Anal"},{"key":"626_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14125-6","volume-title":"Preference learning","author":"J F\u00fcrnkranz","year":"2011","unstructured":"F\u00fcrnkranz J, H\u00fcllermeier E (2011) Preference learning: An introduction. In: F\u00fcrnkranz J, H\u00fcllermeier E (eds) Preference learning. Springer, Berlin Heidelberg, pp 1\u201317"},{"issue":"5","key":"626_CR37","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1007\/s11831-021-09694-4","volume":"29","author":"AG Gad","year":"2022","unstructured":"Gad AG (2022) Particle swarm optimization algorithm and its applications: a systematic review. Arch Comput Methods Eng 29(5):2531\u20132561. https:\/\/doi.org\/10.1007\/s11831-021-09694-4","journal-title":"Arch Comput Methods Eng"},{"key":"626_CR38","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1080\/00150517.1975.12430678","volume":"13","author":"I Good","year":"1975","unstructured":"Good I (1975) The number of orderings of n candidates when ties are permitted. Fibonacci Quarterly 13:11\u201318","journal-title":"Fibonacci Quarterly"},{"key":"626_CR39","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10994-013-5374-3","volume":"93","author":"M Grbovic","year":"2013","unstructured":"Grbovic M, Djuric N, Guo S, Vucetic S (2013) Supervised clustering of label ranking data using label preference information. Mach Learn 93:191\u2013225","journal-title":"Mach Learn"},{"key":"626_CR40","doi-asserted-by":"crossref","unstructured":"Heiser WJ, D\u2019Ambrosio A (2013) Clustering and prediction of rankings within a kemeny distance framework. B. Lausen, D. Van den Poel, & A. Ultsch (Eds.), Algorithms from and for nature and life (pp. 19\u201331). Cham: Springer International Publishing","DOI":"10.1007\/978-3-319-00035-0_2"},{"key":"626_CR41","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.proeng.2013.02.063","volume":"53","author":"M Imran","year":"2013","unstructured":"Imran M, Hashim R, Khalid NEA (2013) An overview of particle swarm optimization variants. Proc Eng 53:491\u2013496. https:\/\/doi.org\/10.1016\/j.proeng.2013.02.063","journal-title":"Proc Eng"},{"issue":"12","key":"626_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v071.i12","volume":"71","author":"E Irurozki","year":"2016","unstructured":"Irurozki E, Calvo B, Lozano JA (2016) PerMallows: An R package for mallows and generalized mallows models. J Stat Softw 71(12):1\u201330. https:\/\/doi.org\/10.18637\/jss.v071.i12","journal-title":"J Stat Softw"},{"key":"626_CR43","unstructured":"Kaufman L, Rousseeuw PJ (2008) Partitioning Around Medoids (Program PAM). Finding Groups in Data (pp. 68\u2013125). John Wiley & Sons, Inc"},{"key":"626_CR44","unstructured":"Kemeny J, Snell J (1962) Preference rankings: An axiomatic approach. J. Kemeny & J. Snell (Eds.), Mathematical models in the social sciences (p. 9-23). New York: Blaisdell"},{"issue":"1\/2","key":"626_CR45","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\/2):81\u201393","journal-title":"Biometrika"},{"key":"626_CR46","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. Proceedings of icnn\u201995 - international conference on neural networks (Vol. 4, p. 1942-1948)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"6","key":"626_CR47","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.csda.2010.01.027","volume":"54","author":"PH Lee","year":"2010","unstructured":"Lee PH, Yu P (2010) Distance-based tree models for ranking data. Comput Stat Data Anal 54(6):1672\u20131682","journal-title":"Comput Stat Data Anal"},{"key":"626_CR48","unstructured":"Maechler M, Rousseeuw P, Struyf A, Hubert M, Hornik K (2023) cluster: Cluster analysis basics and extensions [Computer software manual]. Retrieved from https:\/\/CRAN.R-project.org\/package=cluster (R package version 2.1.6 \u2013 For new features, see the \u2019NEWS\u2019 and the \u2019Changelog\u2019 file in the package source))"},{"key":"626_CR49","unstructured":"Mandhani B, Meila M (2009, 16\u201318 Apr). Tractable search for learning exponential models of rankings. D. van Dyk & M. Welling (Eds.), Proceedings of the twelfth international conference on artificial intelligence and statistics (Vol. 5, pp. 392\u2013399). Hilton Clearwater Beach Resort, Clearwater Beach, Florida USA: PMLR"},{"key":"626_CR50","volume-title":"Analyzing and modeling rank data","author":"JI Marden","year":"1996","unstructured":"Marden JI (1996) Analyzing and modeling rank data. Chapman & Hall, London"},{"key":"626_CR51","doi-asserted-by":"crossref","unstructured":"Mattei N, Walsh T (2013) Preflib: A library of preference data http:\/\/preflib.org. In: Proceedings of the 3rd international conference on algorithmic decision theory (adt 2013). Springer","DOI":"10.1007\/978-3-642-41575-3_20"},{"issue":"1","key":"626_CR52","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1186\/1471-2105-7-125","volume":"7","author":"M Meissner","year":"2006","unstructured":"Meissner M, Schmuker M, Schneider G (2006) Optimized particle swarm optimization (opso) and its application to artificial neural network training. BMC Bioinform 7(1):125. https:\/\/doi.org\/10.1186\/1471-2105-7-125","journal-title":"BMC Bioinform"},{"issue":"2","key":"626_CR53","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s11336-016-9530-0","volume":"82","author":"C Mollica","year":"2017","unstructured":"Mollica C, Tardella L (2017) Bayesian plackett-luce mixture models for partially ranked data. Psychometrika 82(2):442\u2013458","journal-title":"Psychometrika"},{"issue":"6","key":"626_CR54","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1080\/02664763.2017.1339025","volume":"45","author":"D M\u00fcllensiefen","year":"2018","unstructured":"M\u00fcllensiefen D, Hennig C, Howells H (2018) Using clustering of rankings to explain brand preferences with personality and socio-demographic variables. J Appl Stat 45(6):1009\u20131029","journal-title":"J Appl Stat"},{"issue":"3\u20134","key":"626_CR55","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/S0167-9473(02)00165-2","volume":"41","author":"TB Murphy","year":"2003","unstructured":"Murphy TB, Martin D (2003) Mixtures of distance-based models for ranking data. Comput Stat Data Anal 41(3\u20134):645\u2013655","journal-title":"Comput Stat Data Anal"},{"key":"626_CR56","doi-asserted-by":"crossref","unstructured":"Parker H, Singh R, Badal PS (2023) Rankaggsigfur: Polynomially bounded rank aggregation under kemeny\u2019s axiomatic approach [Computer software manual]. Retrieved from https:\/\/CRAN.R-project.org\/package=RankAggSIgFUR (R package version 1.0.0)","DOI":"10.32614\/CRAN.package.RankAggSIgFUR"},{"issue":"2","key":"626_CR57","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s42107-022-00514-z","volume":"24","author":"D Patil","year":"2023","unstructured":"Patil D, Gupta R (2023) Gis-based multi-criteria decision-making for ranking potential sites for centralized rainwater harvesting. Asian J Civ Eng 24(2):497\u2013506","journal-title":"Asian J Civ Eng"},{"issue":"4","key":"626_CR58","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1007\/s11634-021-00442-x","volume":"15","author":"A Plaia","year":"2021","unstructured":"Plaia A, Buscemi S, Sciandra M (2021) Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings. Adv Data Anal Classific 15(4):1015\u20131037. https:\/\/doi.org\/10.1007\/s11634-021-00442-x","journal-title":"Adv Data Anal Classific"},{"key":"626_CR59","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11634-017-0306-x","volume":"13","author":"A Plaia","year":"2019","unstructured":"Plaia A, Sciandra M (2019) Weighted distance-based trees for ranking data. Adv Data Anal Classif 13:427\u2013444","journal-title":"Adv Data Anal Classif"},{"issue":"1","key":"626_CR60","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33\u201357. https:\/\/doi.org\/10.1007\/s11721-007-0002-0","journal-title":"Swarm Intell"},{"issue":"3","key":"626_CR61","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1214\/aos\/1176349265","volume":"21","author":"GL Thompson","year":"1993","unstructured":"Thompson GL (1993) Generalized permutation polytopes and exploratory graphical methods for ranked data. Ann Stat 21(3):1401\u20131430","journal-title":"Ann Stat"},{"issue":"2","key":"626_CR62","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani R, Walther G, Hastie T (2001) Estimating the number of clusters in a data set via the gap statistic. J R Stat Soc Ser B 63(2):411\u2013423","journal-title":"J R Stat Soc Ser B"},{"issue":"4","key":"626_CR63","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1002\/1878-0261.13354","volume":"17","author":"V Vitelli","year":"2023","unstructured":"Vitelli V, Fleischer T, Ankill J, Arjas E, Frigessi A, Kristensen VN, Zucknick M (2023) Transcriptomic pan-cancer analysis using rank-based bayesian inference. Mol Oncol 17(4):548\u2013563. https:\/\/doi.org\/10.1002\/1878-0261.13354","journal-title":"Mol Oncol"},{"issue":"158","key":"626_CR64","first-page":"1","volume":"18","author":"V Vitelli","year":"2018","unstructured":"Vitelli V, S\u00f8rensen \u00d8, Crispino M, Frigessi A, Arjas E (2018) Probabilistic preference learning with the mallows rank model. J Mach Learn Res 18(158):1\u201349","journal-title":"J Mach Learn Res"},{"issue":"4","key":"626_CR65","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/deca.2021.0433","volume":"18","author":"Y Yoo","year":"2021","unstructured":"Yoo Y, Escobedo AR (2021) A new binary programming formulation and social choice property for kemeny rank aggregation. Decis Anal 18(4):296\u2013320","journal-title":"Decis Anal"},{"issue":"1","key":"626_CR66","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1257\/jep.9.1.51","volume":"9","author":"H Young","year":"1995","unstructured":"Young H (1995) Optimal voting rules. J Econ Persp 9(1):51\u201364","journal-title":"J Econ Persp"},{"issue":"2","key":"626_CR67","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"H Young","year":"1978","unstructured":"Young H, Levenglick A (1978) A consistent extension of condorcet\u2019s election principle. SIAM J Appl Math 35(2):285\u2013300","journal-title":"SIAM J Appl Math"},{"key":"626_CR68","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/931256","volume":"2015","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Wang S, Ji G (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. Math Probl Eng 2015:931256. https:\/\/doi.org\/10.1155\/2015\/931256","journal-title":"Math Probl Eng"},{"issue":"1","key":"626_CR69","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/TKDE.2012.250","volume":"26","author":"Y Zhang","year":"2012","unstructured":"Zhang Y, Zhang W, Pei J, Lin X, Lin Q, Li A (2012) Consensus-based ranking of multivalued objects: A generalized borda count approach. IEEE Trans Knowl Data Eng 26(1):83\u201396","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"626_CR70","doi-asserted-by":"crossref","unstructured":"Zuwairie I (2014) Advances in particle swarm algorithms in asynchronous, discrete and multi-objective optimization. In: 2014 5th international conference on intelligent systems, modelling and simulation (p. 5-6)","DOI":"10.1109\/ISMS.2014.166"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-025-00626-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-025-00626-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-025-00626-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:45:46Z","timestamp":1782481546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-025-00626-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,17]]},"references-count":70,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["626"],"URL":"https:\/\/doi.org\/10.1007\/s11634-025-00626-9","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,17]]},"assertion":[{"value":"1 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"R Script codes for reproducibility purpose of the PSOPR algorithm is now available on the Github repository","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}