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 ChoiceUsing clustering of rankings to explain brand preferences with personality and socio-demographic variablesA Grouped Ranking Model for Item Preference ParameterModeling the Factors Influencing the Evaluations of Items Through Mixture Models for Preference DatasetsA recursive partitioning method for the prediction of preference rankings based upon Kemeny distancesModeling the variability of rankingsMedian constrained bucket order rank aggregationA Kemeny distance-based robust fuzzy clustering for preference dataPLMIX: an R package for modelling and clustering partially ranked dataEfficient and accurate inference for mixtures of Mallows models with Spearman distanceSampling and learning Mallows and generalized Mallows models under the Cayley distanceOn the likelihood of single-peaked preferencesBeyond rankings: comparing directed acyclic graphsDistance-based tree models for ranking dataModel-based clustering for multivariate partial ranking dataMixtures of Weighted Distance-Based Models for Ranking DataRevealing Subgroup Structure in Ranked Data Using a Bayesian WANDMallows and generalized Mallows model for matchingsA mixture model for preferences data analysisAccurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approachA differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approachMixtures of weighted distance-based models for ranking data with applications in political studiesA generative model for rank data based on insertion sort algorithmUnnamed ItemQuantile-based clusteringDiscrete choice models based on random walksA mixture of experts model for rank data with applications in election studiesSignal processing on the permutahedron: tight spectral frames for ranked data analysisAssortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortmentsEstimating the number of clusters in a ranking data contextThe class of \textsc{cub} models: statistical foundations, inferential issues and empirical evidenceThe importance of being clustered: uncluttering the trends of statistics from 1970 to 2015Rank aggregation using latent-scale distance-based modelsLearning mixtures of permutations: groups of pairwise comparisons and combinatorial method of moments



Cites Work


This page was built for publication: Mixtures of distance-based models for ranking data