Data classification using rough sets and naïve bayes

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Naïve Bayesian classifier is one of the most effective and efficient classification algorithms. The elegant simplicity and apparent accuracy of naive Bayes (NB) even when the independence assumption is violated, fosters the on-going interest in the model. Rough Sets Theory has been used for different tasks in knowledge discovery and successfully applied in many real-life problems. In this study we make use of rough sets ability, in discovering attributes dependencies, to overcome the NB un-practical assumption. We propose a new algorithm called Rough-Naive Bayes (RNB) that is expected to outperform other current NB variants. RNB is based on adjusting attributes' weights based on their dependencies and contribution to the final decision. Experimental results show that RNB can achieve better performance than NB classifier. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Al-Aidaroos, K., Bakar, A. A., & Othman, Z. (2010). Data classification using rough sets and naïve bayes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6401 LNAI, pp. 134–142). https://doi.org/10.1007/978-3-642-16248-0_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free