Distance-based tree models for ranking data

DOI10.1016/j.csda.2010.01.027zbMath1284.62055OpenAlexW2028664571MaRDI QIDQ2445618

Philip L. H. Yu, Paul H. Lee

Publication date: 14 April 2014

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2010.01.027

zbMATH Keywords

decision treeranking datadistance-based model

Mathematics Subject Classification ID

Related Items (14)

Comparing boosting and bagging for decision trees of rankings ⋮ General partially linear varying-coefficient transformation models for ranking data ⋮ A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances ⋮ On a weighted generalization of Kendall's tau distance ⋮ On the lower bound of Spearman's footrule ⋮ Split variable selection for tree modeling on rank data ⋮ Median constrained bucket order rank aggregation ⋮ PLMIX: an R package for modelling and clustering partially ranked data ⋮ Efficient and accurate inference for mixtures of Mallows models with Spearman distance ⋮ The Bradley-Terry regression trunk approach for modeling preference data with small trees ⋮ Weighted distance-based trees for ranking data ⋮ Mixtures of weighted distance-based models for ranking data with applications in political studies ⋮ Logit tree models for discrete choice data with application to advice-seeking preferences among Chinese Christians ⋮ Regression trees for detecting preference patterns from rank data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Log-normal regression modeling through recursive partitioning
• Mixtures of distance-based models for ranking data
• A mixture of experts model for rank data with applications in election studies
• Metric methods for analyzing partially ranked data
• Specifying and testing econometric models for rank-ordered data
• Probability models on rankings
• A weighted Kendall's tau statistic
• Bayesian analysis of order-statistics models for ranking data
• Describing disability through individual-level mixture models for multivariate binary data
• Tree-structured Generalized Autoregressive Conditional Heteroscedastic Models
• NON-NULL RANKING MODELS. I
• Discrete Choice Methods with Simulation

This page was built for publication: Distance-based tree models for ranking data