Skip to main content

Parallelized Computing of Attribute Core Based on Rough Set Theory and MapReduce

  • Conference paper

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

Abstract

In this paper, computing attribute core for massive data based on rough set theory and MapReduce is studied, two novel algorithms for computing attribute core are proposed. A case study proves the correctness of the proposed algorithms, and the proposed algorithms are shown more efficient according to the experiment results on a real massive dataset.

Part of this work is supported by National Natural Science Foundation of China (No. 61075019), Scientific Research Foundation of Chongqing Municipal Education Commission (No. KJ110522, KJ110512), Natural Science Foundation of Chongqing University of Posts and Telecommunications(No. A2009-26, No. JK-Y-2010002).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Weiss, A.: Computing in Clouds. ACM Networker 11(4), 18–25 (2007)

    Article  Google Scholar 

  2. Dean, J., Ghemmawat, S.: MapReduce: a Flexible Data Processing Tool. Communications of the ACM 53(1), 72–77 (2010)

    Article  Google Scholar 

  3. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Guoyin, W.: Rough Set Theory and Knowledge Acquisition. Xi’an Jiaotong University Press, Xi’an (2001) (in Chinese)

    Google Scholar 

  5. Dongyi, Y., Zhaojiong, C.: A New Discernibility Matrix and The Computation of a Core. Acta Electronica Sinica 30, 1086–1088 (2002)

    Google Scholar 

  6. Zhangyan, X., Bingru, Y., et al.: Quick Computing Core Algorithm Based on Discernibility Matrix. Computer Engineering and Applications 42, 4–6 (2006)

    Google Scholar 

  7. Feng, H., Guoyin, W., Ying, X.: Attribute Core Computation Based on Divide and Conquer Method. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 310–319. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Guoyin, W.: Calculation Methods for Core Attributes of Decision Table. Chinese Journal of Computers 26, 611–615 (2003)

    Google Scholar 

  9. KDDCUP99, http://kdd.ics.uci.edu/databases/kddcup99/

  10. Hadoop MapReduce, http://hadoop.apache.org/mapreduce/

Download references

Author information

Authors and Affiliations

Authors

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, Y., Chen, Z. (2012). Parallelized Computing of Attribute Core Based on Rough Set Theory and MapReduce. In: Li, T., et al. Rough Sets and Knowledge Technology. RSKT 2012. Lecture Notes in Computer Science(), vol 7414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31900-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31900-6_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31899-3

  • Online ISBN: 978-3-642-31900-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics