Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
From MaRDI portal
Publication:1202177
zbMath0754.00011MaRDI QIDQ1202177
No author found.
Publication date: 23 January 1993
Published in: Lecture Notes in Statistics (Search for Journal in Brave)
Proceedings, conferences, collections, etc. pertaining to statistics (62-06) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to probability theory (60-06)
Related Items (25)
Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron ⋮ On adding a list of numbers (and other one-dependent determinantal processes) ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ Ranked set sampling, coherent rankings and size-biased permutations ⋮ Fundamental weight systems are quantum states ⋮ Unnamed Item ⋮ Worst-case versus average-case design for estimation from partial pairwise comparisons ⋮ Limit theorems for longest monotone subsequences in random Mallows permutations ⋮ Sampling and learning Mallows and generalized Mallows models under the Cayley distance ⋮ Leading the field: fortune favors the bold in Thurstonian choice models ⋮ A mixture model for preferences data analysis ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ Mixtures of weighted distance-based models for ranking data with applications in political studies ⋮ Modeling heterogeneity in ranked responses by nonparametric maximum likelihood: How do Europeans get their scientific knowledge? ⋮ A generative model for rank data based on insertion sort algorithm ⋮ On L-decomposability of random orderings ⋮ On the estimation of latent distances using graph distances ⋮ Estimating the number of clusters in a ranking data context ⋮ Adjacency-based regularization for partially ranked data with non-ignorable missing ⋮ What do we know about the Metropolis algorithm? ⋮ Presorting algorithms: an average-case point of view ⋮ The limit of the empirical measure of the product of two independent Mallows permutations ⋮ On the comparison of the Spearman and Kendall metrics between linear orders. ⋮ Detecting the end of agreement between two long ranked lists ⋮ A general concept of majority rule
This page was built for publication: Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
