Metric methods for analyzing partially ranked data
From MaRDI portal
Publication:1074273
zbMath0589.62041MaRDI QIDQ1074273
Publication date: 1985
Published in: Lecture Notes in Statistics (Search for Journal in Brave)
Kendall's tauSpearman's rhodistributional propertiesHausdorff metricsextending metrics to partially ranked datafully ranked datametrics on a coset space of the permutation group
Measures of association (correlation, canonical correlation, etc.) (62H20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Statistical ranking and selection procedures (62F07) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)
Related Items
Agreement Among Censored Rankings Using Spearman's Footrule, On adding a list of numbers (and other one-dependent determinantal processes), Ranking chain sum orders, Testing for the Presence of a Maverick Judge, A generalized Mallows model based on \(\phi\)-divergence measures, A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances, Statistics for phylogenetic trees, Multidimensional medians arising from geodesics on graphs, Group algebra of characteristic 1 and invariant distances over a finite group, A general theory of hypothesis testing based on rankings, On rankings generated by pairwise linear discriminant analysis of \(m\) populations, The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders, Metrics on permutations useful for positive dependence, Concordance between two linear orders: The Spearman and Kendall coefficients revisited, Unnamed Item, Limit theorems for sequences of random trees, Regenerative random permutations of integers, Limit theorems for longest monotone subsequences in random Mallows permutations, Distance-based tree models for ranking data, Comparing and aggregating partially resolved trees, A non-iterative procedure for maximum likelihood estimation of the parameters of mallows' model based on partial rankings, Using partial ranking information in the design of small-sample comparisons, Mixtures of Weighted Distance-Based Models for Ranking Data, Using extension sets to aggregate partial rankings in a flexible setting, Probability models on rankings, Continuation methods for approximate large scale object sequencing, The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders, A partial ordering of rank densities, A central limit theorem for a new statistic on permutations, Mixtures of distance-based models for ranking data, Covariance structure analysis of ordinal ipsative data, Hierarchical orbital decompositions and extended decomposable distributions, On rank statistics: An approach via metrics on the permutation group, Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach, Mixtures of weighted distance-based models for ranking data with applications in political studies, Paired comparison, triple comparison, and ranking experiments as generalized linear models, and their implementation on GLIM, Estimation in exponential families on permutations, Geometric representation of association between categories, Prior distributions on symmetric groups, Directed connection measurement for evaluating reconstructed stroke sequence in handwriting images, Conjugacy Class Prior Distributions on Metric-Based Ranking Models, Computing distances between partial rankings, Testing the equality of distributions of random vectors with categorical components., A generative model for rank data based on insertion sort algorithm, On the hardness of maximum rank aggregation problems, Nonparametric measures of dependence for biometric data studies, Unnamed Item, Comparing and Aggregating Partially Resolved Trees, Generalized measures of association for ranked data with an application to prediction accuracy, Gaussian field on the symmetric group: prediction and learning, The Markov chain Monte Carlo revolution, Signal processing on the permutahedron: tight spectral frames for ranked data analysis, Spearman's footrule under progressive censoring, Distance and consensus for preference relations corresponding to ordered partitions, The limiting normality of the test statistic for the two-sample problem induced by a convex sum distance, What do we know about the Metropolis algorithm?, Asymptotic properties of Lee distance, Regression trees for detecting preference patterns from rank data, The limit of the empirical measure of the product of two independent Mallows permutations, Small sample set estimation of a baseline ranking, Detecting the end of agreement between two long ranked lists, Similarity of personal preferences: Theoretical foundations and empirical analysis
