Skip to main content

A Novel Maximum Distribution Reduction Algorithm for Inconsistent Decision Tables

  • Conference paper
Knowledge Science, Engineering and Management (KSEM 2006)

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

Abstract

A maximum distribution reduction is meant to preserve not only all deterministic information with respect to decision attributes but also the largest possible decision class for each object of an inconsistent decision table. Hence, it is useful to compute this type of reduction when mining decision tables with data inconsistency. This paper presents a novel algorithm for finding a maximum distribution reduct of an inconsistent decision table. Two functions of attribute sets are introduced to characterize a maximum distribution reduct in a new and simple way and then used as a heuristic in the algorithm to search for a reduction. Complexity analysis of the algorithm is also presented. As an application example, the presented algorithm was applied to mine a real surgery database and some interesting results were obtained.

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., Slowinski, R.: Rough set approach to multi-attribute decision analysis. European Journal of Operational Research 72, 443–459 (1994)

    Article  MATH  Google Scholar 

  2. 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 Knowledge Discovery, pp. 321–365. Physica-Verlag, Heideberg (1998)

    Google Scholar 

  3. Kryszkiewicz, M.: Comparative studies of alternative type of knowledge reduction in inconsistent systems. International Journal of Intelligent Systems 16, 105–120 (2001)

    Article  MATH  Google Scholar 

  4. Wenxiu, Z., Jusheng, M., Weizhi, W.: Knowledge reductions in inconsistent information systems. Chinese Journal of Computers 26, 12–18 (2003)

    Google Scholar 

  5. Dongyi, Y., Zhaojiong, C.: A New discernibility matrix and the computation of a core. Acta Eletronica Sinica 30, 1086–1088 (2002)

    Google Scholar 

  6. Guoyin, W.: Rough set and knowledge aquisition. Xian Jiaotong Unversity Press (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ye, D., Chen, Z., Yu, C. (2006). A Novel Maximum Distribution Reduction Algorithm for Inconsistent Decision Tables. In: Lang, J., Lin, F., Wang, J. (eds) Knowledge Science, Engineering and Management. KSEM 2006. Lecture Notes in Computer Science(), vol 4092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811220_46

Download citation

  • DOI: https://doi.org/10.1007/11811220_46

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37035-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics