Related Experiment Video
Updated: Mar 18, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
Published on: March 1, 2022
A Recursive Partitioning Method for the Prediction of Preference Rankings Based Upon Kemeny Distances
Antonio D'Ambrosio1, Willem J Heiser2
1Department of Economics and Statistics, University of Naples Federico II, Via Cinthia, 80126 , Naples, Italy. antdambr@unina.it.
Abstract:
Preference rankings usually depend on the characteristics of both the individuals judging a set of objects and the objects being judged. This topic has been handled in the literature with log-linear representations of the generalized Bradley-Terry model and, recently, with distance-based tree models for rankings. A limitation of these approaches is that they only work with full rankings or with a pre-specified pattern governing the presence of ties, and/or they are based on quite strict distributional assumptions. To overcome these limitations, we propose a new prediction tree method for ranking data that is totally distribution-free. It combines Kemeny's axiomatic approach to define a unique distance between rankings with the CART approach to find a stable prediction tree. Furthermore, our method is not limited by any particular design of the pattern of ties. The method is evaluated in an extensive full-factorial Monte Carlo study with a new simulation design.
More Related Videos
12:27Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
08:38A System for Tracking the Dynamics of Social Preference Behavior in Small Rodents
Published on: November 21, 2019
Related Concept Videos
Ranks
Kendall's Tau Test
A τ value of +1 indicates...
Friedman Two-way Analysis of Variance by Ranks
Kendall's Coefficient of Concordance
Percentile
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...