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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dong, G., Zhang, X., Wong, L., et al.: CAEP: Classification by Aggregating Emerging Patterns. In: Arikawa, S., Furukawa, K. (eds.) DS 1999. LNCS (LNAI), vol. 1721, Springer, Heidelberg (1999)
Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proc. of the 4th Int. Conf. on KDD and DM (KDD-98), ACM Press, New York (1998)
Quinlan, J.: C4.5: Programs for machine learning. Morgan Kaufmann, San Francisco (1993)
Thabtah, F., Cowling, P., Peng, Y.: MCAR: Multi-class Classification based on Association Rule Approach. In: Proc. of the 3rd IEEE Int. Conf. on Computer Systems and Applications. Cairo, Egypt (2005)
Thabtah, F., Cowling, P., Peng, Y.H.: A study of Predictive Accuracy for Four Associative Classifiers. Journal of Digital Information Management 3, 202–205 (2005)
Li, W.M., Han, J.W., Pei, J.: CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules. In: Proceedings of the 2001 IEEE International Conference on Data Mining, California, USA (2001)
Pawlak, Z.: Rough sets. Int. J. of Computer and Information Sciences 11(5), 341–356 (1982)
Shafer, G.: A Mathematical Theory of Evidence. Princeton Uni. Press, Princeton (1976)
Dempster, A.P.: Upper and Lower Probabilities Induced by a Multivalued Mapping. Annals of Mathematical Statistics 38(2), 325–339 (1967)
Thabtah, F., Cowling, P., Hammoud, S.: Improving rule sorting, predictive accuracy and training time in associative classification. Expert Systems with Appl. 31, 414–426 (2006)
Ziarko, W.: Variable Precision Rough Set Model. Journal of Computer and System Sciences 40, 39–59 (1993)
Yang, J.B., Wang, Y.M., Xu, D.L., et al.: The evidential reasoning approach for MADA under both probabilistic and fuzzy uncertainties. Euro. J. of OR. 171(1), 309–343 (2006)
Murphy, C.K.: Combining belief functions when evidence conflicts. Decision Support Systems 29, 1–9 (2000)
Murphy, P.M., Aha, D.W.: UCI Repository machine learning databases University of California, Irvine (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, YC., Liu, YZ., Liu, X., Zhang, JK. (2007). Constructing Associative Classifier Using Rough Sets and Evidence Theory. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-72530-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72529-9
Online ISBN: 978-3-540-72530-5
eBook Packages: Computer ScienceComputer Science (R0)