Skip to main content

Reducts in Incomplete Decision Tables

  • Conference paper
Advanced Data Mining and Applications (ADMA 2005)

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

Included in the following conference series:

  • 2346 Accesses

Abstract

Knowledge reduction is an important issue in data mining. This paper focuses on the problem of knowledge reduction in incomplete decision tables. Based on a concept of incomplete conditional entropy, a new reduct definition is presented for incomplete decision tables and its properties are analyzed. Compared with several existing reduct definitions, the new definition has a better explanation for knowledge uncertainty and is more convenient for application of the idea of approximate reduct in incomplete decision tables.

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. Pawlak, Z.: Rough Set. Int. J. of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Pawlak, Z., Grzymala-Busse, J.W., Slowinski, R., Ziarko, W.: Rough Sets. Communications on the ACM 38, 89–95 (1995)

    Article  Google Scholar 

  3. Susmaga, R.: Reducts and Constructs in Attribute Reduction. Fundamenta Informaticae 61, 159–181 (2004)

    MATH  MathSciNet  Google Scholar 

  4. Slezak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53, 365–390 (2002)

    MathSciNet  Google Scholar 

  5. Kryszkiewicz, M.: Rough Set Approach to Incomplete Information Systems. Information Sciences 112, 39–49 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zhou, X.Z., Huang, B.: Rough Set-based Attribute Reduction under Incomplete Information Systems. Journal of Nanjing University of Science and Technology 27, 630–635 (2003)

    Google Scholar 

  7. Li, R.P., Wang, Z.O.: An Entropy-based Discretization Method for Classification Rules with Inconsistency Checking. In: Proceedings of 2002 ICMLC, pp. 243–246. IEEE Press, Beijing (2002)

    Google Scholar 

  8. Wang, G.Y., Yu, H., Yang, D.C.: Decision Table Reduction Based on Conditional Information Entropy. Chinese Journal of Computers 25, 759–766 (2002)

    MathSciNet  Google Scholar 

  9. Duntsch, I., Gediga, G.: Uncertainty Measures of Rough Set Prediction. Artificial Intelligence 106, 109–137 (1998)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, R., Huang, D. (2005). Reducts in Incomplete Decision Tables. In: Li, X., Wang, S., Dong, Z.Y. (eds) Advanced Data Mining and Applications. ADMA 2005. Lecture Notes in Computer Science(), vol 3584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527503_20

Download citation

  • DOI: https://doi.org/10.1007/11527503_20

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31877-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics