Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class Variable
Class noise is a common issue that affects the performance of classification techniques on real-world data sets. Class noise appears when a class variable in data sets has incorrect class labels. In the case of noisy data, the robustness of classification techniques against noise could be more impor...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2024/6671395 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832559575741497344 |
|---|---|
| author | Abdulmajeed Atiah Alharbi |
| author_facet | Abdulmajeed Atiah Alharbi |
| author_sort | Abdulmajeed Atiah Alharbi |
| collection | DOAJ |
| description | Class noise is a common issue that affects the performance of classification techniques on real-world data sets. Class noise appears when a class variable in data sets has incorrect class labels. In the case of noisy data, the robustness of classification techniques against noise could be more important than the performance results on noise-free data sets. The decision tree method is one of the most popular techniques for classification tasks. The C4.5, CART, and random forest (RF) algorithms are considered to be three of the most used algorithms in decision trees. The aim of this paper is to reach conclusions on which decision tree algorithm is better to use for building decision trees in terms of its performance and robustness against class noise. In order to achieve this aim, we study and compare the performance of the models when applied to class variables with noise. The results obtained indicate that the RF algorithm is more robust to data sets with noisy class variable than other algorithms. |
| format | Article |
| id | doaj-art-b094d33c81b149a9a03732f85519635f |
| institution | Kabale University |
| issn | 1607-887X |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-b094d33c81b149a9a03732f85519635f2025-02-03T01:29:48ZengWileyDiscrete Dynamics in Nature and Society1607-887X2024-01-01202410.1155/2024/6671395Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class VariableAbdulmajeed Atiah Alharbi0Department of MathematicsClass noise is a common issue that affects the performance of classification techniques on real-world data sets. Class noise appears when a class variable in data sets has incorrect class labels. In the case of noisy data, the robustness of classification techniques against noise could be more important than the performance results on noise-free data sets. The decision tree method is one of the most popular techniques for classification tasks. The C4.5, CART, and random forest (RF) algorithms are considered to be three of the most used algorithms in decision trees. The aim of this paper is to reach conclusions on which decision tree algorithm is better to use for building decision trees in terms of its performance and robustness against class noise. In order to achieve this aim, we study and compare the performance of the models when applied to class variables with noise. The results obtained indicate that the RF algorithm is more robust to data sets with noisy class variable than other algorithms.http://dx.doi.org/10.1155/2024/6671395 |
| spellingShingle | Abdulmajeed Atiah Alharbi Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class Variable Discrete Dynamics in Nature and Society |
| title | Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class Variable |
| title_full | Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class Variable |
| title_fullStr | Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class Variable |
| title_full_unstemmed | Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class Variable |
| title_short | Classification Performance Analysis of Decision Tree-Based Algorithms with Noisy Class Variable |
| title_sort | classification performance analysis of decision tree based algorithms with noisy class variable |
| url | http://dx.doi.org/10.1155/2024/6671395 |
| work_keys_str_mv | AT abdulmajeedatiahalharbi classificationperformanceanalysisofdecisiontreebasedalgorithmswithnoisyclassvariable |