An agglomerative hierarchical clustering algorithm for linear ordinal rankings
From MaRDI portal
Publication:2127073
DOI10.1016/j.ins.2020.12.056zbMath1484.62080OpenAlexW3120946147MaRDI QIDQ2127073
Xiao-Jun Zeng, Peijia Ren, Nana Liu, Ze-Shui Xu
Publication date: 19 April 2022
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.12.056
Related Items (4)
Asymptotic properties of Spearman's footrule and Gini's gamma in bivariate normal model ⋮ SEND: a novel dissimilarity metric using ensemble properties of the feature space for clustering numerical data ⋮ Clustering mixed numerical and categorical data with missing values ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems
Cites Work
- Unnamed Item
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- Tackling the rank aggregation problem with evolutionary algorithms
- An iterative approach for achieving consensus when ranking a finite set of alternatives by a group of experts
- A new consensus ranking approach for correlated ordinal information based on Mahalanobis distance
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Efficient Clustering for Orders
- An axiomatic approach to distance on partial orderings
- Ordinal Ranking with Intensity of Preference
- Note—Ordinal Ranking and Intensity of Preference: A Linear Programming Approach
- Criterion of distance between technical programming and socio-economic priority
- A model to support the search for consensus with conflicting rankings: Multitrident
- A new rank correlation coefficient with application to the consensus ranking problem
- Hesitant fuzzy agglomerative hierarchical clustering algorithms
- A multiple criteria ranking procedure based on distance between partial preorders
This page was built for publication: An agglomerative hierarchical clustering algorithm for linear ordinal rankings
