Constructing associative classifier using rough sets and evidence theory

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

Abstract

Constructing accurate classifier based on association rule is an important and challenging task in data mining. In this paper, a novel combination strategy based on rough sets (RST) and evidence theory (DST) for associative classification (RSETAC) is proposed. In RSETAC, rules are regarded as classification experts, after the calculation of the basic probability assignments (bpa) according to rule confidences and evidence weights employing RST, Yang's rule of combination is employed to combine the distinct evidences to realize an aggregate classification. A numerical example is shown to highlight the procedure of the proposed method. The comparison with popular methods like CBA, C4.5, RIPPER and MCAR indicates that RSETAC is a competitive method for classification based on association rule. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Jiang, Y. C., Liu, Y. Z., Liu, X., & Zhang, J. K. (2007). Constructing associative classifier using rough sets and evidence theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4482 LNAI, pp. 263–271). Springer Verlag. https://doi.org/10.1007/978-3-540-72530-5_31

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