Advertisement

A Novel Maximum Distribution Reduction Algorithm for Inconsistent Decision Tables

  • Dongyi Ye
  • Zhaojiong Chen
  • Chunyan Yu
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Decision Table Decision Attribute Decision Class Maximum Distribution Discernibility Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Pawlak, Z., Slowinski, R.: Rough set approach to multi-attribute decision analysis. European Journal of Operational Research 72, 443–459 (1994)MATHCrossRefGoogle Scholar
  2. 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. 3.
    Kryszkiewicz, M.: Comparative studies of alternative type of knowledge reduction in inconsistent systems. International Journal of Intelligent Systems 16, 105–120 (2001)MATHCrossRefGoogle Scholar
  4. 4.
    Wenxiu, Z., Jusheng, M., Weizhi, W.: Knowledge reductions in inconsistent information systems. Chinese Journal of Computers 26, 12–18 (2003)Google Scholar
  5. 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. 6.
    Guoyin, W.: Rough set and knowledge aquisition. Xian Jiaotong Unversity Press (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dongyi Ye
    • 1
  • Zhaojiong Chen
    • 1
  • Chunyan Yu
    • 1
  1. 1.College of Math. and ComputerFuzhou UniversityFuzhouChina

Personalised recommendations