Skip to main content

On Combined Classifiers, Rule Induction and Rough Sets

  • Chapter
Transactions on Rough Sets VI

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 4374))

Abstract

Problems of using elements of rough sets theory and rule induction to create efficient classifiers are discussed. In the last decade many researches attempted to increase a classification accuracy by combining several classifiers into integrated systems. The main aim of this paper is to summarize the author’s own experience with applying one of his rule induction algorithm, called MODLEM, in the framework of different combined classifiers, namely, the bagging, n 2–classifier and the combiner aggregation. We also discuss how rough approximations are applied in rule induction. The results of carried out experiments have shown that the MODLEM algorithm can be efficiently used within the framework of considered combined classifiers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bazan, J.: A comparison of dynamic and non-dynamic rough set methods for extracting laws from decision tables. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Data Mining and Knowledge Discovery, vol. 1, pp. 321–365. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  2. Bazan, J., Nguyen, H.S., Skowron, A.: Rough sets methods in approximation of hierarchical concepts. In: Tsumoto, S., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 346–355. Springer, Heidelberg (2004)

    Google Scholar 

  3. Blake, C., Koegh, E., Mertz, C.J.: Repository of Machine Learning, University of California at Irvine (1999)

    Google Scholar 

  4. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123–140 (1996)

    MathSciNet  MATH  Google Scholar 

  5. Chan, P.K., Stolfo, S.: On the accuracy of meta-learning for scalable data mining. Journal of Intelligent Information Systems 8(1), 5–28 (1997)

    Article  Google Scholar 

  6. Dietrich, T.G.: Ensemble methods in machine learning. In: Proc. of 1st Int. Workshop on Multiple Classifier Systems, pp. 1–15 (2000)

    Google Scholar 

  7. Friedman, J.: Another approach to polychotomous classification. Technical Report, Stanford University (1996)

    Google Scholar 

  8. Góra, G., Wojna, A.: RIONA: a new classification system combining rule induction and instance based learning. Fundamenta Informaticae 51(4), 369–390 (2002)

    MathSciNet  MATH  Google Scholar 

  9. Greco, S., Matarazzo, B., Słowiński, R.: The use of rough sets and fuzzy sets in MCDM. In: Gal, T., Stewart, T., Hanne, T. (eds.) Advances in Multiple Criteria Decision Making, pp. 14.1-14.59. Kluwer, Dordrecht (1999)

    Google Scholar 

  10. Greco, S., et al.: Variable consistency model of dominance-based rough set approach. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 170–181. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Grzymala-Busse, J.W.: LERS - a system for learning from examples based on rough sets. In: Slowinski, R. (ed.) Intelligent Decision Support, pp. 3–18. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  12. Grzymala-Busse, J.W.: Managing uncertainty in machine learning from examples. In: Proc. 3rd Int. Symp. in Intelligent Systems, Wigry, Poland, pp. 70–84. IPI PAN Press (1994)

    Google Scholar 

  13. Grzymala-Busse, J.W., Zou, X.: Classification strategies using certain and possible rules. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 37–44. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Grzymala-Busse, J.W., Stefanowski, J.: Three approaches to numerical attribute discretization for rule induction. International Journal of Intelligent Systems 16(1), 29–38 (2001)

    Article  MATH  Google Scholar 

  15. Grzymala-Busse, J.W., Stefanowski, J., Wilk, S.: A comparison of two approaches to data mining from imbalanced data. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds.) KES 2004. LNCS (LNAI), vol. 3213, pp. 757–763. Springer, Heidelberg (2004)

    Google Scholar 

  16. Han, J., Kamber, M.: Data mining: Concepts and techniques. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  17. Hastie, T., Tibshirani, R.: Classification by pairwise coupling. In: Jordan, M.I. (ed.) Advances in Neural Information Processing Systems 10 (NIPS-97), pp. 507–513. MIT Press, Cambridge (1998)

    Google Scholar 

  18. Jelonek, J., Stefanowski, J.: Experiments on solving multiclass learning problems by the n2-classifier. In: Nédellec, C., Rouveirol, C. (eds.) Machine Learning: ECML-98. LNCS, vol. 1398, pp. 172–177. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  19. Klosgen, W., Żytkow, J.M. (eds.): Handbook of Data Mining and Knowledge Discovery. Oxford Press, New York (2002)

    Google Scholar 

  20. Komorowski, J., et al.: Rough Sets: tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough Fuzzy Hybridization. A new trend in decision making, pp. 3–98. Springer, Singapore (1999)

    Google Scholar 

  21. Kuncheva, L., Whitaker, C.J.: Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Machine Learning 51, 181–207 (2003)

    Article  MATH  Google Scholar 

  22. Merz, C.: Using correspondence analysis to combine classifiers. Machine Learning 36(1/2), 33–58 (1999)

    Article  Google Scholar 

  23. Mitchell, T.M.: Machine learning. McGraw-Hill, New York (1997)

    MATH  Google Scholar 

  24. Nguyen, S.H., Nguyen, T.T., Nguyen, H.S.: Rough sets approach to sunspot classification problem. In: Ślęzak, D., et al. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3642, pp. 263–272. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Pawlak, Z.: Rough sets. Int. J. Computer and Information Sci. 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  26. Pawlak, Z.: Rough sets. Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  27. Pawlak, Z., et al.: Rough sets. Communications of the ACM 38(11), 89–95 (1995)

    Article  Google Scholar 

  28. Skowron, A.: Boolean reasoning for decision rules generation. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 295–305. Springer, Heidelberg (1993)

    Google Scholar 

  29. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  30. Slezak, D.: Approximate entropy reducts. Fundamenta Informaticae 53(3/4), 365–387 (2002)

    MathSciNet  Google Scholar 

  31. Slowinski, R., Greco, S.: Inducing Robust Decision Rules from Rough Approximations of a Preference Relation. In: Rutkowski, L., et al. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 118–132. Springer, Heidelberg (2004)

    Google Scholar 

  32. Stefanowski, J.: Classification support based on the rough sets. Foundations of Computing and Decision Sciences 18(3-4), 371–380 (1993)

    MathSciNet  MATH  Google Scholar 

  33. Stefanowski, J.: Using valued closeness relation in classification support of new objects. In: Lin, T.Y., Wildberger, A.M. (eds.) Soft computing: rough sets, fuzzy logic, neural networks uncertainty management, knowledge discovery, pp. 324–327. Simulation Councils Inc., San Diego (1995)

    Google Scholar 

  34. Stefanowski, J.: On rough set based approaches to induction of decision rules. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Data Mining and Knowledge Discovery, vol. 1, pp. 500–529. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  35. Stefanowski, J.: The rough set based rule induction technique for classification problems. In: Proceedings of 6th European Conference on Intelligent Techniques and Soft Computing, EUFIT 98, Aachen, 7-10 Sep. 1998, pp. 109–113 (1998)

    Google Scholar 

  36. Stefanowski, J.: Multiple and hybrid classifiers. In: Polkowski, L. (ed.) Formal Methods and Intelligent Techniques in Control, Decision Making, Multimedia and Robotics, Post-Proceedings of 2nd Int. Conference, Warszawa, pp. 174–188 (2001)

    Google Scholar 

  37. Stefanowski, J.: Algorithims of rule induction for knowledge discovery (In Polish), Habilitation Thesis published as Series Rozprawy no. 361, Poznan Univeristy of Technology Press, Poznan (2001)

    Google Scholar 

  38. Stefanowski, J.: The bagging and n2-classifiers based on rules induced by MODLEM. In: Tsumoto, S., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 488–497. Springer, Heidelberg (2004)

    Google Scholar 

  39. Stefanowski, J.: An experimental study of methods combining multiple classifiers - diversified both by feature selection and bootstrap sampling. In: Atanassov, K.T., et al. (eds.) Issues in the Representation and Processing of Uncertain and Imprecise Information, pp. 337–354. Akademicka Oficyna Wydawnicza EXIT, Warszawa (2005)

    Google Scholar 

  40. Stefanowski, J., Kaczmarek, M.: Integrating attribute selection to improve accuracy of bagging classifiers. In: Proc. of the AI-METH 2004. Recent Developments in Artificial Intelligence Methods, Gliwice, pp. 263–268 (2004)

    Google Scholar 

  41. Stefanowski, J., Nowaczyk, S.: On using rule induction in multiple classifiers with a combiner aggregation strategy. In: Proc. of the 5th Int. Conference on Intelligent Systems Design and Applications - ISDA 2005, pp. 432–437. IEEE Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  42. Stefanowski, J., Vanderpooten, D.: Induction of decision rules in classification and discovery-oriented perspectives. International Journal of Intelligent Systems 16(1), 13–28 (2001)

    Article  MATH  Google Scholar 

  43. Stefanowski, J., Wilk, S.: Evaluating business credit risk by means of approach integrating decision rules and case based learning. International Journal of Intelligent Systems in Accounting, Finance and Management 10, 97–114 (2001)

    Article  Google Scholar 

  44. Szczuka, M.: Refining classifiers with neural networks. International Journal of Intelligent Systems 16(1), 39–56 (2001)

    Article  MATH  Google Scholar 

  45. Valentini, G., Masuli, F.: Ensambles of learning machines. In: Marinaro, M., Tagliaferri, R. (eds.) Neural Nets. LNCS, vol. 2486, pp. 3–19. Springer, Heidelberg (2002)

    Google Scholar 

  46. Wang, H., et al.: Hyperrelations in version space. International Journal of Approximate Reasoning 23, 111–136 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  47. Ziarko, W.: Variable precision rough sets model. Journal of Computer and Systems Sciences 46(1), 39–59 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

James F. Peters Andrzej Skowron Ivo Düntsch Jerzy Grzymała-Busse Ewa Orłowska Lech Polkowski

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this chapter

Cite this chapter

Stefanowski, J. (2007). On Combined Classifiers, Rule Induction and Rough Sets. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J., Orłowska, E., Polkowski, L. (eds) Transactions on Rough Sets VI. Lecture Notes in Computer Science, vol 4374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71200-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71200-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71198-8

  • Online ISBN: 978-3-540-71200-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics