Pages that link to "Item:Q2445618"
From MaRDI portal
The following pages link to Distance-based tree models for ranking data (Q2445618):
Displaying 14 items.
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances (Q316726) (← links)
- Mixtures of weighted distance-based models for ranking data with applications in political studies (Q693262) (← links)
- Logit tree models for discrete choice data with application to advice-seeking preferences among Chinese Christians (Q736666) (← links)
- Split variable selection for tree modeling on rank data (Q1927062) (← links)
- Weighted distance-based trees for ranking data (Q1999451) (← links)
- Comparing boosting and bagging for decision trees of rankings (Q2129304) (← links)
- On the lower bound of Spearman's footrule (Q2178933) (← links)
- Regression trees for detecting preference patterns from rank data (Q2324255) (← links)
- Median constrained bucket order rank aggregation (Q2418073) (← links)
- On a weighted generalization of Kendall's tau distance (Q2660131) (← links)
- General partially linear varying-coefficient transformation models for ranking data (Q3168254) (← links)
- PLMIX: an <tt>R</tt> package for modelling and clustering partially ranked data (Q5107752) (← links)
- Efficient and accurate inference for mixtures of Mallows models with Spearman distance (Q6172157) (← links)
- The Bradley-Terry regression trunk approach for modeling preference data with small trees (Q6198874) (← links)