A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
From MaRDI portal
(Redirected from Publication:316726)
Recommendations
- Computing kemeny rankings from \(d\)-Euclidean preferences
- Distance-based and ad hoc consensus models in ordinal preference ranking
- A multiple criteria ranking procedure based on distance between partial preorders
- Distance and consensus for preference relations corresponding to ordered partitions
- Advances in Intelligent Data Analysis VI
- Preference Learning and Ranking by Pairwise Comparison
- Pairwise preference learning and ranking.
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Kernel-based learning methods for preference aggregation
- An efficient algorithm for learning to rank from preference graphs
Cites work
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 4076317 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 177223 (Why is no real title available?)
- scientific article; zbMATH DE number 3607355 (Why is no real title available?)
- scientific article; zbMATH DE number 847276 (Why is no real title available?)
- scientific article; zbMATH DE number 3405712 (Why is no real title available?)
- scientific article; zbMATH DE number 3049708 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- A mixture of experts model for rank data with applications in election studies
- A new rank correlation coefficient with application to the consensus ranking problem
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Analysing Partial Ranks by Using Smoothed Paired Comparison Methods: An Investigation of Value Orientation in Europe
- Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation
- Classifying densities using functional regression trees: applications in oceanology
- Distance-based tree models for ranking data
- Exploring voting blocs within the Irish electorate
- Geometric representation of association between categories
- Metric methods for analyzing partially ranked data
- Mixed-effects analyses of rank-ordered data
- Mixtures of distance-based models for ranking data
- Modelling the Effect of Subject-Specific Covariates in Paired Comparison Studies with an Application to University Rankings
- Multilevel logistic regression for polytomous data and rankings
- Multistage Ranking Models
- Multivariate Regression Trees for Analysis of Abundance Data
- Multivariate data analysis and modeling through classification and regression trees
- NON-NULL RANKING MODELS. I
- Preference Learning
- Preferential Arrangements
- Probabilistic d-clustering
- Probability models on rankings
- The analysis of rank ordered preference data based on Bradley-Terry type models
- The regression trunk approach to discover treatment covariate interaction
Cited in
(19)- Computing kemeny rankings from \(d\)-Euclidean preferences
- Regression trees for detecting preference patterns from rank data
- Weighted distance-based trees for ranking data
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
- Analysis of ranking data
- Partial evaluation in rank aggregation problems
- Position weighted decision trees for ranking data
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings
- The Bradley-Terry regression trunk approach for modeling preference data with small trees
- Generalized measures of association for ranked data with an application to prediction accuracy
- Median constrained bucket order rank aggregation
- Decision tree modeling for ranking data
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Comparing boosting and bagging for decision trees of rankings
- Approaching the rank aggregation problem by local search-based metaheuristics
- Distance-based tree models for ranking data
This page was built for publication: A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q316726)
