Mixtures of distance-based models for ranking data
From MaRDI portal
Publication:951838
DOI10.1016/S0167-9473(02)00165-2zbMath1429.62258OpenAlexW2071601825MaRDI QIDQ951838
Thomas Brendan Murphy, Donal Martin
Publication date: 4 November 2008
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-9473(02)00165-2
Related Items (34)
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice ⋮ Using clustering of rankings to explain brand preferences with personality and socio-demographic variables ⋮ A Grouped Ranking Model for Item Preference Parameter ⋮ Modeling the Factors Influencing the Evaluations of Items Through Mixture Models for Preference Datasets ⋮ A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances ⋮ Modeling the variability of rankings ⋮ Median constrained bucket order rank aggregation ⋮ A Kemeny distance-based robust fuzzy clustering for preference data ⋮ PLMIX: an R package for modelling and clustering partially ranked data ⋮ Efficient and accurate inference for mixtures of Mallows models with Spearman distance ⋮ Sampling and learning Mallows and generalized Mallows models under the Cayley distance ⋮ On the likelihood of single-peaked preferences ⋮ Beyond rankings: comparing directed acyclic graphs ⋮ Distance-based tree models for ranking data ⋮ Model-based clustering for multivariate partial ranking data ⋮ Mixtures of Weighted Distance-Based Models for Ranking Data ⋮ Revealing Subgroup Structure in Ranked Data Using a Bayesian WAND ⋮ Mallows and generalized Mallows model for matchings ⋮ A mixture model for preferences data analysis ⋮ Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach ⋮ 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 ⋮ A generative model for rank data based on insertion sort algorithm ⋮ Unnamed Item ⋮ Quantile-based clustering ⋮ Discrete choice models based on random walks ⋮ A mixture of experts model for rank data with applications in election studies ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis ⋮ Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments ⋮ Estimating the number of clusters in a ranking data context ⋮ The class of \textsc{cub} models: statistical foundations, inferential issues and empirical evidence ⋮ The importance of being clustered: uncluttering the trends of statistics from 1970 to 2015 ⋮ Rank aggregation using latent-scale distance-based models ⋮ Learning mixtures of permutations: groups of pairwise comparisons and combinatorial method of moments
Cites Work
- Metric methods for analyzing partially ranked data
- A classification EM algorithm for clustering and two stochastic versions
- NON-NULL RANKING MODELS. I
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mixtures of distance-based models for ranking data
