Skip to main content

A Heuristic Algorithm for Attribute Reduction Based on Discernibility and Equivalence by Attributes

  • Conference paper
Modeling Decisions for Artificial Intelligence (MDAI 2009)

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

Abstract

In this paper, we consider a heuristic method to partially calculate relative reducts with better evaluation by the evaluation criterion proposed by the authors. By considering discernibility and equivalence of elements with respect to values of condition attributes that appear in relative reducts, we introduce an evaluation criterion of condition attributes, and consider a heuristic method for calculating a relative reduct with better evaluation.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hedar, A.H., Wang, J., Fukushima, M.: Tabu search for attribute reduction in rough set theory. Soft Couping 12(9), 909–918 (2008)

    Article  MATH  Google Scholar 

  2. Hu, F., Wang, G., Feng, L.: Fast Knowledge Reduction Algorithms Based on Quick Sort. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 72–79. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Kudo, Y., Murai, T.: A Heuristic Algorithm for Selective Calculation of a Better Relative Reduct in Rough Set Theory. In: Nakamatsu, K., et al. (eds.) New Advances in Intelligent Decision Technologies. SCI, vol. 199, pp. 555–564. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Kudo, Y., Murai, T.: On an Approximate Calculation Method of a Relative Reduct Based on Classification by Condition Attributes. In: Proc. of the 25th Fuzzy System Symposium, SOFT (2009) (in Japanese)

    Google Scholar 

  5. Mori, N., Tanaka, H., Inoue, K.: Rough Sets and Kansei —Knowledge Acquisition and Reasoning from Kansei Data—. Kaibundo (2004) (in Japanese)

    Google Scholar 

  6. Nakaura, T., Kudo, Y., Murai, T.: On an Evaluation Method of Relative Reducts Based on Classification by Condition Attributes. In: Proc. of the 25th Fuzzy System Symposium, SOFT (2009) (in Japanese)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Pawlak, Z.: On Rough Dependency of Attributes in Information Systems. Bulletin of the Polish Academy of Sciences, Technical Sciences 33, 481–485 (1985)

    MATH  MathSciNet  Google Scholar 

  9. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  10. Pawlak, Z., Słowiński, R.: Rough Set Approach to Multi-Attribute Decision Analysis. European Journal of Operation Research 74, 443–459 (1994)

    Article  Google Scholar 

  11. Polkowski, L.: Rough Sets: Mathematical Foundations. In: Advances in Soft Computing. Physica-Verlag, New York (2002)

    Google Scholar 

  12. Skowron, A., Rauszer, C.M.: The discernibility matrix and functions in information systems. In: Słowiński, R. (ed.) Intelligent Decision Support: Handbook of Application and Advance of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  13. Ślȩzak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53(3-4), 365–387 (2002)

    MathSciNet  Google Scholar 

  14. http://archive.ics.uci.edu/ml/index.html

  15. Xu, J., Sun, L.: New Reduction Algorithm Based on Decision Power of Decision Table. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 180–188. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Xu, Z., Zhang, C., Zhang, S., Song, W., Yang, B.: Efficient Attribute Reduction Based on Discernibility Matrix. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., Ślȩzak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 13–21. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Yamaguchi, D.: On the Improvement of Pawlak’s Attribute Dependency Model. In: Proc. of the 2nd International Conference on Kansei Engineering and Affective Systems, JSKE, pp. 83–88 (2008)

    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

Kudo, Y., Murai, T. (2009). A Heuristic Algorithm for Attribute Reduction Based on Discernibility and Equivalence by Attributes. In: Torra, V., Narukawa, Y., Inuiguchi, M. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2009. Lecture Notes in Computer Science(), vol 5861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04820-3_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04820-3_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04819-7

  • Online ISBN: 978-3-642-04820-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics