Pages that link to "Item:Q316726"
From MaRDI portal
The following pages link to A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances (Q316726):
Displaying 18 items.
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (Q62323) (← links)
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach (Q62336) (← links)
- Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991) (← links)
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
- Partial evaluation in rank aggregation problems (Q1652087) (← links)
- Generalized measures of association for ranked data with an application to prediction accuracy (Q1801914) (← links)
- Weighted distance-based trees for ranking data (Q1999451) (← links)
- Comparing boosting and bagging for decision trees of rankings (Q2129304) (← links)
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings (Q2184062) (← links)
- Regression trees for detecting preference patterns from rank data (Q2324255) (← links)
- Median constrained bucket order rank aggregation (Q2418073) (← links)
- Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
- Distance-based tree models for ranking data (Q2445618) (← links)
- Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings (Q2673352) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- The Bradley-Terry regression trunk approach for modeling preference data with small trees (Q6198874) (← links)
- Analysis of ranking data (Q6600381) (← links)
- Position weighted decision trees for ranking data (Q6613602) (← links)
