Skip to main content

Reducts Evaluation Methods Using Lazy Algorithms

  • Conference paper
Book cover Rough Sets and Knowledge Technology (RSKT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5589))

Included in the following conference series:

  • 2616 Accesses

Abstract

In the paper two algorithms for reducts evaluation have been proposed. Presented methods use lazy algorithms to calculate the number of deterministic and inhibitory decision rules. Calculated values are used later to estimate the quality of the reducts. The two proposed algorithms have polynomial time complexity. The results obtained by both approaches were compared with performance of the two classifiers k-NN and Naive Bayesian Classifier.

All algorithms were tested on several benchmark data sets from the UCI Repository of Machine Learning Databases [3].

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.G.: Methods of Approximate Reasoning for Synthesis of Decision Algorithms. PhD thesis, Warsaw University (1998) (in Polish)

    Google Scholar 

  2. Bazan, J.G., Szczuka, M., Wojna, A.G., Wojnarski, M.: On the Evolution of Rough Set Exploration System. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS, vol. 3066, pp. 592–601. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Data Bases, Department of Information and Computer Science, University of California, Irvine, CA (1998), http://www.ics.uci.edu/mlearn/mlrepository.html

  4. Delimata, P., Moshkov, M., Skowron, A., Suraj, Z.: Inhibitory Rules in Data Analysis. A Rough Set Approach. Springer, Heidelberg

    Google Scholar 

  5. Delimata, P., Suraj, Z.: Feature Selection Algorithm for Multiple Classifier Systems: A Hybrid Approach. Fundamenta Informaticae 85(1-4), 97–110 (2008)

    MATH  Google Scholar 

  6. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  Google Scholar 

  7. Suraj, Z., Delimata, P.: Data Mining Exploration System for Feature Selection Tasks. In: Proceedings of the International Conference on Hybrid Information Technology (ICHIT 2006), pp. 284–286. IEEE CS, Los Alamitos (2006)

    Chapter  Google Scholar 

  8. Suraj, Z., Gayar, N., Delimata, P.: A Rough Set Approach to Multiple Classifier Systems. Fundamenta Informaticae 72(1-3), 393–406 (2006)

    MATH  Google Scholar 

  9. Wojna, A.G.: Analogy-Based Reasonning in Classifier Construction. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV. LNCS, vol. 3700, pp. 277–374. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delimata, P., Suraj, Z. (2009). Reducts Evaluation Methods Using Lazy Algorithms. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02962-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02961-5

  • Online ISBN: 978-3-642-02962-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics