Theoretical Analysis of Different Classifiers under Reduction Rough Data Set: A Brief Proposal

Rough set plays vital role to overcome the complexities, vagueness, uncertainty, imprecision, and incomplete data during features analysis. Classification is tested on certain dataset that maintain an exact class and review process where key attributes decide the class positions. To assess efficient and automated learning, algorithms are used over training datasets. Generally, classification is supervised learning whereas clustering is unsupervised. Classifications under mathematical models deal with mining rules and machine learning. The Objective of this work is to establish a strong theoretical and manual analysis among three popular classifier namely K-nearest neighbor (K-NN), Naive Bayes and Apriori algorithm. Hybridization with rough sets among these three classifiers enables enable to address larger datasets. Performances of three classifiers have tested in absence and presence of rough sets. This work is in the phase of implementation for DNA (Deoxyribonucleic Acid) datasets and it will design automated system to assess classifier under machine learning environment. KeywoRDS Apriori Algorithm, DNA, K-NN, Naive Bayes, Rough Set