Skip to main content

A New Attribute Reduction Algorithm Based on Classification Closeness Function

  • Conference paper
Information Computing and Applications (ICICA 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 106))

Included in the following conference series:

  • 1494 Accesses

Abstract

The classical attribute reduction algorithm and its extended algorithms base on information systems with decision attributes and can not be applied to attribute reduction of no decision attributes information systems. So, based on rough set theory, the results of two condition attribute sets are compared with the method of set pair analysis in this paper, and then classification contribution degree from one to the other and classification closeness function between the two sets are constructed. A new method of attribute reduction based on classification closeness degree is given. Finally, a case study proved that this method is feasible.

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 sets. International Journal of Computer and Information Science 11(5), 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Zhao, K.: Set pair analysis and its preliminary application. Zhejiang Science and Technology Press, Hangzhou (2000)

    Google Scholar 

  3. Zhou, C.: On Attribute Reduction Based on Rough Set Theory. Master thesis. Hefei University of Technology, Hefei (2008)

    Google Scholar 

  4. Skowron, A., Rauszer, C.: The discemibility matriees and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision SuPPort, Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kuwer Academie Publishers, Dordreeht (1992)

    Google Scholar 

  5. Wang, Q., Fan, Z., Cai, Q.: Research on Reduction of Knowledge. Mini-Micro System 21(6), 623–627 (2000)

    Google Scholar 

  6. Miao, D., Hu, G.: A Heuristic Algorithm for Reduction of Knowledge. Journal of Computer Research & Development 36(6), 681–684 (1999)

    Google Scholar 

  7. Wang, G., Yu, H., Yang, D.: Decision Table Reduction based on Conditional Information Entropy. Chinese J. Computers 25(7), 759–766 (2002)

    MathSciNet  Google Scholar 

  8. Hu, K.: Research on Data Mining Method Based on Concept Lattice and Rough Set. PhD thesis. Tsinghua University, Beijing (2001)

    Google Scholar 

  9. Wang, J., Wang, J.: A kind of reduction algorithms based on diseemibility matrix: The ordered attributes method. J. Computer and Technology 16(6), 489–504 (2001)

    Article  MATH  Google Scholar 

  10. Su, Q., Wang, J.: Reduct and attribute order. Journal of Computer Science and Technology 19(4), 1429–1449 (2004)

    MathSciNet  Google Scholar 

  11. Hong, T.P., Tseng, L.H., Wang, S.L.: Learning rules from incomplete training examples by Rough sets. Expert Systems with Applications 22, 285–293 (2002)

    Article  Google Scholar 

  12. Jakub, W.: A Parallel Algorithm for Knowledge discovery System. In: Proc. of PARELEC 1998, pp. 228–230. Press Syndieate of the Technical University of Bialystok, Bialystok (1998)

    Google Scholar 

  13. Tan, Z., Wu, Y., Wang, G.: A Partition Algorithm for Huge Data Sets Based on Rough Set. PR & AL 19(2), 249–256 (2006)

    Google Scholar 

  14. Sunm, T., Dong, L., Li, J., et al.: Parallel Algorithm for Rough Set Reduction. Journal of Jilin University (Science Edition) 44(2), 211–216 (2006)

    Google Scholar 

  15. Su, J., Gao, J.: A Meta-information-Based Method for Rough Sets Rule Parallel Mining. Computer Science 30(3), 35–39 (2003)

    Google Scholar 

  16. Bazan, G.J.: A comparison of dynamic non-dynamic rough set methods for extracting laws from decision tables. In: Rough Set Methods and Applications, pp. 321–365. Physieaverlag (1998)

    Google Scholar 

  17. Hu, X.: Research on Model Extracting knowledge from the database. PhD thesis. Hefei University of Technology, Hefei (2000)

    Google Scholar 

  18. Hu, X., Lin, T.Y., Han, X.: A new rough sets model based on database systems. In: Wang, G., et al. (eds.) RSFDGrC. LNCS (LNAI), vol. 2639, pp. 114–121. Springer, Heidelberg (2003)

    Google Scholar 

  19. Zhang, C., Xu, G., Liu, B.: The Method of Set Pair Analysis Based on Rough Set Theory. Journal of Hebei Institute of Technology 28(1), 97–100 (2006)

    Google Scholar 

  20. Liu, B., Yang, Y., Li, Y.: Construction of Set Pair Knowledge Connection Function and Application. In: Proceeding of International Conference on Machine Learning and Computing (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mi, C., Yang, Y., Xu, J. (2010). A New Attribute Reduction Algorithm Based on Classification Closeness Function. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16339-5_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16339-5_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16338-8

  • Online ISBN: 978-3-642-16339-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics