Basic uncertain information soft set and its application to multi-criteria group decision making
Z Tao, Z Shao, J Liu, L Zhou, H Chen - Engineering Applications of Artificial …, 2020 - Elsevier
The purpose of this paper is to develop a novel type of soft set called basic uncertain
information soft set (BUISS), which combines the notion of basic uncertain information and …
information soft set (BUISS), which combines the notion of basic uncertain information and …
Multi-province comparisons of digital financial inclusion performance in China: A group ranking method with preference analysis
Abstract The Peking University Digital Financial Inclusion Index of China (PKU-DFIIC)
measures the digital financial inclusion (DFI) performance in China from three dimensions …
measures the digital financial inclusion (DFI) performance in China from three dimensions …
Inter-country comparisons of energy system performance with the energy trilemma index: An ensemble ranking methodology based on the half-quadratic theory
Abstract The World Energy Council annually publishes the Energy Trilemma Index (ETI) to
highlight an economy's challenges in balancing the Trilemma and opportunities for …
highlight an economy's challenges in balancing the Trilemma and opportunities for …
[HTML][HTML] A highly scalable algorithm for weak rankings aggregation
Abstract The Optimal Bucket Order Problem (OBOP) is a rank aggregation problem which
consists in finding a consensus ranking (with ties) that generalizes a set of input rankings. In …
consists in finding a consensus ranking (with ties) that generalizes a set of input rankings. In …
Genetic Algorithm-enhanced Rank aggregation model to measure the performance of Pulp and Paper Industries
Performance measurement is a complex but important task required in all sectors. The
problem however arises when usage of different methods for performance assessment …
problem however arises when usage of different methods for performance assessment …
Median constrained bucket order rank aggregation
A D'Ambrosio, C Iorio, M Staiano, R Siciliano - Computational Statistics, 2019 - Springer
The rank aggregation problem can be summarized as the problem of aggregating individual
preferences expressed by a set of judges to obtain a ranking that represents the best …
preferences expressed by a set of judges to obtain a ranking that represents the best …
Unsupervised graph-based rank aggregation for improved retrieval
IC Dourado, DCG Pedronette… - Information Processing & …, 2019 - Elsevier
This paper presents a robust and comprehensive graph-based rank aggregation approach,
used to combine results of isolated ranker models in retrieval tasks. The method follows an …
used to combine results of isolated ranker models in retrieval tasks. The method follows an …
[HTML][HTML] Multi-dimensional Bayesian network classifiers for partial label ranking
The label ranking problem consists in learning preference models from training datasets
labeled with (possibly incomplete) rankings of the class labels. The goal is then to predict a …
labeled with (possibly incomplete) rankings of the class labels. The goal is then to predict a …
Ensemble learning for the partial label ranking problem
The partial label ranking problem is a general interpretation of the preference learning
scenario known as the label ranking problem, the goal of which is to learn preference …
scenario known as the label ranking problem, the goal of which is to learn preference …
Graph-based rank aggregation method for high-dimensional and partial rankings
Rank aggregation has recently become a common approach for combining individual
rankings into a consensus and for quantifying and improving performance in various …
rankings into a consensus and for quantifying and improving performance in various …