2012
DOI: 10.1142/s0219622012500095
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of Classification Algorithms Using McDm and Rank Correlation

Abstract: Classification algorithm selection is an important issue in many disciplines. Since it normally involves more than one criterion, the task of algorithm selection can be modeled as multiple criteria decision making (MCDM) problems. Different MCDM methods evaluate classifiers from different aspects and thus they may produce divergent rankings of classifiers. The goal of this paper is to propose an approach to resolve disagreements among MCDM methods based on Spearman's rank correlation coefficient. Five MCDM met… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
183
0
4

Year Published

2013
2013
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 538 publications
(192 citation statements)
references
References 34 publications
5
183
0
4
Order By: Relevance
“…Table 15 shows that the Spearman's rank correlation coefficients between the proposed method and AHP and TOPSIS are 0.9722 and 0.9549, respectively, which demonstrate that the proposed method is highly correlated with these two methods. AHP and TOPSIS methods have been approved to be the most suitable two methods to solve web service selection problems [39]; thus, the comparison results above illustrate the feasibility of the proposed method. From the information aggregation of the proposed method, we can find that the calculating procedure of the proposed method is more complicated than AHP and TOPSIS methods.…”
Section: Mcdm Application Fieldsmentioning
confidence: 80%
See 1 more Smart Citation
“…Table 15 shows that the Spearman's rank correlation coefficients between the proposed method and AHP and TOPSIS are 0.9722 and 0.9549, respectively, which demonstrate that the proposed method is highly correlated with these two methods. AHP and TOPSIS methods have been approved to be the most suitable two methods to solve web service selection problems [39]; thus, the comparison results above illustrate the feasibility of the proposed method. From the information aggregation of the proposed method, we can find that the calculating procedure of the proposed method is more complicated than AHP and TOPSIS methods.…”
Section: Mcdm Application Fieldsmentioning
confidence: 80%
“…Subsequently, the ranking results of different MCDM methods are presented in Table 14. The Spearman's rank correlation coefficient is a powerful tool for measuring the similarity between two MCDM methods [39]. Then, we can calculate the Spearman's rank correlation coefficients between the proposed method and the other five MCDM methods as shown in Table 15.…”
Section: Mcdm Application Fieldsmentioning
confidence: 99%
“…In particular, in the machine learning field, we may enumerate several kinds of solutions to resolve the problems mentioned above. We may justify a statistic-based approach [57], and more general approach to build ranking method (a ranking-based approach) [2,40,41,79].…”
Section: A2 the Indicators And Methods To Evaluate And Comparison Ofmentioning
confidence: 99%
“…A larger absolute value indicates a good agreement between one MCDM method and other MCDM method [13].…”
Section: H Spearman's Rank Correlation Coefficientmentioning
confidence: 97%