Skip to main content

Extracting Incidental and Global Knowledge through Compact Pattern Trees in Distributed Environment

  • Conference paper
Book cover Rough Sets and Knowledge Technology (RSKT 2012)

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

Included in the following conference series:

  • 1512 Accesses

Abstract

This paper proposes to extract incidental and global knowledge through Compact Pattern Trees in a hierarchical structure through distributed and parallel computing paradigm. This method also facilitates privacy preserving with a minimal communication load. We present the experiments on different kinds of benchmark datasets for proposed mechanism.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guo, Y., Rueger, S., Sutiwaraphun, J., Forbes-Millot, J.: Meta-learning for parallel data mining. In: Proceedings of the Seventh Parallel Computing Workshop (1997)

    Google Scholar 

  2. Subramonian, R., Parthasarathy, S.: A framework for distributed data mining. In: Proceedings of Workshop on Distributed Data Mining, alongwith KDD 1989 (August 1998)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Privacy-Preserving Data Mining. In: ACM SIGMOD Int. Conf. on Management of Data, Dallas (2000)

    Google Scholar 

  4. Tanbeer, S.K., Ahmed, C.F., Jeong, B.S., Lee, Y.K.: Efficient single-pass frequent pattern mining using a prefix tree. Information Sciences 179, 559–583 (2008)

    Article  MathSciNet  Google Scholar 

  5. Vishnu Priya, R., Vadivel, A., Thakur, R.S.: Frequent Pattern Mining Using Modified CP-Tree for Knowledge Discovery. In: Cao, L., Feng, Y., Zhong, J. (eds.) ADMA 2010, Part I. LNCS, vol. 6440, pp. 254–261. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Syed, K.T., Chowdhury, F.A., Jeong, B.S.: Parallel and Distributed Frequent Pattern Mining in Large Databases. In: Proc. HPCC 2009, pp. 407–414. IEEE, Seoul (2009)

    Google Scholar 

  7. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: International Conference on Management of Data (2000)

    Google Scholar 

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

Swarupa Rani, K., Kamakshi Prasad, V., Raghavendra Rao, C. (2012). Extracting Incidental and Global Knowledge through Compact Pattern Trees in Distributed Environment. 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_31

Download citation

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

  • 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