Weighted distance-based trees for ranking data

DOI10.1007/s11634-017-0306-xzbMath1459.62119OpenAlexW2773637401MaRDI QIDQ1999451

Antonella Plaia, Mariangela Sciandra

Publication date: 27 June 2019

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-017-0306-x

zbMATH Keywords

decision treeKemeny distanceranking datadistance-based methodsSUSHI datauniversity ranking data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Individual preferences (91B08)

Related Items (4)

Comparing boosting and bagging for decision trees of rankings ⋮ Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings ⋮ Median constrained bucket order rank aggregation ⋮ The Bradley-Terry regression trunk approach for modeling preference data with small trees

Uses Software

• rpart
• HandTill2001
• ConsRank

Cites Work

• Unnamed Item
• Unnamed Item
• Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
• Label ranking by learning pairwise preferences
• Binary trees for dissimilarity data
• Distance-based tree models for ranking data
• Distance-based and ad hoc consensus models in ordinal preference ranking
• Decision Tree Modeling for Ranking Data
• An axiomatic approach to distance on partial orderings
• Modelling the Effect of Subject-Specific Covariates in Paired Comparison Studies with an Application to University Rankings
• A new rank correlation coefficient with application to the consensus ranking problem
• A simple generalisation of the area under the ROC curve for multiple class classification problems
• Selecting the best splits for classification trees with categorical variables

This page was built for publication: Weighted distance-based trees for ranking data