A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
From MaRDI portal
Publication:316726
DOI10.1007/S11336-016-9505-1zbMATH Open1345.62144OpenAlexW2465547404WikidataQ39637946 ScholiaQ39637946MaRDI QIDQ316726FDOQ316726
Authors: A. D'Ambrosio, Willem J. Heiser 
Publication date: 27 September 2016
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-016-9505-1
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
Statistical ranking and selection procedures (62F07) Applications of statistics to psychology (62P15)
Cites Work
- The regression trunk approach to discover treatment covariate interaction
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Title not available (Why is that?)
- Metric methods for analyzing partially ranked data
- Probability models on rankings
- Multivariate data analysis and modeling through classification and regression trees
- Geometric representation of association between categories
- NON-NULL RANKING MODELS. I
- Title not available (Why is that?)
- Preferential Arrangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new rank correlation coefficient with application to the consensus ranking problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multistage Ranking Models
- Title not available (Why is that?)
- Mixtures of distance-based models for ranking data
- Exploring voting blocs within the Irish electorate
- Title not available (Why is that?)
- Title not available (Why is that?)
- A mixture of experts model for rank data with applications in election studies
- Probabilistic d-clustering
- Classifying densities using functional regression trees: applications in oceanology
- Multivariate Regression Trees for Analysis of Abundance Data
- Multilevel logistic regression for polytomous data and rankings
- Analysing Partial Ranks by Using Smoothed Paired Comparison Methods: An Investigation of Value Orientation in Europe
- Modelling the Effect of Subject-Specific Covariates in Paired Comparison Studies with an Application to University Rankings
- Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation
- The analysis of rank ordered preference data based on Bradley-Terry type models
- Distance-based tree models for ranking data
- Mixed-effects analyses of rank-ordered data
- Preference Learning
- Title not available (Why is that?)
Cited In (19)
- 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
- Analysis of ranking data
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
- Position weighted decision trees for ranking data
- Partial evaluation in rank aggregation problems
- The Bradley-Terry regression trunk approach for modeling preference data with small trees
- Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings
- 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
- 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
- Computing kemeny rankings from \(d\)-Euclidean preferences
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)
