Comparison of Algorithms Based on Rough Set Theory for a 3-Class Classification

Abstract

There are various data mining techniques to handle with huge amount of data sets. Rough set based classification provides an opportunity in the efficiency of algorithms when dealing with larger datasets. The selection of eligible attributes by using an efficient rule set offers decision makers save time and cost. This paper presents the comparison of the performance of the rough set based algorithms: Johnson’ s, Genetic Algorithm and Dynamic reducts. The performance of algorithms is measured based on accuracy, AUC and standard error for a 3-class classification problem on training on test data sets. Based on the test data, the results showed that genetic algorithm overperformed the others.