Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Methodologies for Intelligent Systems

ISMIS 2015: Foundations of Intelligent Systems pp 19–28Cite as

Computation of Approximate Reducts with Dynamically Adjusted Approximation Threshold

  • Conference paper
  • First Online:

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

Abstract

We continue our research on dynamically adjusted approximate reducts (DAAR). We modify DAAR computation algorithm to take into account dependencies between attribute values in data. We discuss a motivation for this improvement and analyze its performance impact. We also revisit a filtering technique utilizing approximate reducts to create a ranking of attributes according to their relevance. As an illustration we study a data set from AAIA’14 Data Mining Competition.

Partially supported by Polish National Science Centre grants DEC-2012/05/B/ST6/03215 and DEC-2013/09/B/ST6/01568, and by Polish National Centre for Research and Development grants PBS2/B9/20/2013 and O ROB/0010/03/001.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    https://knowledgepit.fedcsis.org/contest/view.php?id=83.

  2. 2.

    Version 1.2.2 of the package was used in all experiments described in this paper.

References

  1. Guyon, I., Gunn, S., Nikravesh, M., Zadeh, L.A. (eds.): Feature Extraction: Foundations and Applications. STUDFUZZ. Springer, Heidelberg (2006)

    Google Scholar 

  2. Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artif. Intell. 97, 273–324 (1997)

    Article  MATH  Google Scholar 

  3. Kruczyk, M., Baltzer, N., Mieczkowski, J., Dramiński, M., Koronacki, J., Komorowski, J.: Random reducts: a monte carlo rough set-based method for feature selection in large datasets. Fundamenta Informaticae 127(1–4), 273–288 (2013)

    Google Scholar 

  4. Błaszczyński, J., Słowiński, R., Susmaga, R.: Rule-based estimation of attribute relevance. In: Yao, J.T., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS, vol. 6954, pp. 36–44. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Pawlak, Z.: Rough sets: present state and the future. Found. Comput. Decis. Sci. 18(3–4), 157–166 (1993)

    MathSciNet  MATH  Google Scholar 

  6. Świniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recogn. Lett. 24(6), 833–849 (2003)

    Article  MATH  Google Scholar 

  7. Janusz, A., Ślęzak, D.: Rough set methods for attribute clustering and selection. Appl. Artif. Intell. 28(3), 220–242 (2014)

    Article  Google Scholar 

  8. Yao, Y.: The two sides of the theory of rough sets. Knowl.-Based Syst. 80, 67–77 (2015)

    Article  Google Scholar 

  9. Ślęzak, D.: Normalized decision functions and measures for inconsistent decision tables analysis. Fundamenta Informaticae 44(3), 291–319 (2000)

    MathSciNet  MATH  Google Scholar 

  10. Wróblewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae 47(3–4), 351–360 (2001)

    MathSciNet  MATH  Google Scholar 

  11. Janusz, A., Stawicki, S.: Applications of approximate reducts to the feature selection problem. In: Yao, J.T., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS, vol. 6954, pp. 45–50. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Breiman, L.: Random forests. Mach. Learn. 45(1), 5–32 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Janusz, A., Ślęzak, D.: Random probes in computation and assessment of approximate reducts. In: Kryszkiewicz, M., Cornelis, C., Ciucci, D., Medina-Moreno, J., Motoda, H., Raś, Z.W. (eds.) RSEISP 2014. LNCS, vol. 8537, pp. 53–64. Springer, Heidelberg (2014)

    Google Scholar 

  14. Janusz, A., Krasuski, A., Stawicki, S., Rosiak, M., Ślęzak, D., Nguyen, H.S.: Key risk factors for polish state fire service: a data mining competition at knowledge pit. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) Proceedings of FedCSIS 2014, pp. 345–354 (2014)

    Google Scholar 

  15. Jaynes, E.T.: Probability Theory: The Logic of Science. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  16. Riza, L.S., Janusz, A., Bergmeir, C., Cornelis, C., Herrera, F., Ślęzak, D., Benitez, J.M.: Implementing algorithms of rough set theory and fuzzy rough set theory in the r package ‘roughsets’. Inf. Sci. 287, 68–89 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Andrzej Janusz & Dominik Ślęzak

  2. Infobright Inc., ul. Krzywickiego 34, lok. 219, 02-078, Warsaw, Poland

    Dominik Ślęzak

Authors
  1. Andrzej Janusz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominik Ślęzak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dominik Ślęzak .

Editor information

Editors and Affiliations

  1. Computer Science, University of Bari, Bari, Italy

    Floriana Esposito

  2. Enssat, Lannion, France

    Olivier Pivert

  3. LISI-UFR d'Informatique, Université Claude Bernard Lyon 1, Villeurbanne Cedex, France

    Mohand-Said Hacid

  4. University of North Carolina, CHARLOTTE, North Carolina, USA

    Zbigniew W. Rás

  5. Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy

    Stefano Ferilli

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Janusz, A., Ślęzak, D. (2015). Computation of Approximate Reducts with Dynamically Adjusted Approximation Threshold. In: Esposito, F., Pivert, O., Hacid, MS., Rás, Z., Ferilli, S. (eds) Foundations of Intelligent Systems. ISMIS 2015. Lecture Notes in Computer Science(), vol 9384. Springer, Cham. https://doi.org/10.1007/978-3-319-25252-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25252-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25251-3

  • Online ISBN: 978-3-319-25252-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation