Advertisement

Efficient Attribute Reduction Algorithm

  • Zhongzhi Shi
  • Shaohui Liu
  • Zheng Zheng
Chapter
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 154)

Abstract

Efficiency of algorithms is always an important issue concerned by so many researchers. Rough set theory is a valid tool to deal with imprecise problems. However, some of its algorithms’ consuming time limits the applications of rough set. According to this, our paper analyzes the reasons of rough set algorithms’ inefficiency by focusing on two important factors: indiscernible relation and positive region, and analyzes an equivalent and efficient method for computing positive region. And according to our research on the efficiency of some basic issues of rough set, a complete algorithm for the reduction of attributes is designed and its completeness is proved. Theoretical analysis and experimental results illustrate that our reduction algorithm is more efficient than some other algorithms.

Key words

Rough set Positive region Attribute Core Attribute reduction algorithm Discernibility matrix 

References

  1. 1.
    Z. Pawlak. Rough Sets, International Journal of Computer and Information Science, 1982, 11(5): 341~356zbMATHMathSciNetGoogle Scholar
  2. 2.
    Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data, Dordrecht: Kluwer Academic Publishers 1991Google Scholar
  3. 3.
    A. Skowron. Rough Sets and Boolean Reasoning, In: W. Pedrycz ed. Granular Computing: An emerging Paradigm, New York: Physica-Verlag 2001Google Scholar
  4. 4.
    Q. Liu, Rough Set and Rough Reasoning, Scientific Press, 2001Google Scholar
  5. 5.
    W. Ziako. Rough Sets: Trends, Challenges, and Prospects, In: W. Ziarko, Y. Y. Yao ed. Rough Sets and Current Trends in Computing (RSCTC 2000), Berlin: Springer-verlag, 2001Google Scholar
  6. 6.
    Q. Liu, S.H. Huang, L.W Yao, Rough Set Theory: Present State And Prospects, Computer Science, 1997, 24(4): 1~5Google Scholar
  7. 7.
    J. Wang, D.Q. Miao, Rough Set Thoery and Its Application: A Survey, Pattern Recognition And Artificial Intelligence, 1996, 9(4): 337~344Google Scholar
  8. 8.
    A. Skowron, C. Rauszer. The Discernibility Matrics and Functions in Inforamtion System. In: R. Slowinski edIntelligent Decision Support Handbook of Applications and Advances of the Rough Sets Theory. Dordrecht: Kluwer Academic Publishers, 1992, 331~362Google Scholar
  9. 9.
    X.H. Hu, N. Cercone Learning in Relational Databases: A Rough Set Approach., International Journal of Computational Intelligence, 1995, 11(2): 323~338Google Scholar
  10. 10.
    J. Jelonek, K. Krawiec, R. Slowinski. Rough Set Reduction of Attributes and Their Domains for Neural Networks, International Journal of Computational Intelligence, 1995, 11(2): 339~347Google Scholar
  11. 11.
    Q. Liu, S.H. Liu, F. Zheng, Rough Logic And Its Applications, Journal of Software, 2001, 12(3):415□419 Google Scholar
  12. 12.
    J. Wang, R. Wang, D.Q. Miao, Data Enriching Based on Rough Set Theory, Chinese Journal of Software, 1998, 21(5): 393~399Google Scholar
  13. 13.
    D. Pan, Q.L. Zheng, An Adaptive Searching Opima: Algorithm for The Attribute Reducts, Journal of Computer Research & Development, 2001, 38(8)904~910 Google Scholar
  14. 14.
    D.Q. Miao, G.R. Hu, A Heuristic Algorithm for Reduction of Knowledge, Journal of Computer Research & Development, 1999, 36(6): 681~684Google Scholar
  15. 15.
    J. Wang, J. Wang. Reduction Algorithms Based on Discernbility Matrix: The Ordered Attributes Method, Journal of Computer Science & Technology, 2001, 16(6): 489~504Google Scholar
  16. 16.
    J.W. Guan, D.A. Bell. Rough Computational Methods for Information Systems, Artificial Intelligences, 105 (1998): 77R~103Google Scholar
  17. 17.
    L.Y. Chang, G.Y. Wang, Y. Wu, An Approach for Attribute Reduction and Rule Generation Based on Rough Set Theory, Journal of Software, 1999, 10(11): 1206~1211Google Scholar
  18. 18.
    N. Zhong, A. Skowron, S. Ohsuga (Eds.) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing(RSFDGrC’99), Berlin: Springer-Verlag, 1999Google Scholar
  19. 19.
    E. Orlowska. (Ed.) Incomplete Information: Rough Set Analysis, New York: Physica-Verlag, 1998Google Scholar
  20. 20.
    W.X. Zhang, W.Z. Wu, J.Y. Liang, D.Y. Li, Rough Set Theory And Methods, Scientific Press, 2001Google Scholar
  21. 21.
    J. Wroblewski, Finding Minimal Reducts Using Genetic Algorithm, ICS Research report 16/95, Warsaw University of TechnologyGoogle Scholar
  22. 22.
    W. Ziarko, The Discovery, Analysis, and Representation of Data Dependencies In Database, in G. Piatesky-Shapiro, W. Frawley (eds), Proceedings of the IJCAI Workshop On Knowledge Discovery, AAAI Press, 1991, 195~212Google Scholar
  23. 23.
    S.K.M. Wong, W. Ziarko, On Optimal Decision Rules in Decision Tables, Bulletin, Polish Academy of Sciences, 1985, 33(11–12): 693~696Google Scholar
  24. 24.
    G.Y. Wang, Rough Set Theory and Knowledge Acquisition, Press of Xi’an Jiaotong University, 2001Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2004

Authors and Affiliations

  • Zhongzhi Shi
    • 1
  • Shaohui Liu
    • 1
  • Zheng Zheng
    • 1
  1. 1.Institute Of Computing TechnologyChinese Academy of SciencesBeijingChina

Personalised recommendations