Skip to main content

Information System Attribute Reduction Parallel Algorithm Based on Information Entropy

  • Conference paper
Future Control and Automation

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 173))

Abstract

Attribute reduction is an important treatment in information system. Classification is the base of attribute reduction, but it is inefficient to reduce attribute directly on a large data set. This paper put forward an attribute reduction parallel algorithm based on information entropy. The algorithm reduces attribute at the same time breakdowns original information system layer by layer, as a result, achieve attribute reduction parallel calculate and shrink the search space.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Wong, S.K.M., Ziarko, W.: On Optimal Decision Rules in Decision Tables, pp. 693–696. Bulletin of Polish Academy of Science, Poland (1985)

    Google Scholar 

  2. Xiaoju, W., Yun, J., Yonghua, L.: Significance of attribute evaluation based on dependable difference. Computer Technology and Development 19(1), 67–70 (2009)

    Google Scholar 

  3. Xu, F., Li, T., Li, H.: An improved discernibility matrix and the computation of the core. Computer Engineering & Science 31(2), 53–55 (2009)

    Google Scholar 

  4. Miao, D., Hu, G.: A heuristic algorithm for reduction of knowledge. Journal of Computer Research & Development 36(6), 681–684 (1999)

    Google Scholar 

  5. Mao, D., Li, D.: Rough Sets Theory Algorithms and Applications, pp. 139–170. Tsinghua University press, Beijing (2008)

    Google Scholar 

  6. Jiang, D.: Information Theory & Coding, 2nd edn., pp. 1–80. University of Technology Science and Technology of China Press, Hefei (2004)

    Google Scholar 

  7. Tian, H., Yan, L., Liu, X.: Data-table decomposition algorithm based on rough set. Computer Engineering and Design 30(5), 1198–1200 (2009)

    Google Scholar 

  8. Hu, X.H., Nick, C.: Learning in relational databases: A rough set approach. International Journal of Computational Intelligence 11(2), 323–338 (1995)

    Google Scholar 

  9. Ge, H., Li, L., Yang, C.: Improvement to quick attribution reduction algorithm. Journal of Chinese Computer Systems 30(2), 308–312 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chunlin Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, C., Zhang, Z., Zhang, J. (2012). Information System Attribute Reduction Parallel Algorithm Based on Information Entropy. In: Deng, W. (eds) Future Control and Automation. Lecture Notes in Electrical Engineering, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31003-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31003-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31002-7

  • Online ISBN: 978-3-642-31003-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics