Skip to main content

A Density Granularity Grid Clustering Algorithm Based on Data Stream

  • Conference paper
Emerging Research in Web Information Systems and Mining (WISM 2011)

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

Included in the following conference series:

  • 902 Accesses

Abstract

In the field of data mining, conventional algorithms aren’t very suitable for data stream analysis mainly because these algorithms can not adapt to the dynamic environment of data stream mining process, and mining model and mining results can not meet the users’ actual application. To this problem, this paper presents a density granularity grid clustering algorithm to effectively accomplish the analysis task of data stream. The algorithm breaks the shackles of the traditional clustering algorithms, divides the entire mining process into off-line and on-line, and finally realizes the data stream clustering.

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. Barbara, D.: Requirements for Clustering Data Streams. SIGKDD Explorations 1, 23–27 (2008)

    Google Scholar 

  2. Aggarwal, C.C., Han, J.w., Wang, J., et al.: A Framework for Clustering Evolving Data Streams. In: Proceedings of the 29th VLDB Conference, Berlin, Germany, vol. 1, pp. 87–90 (2010)

    Google Scholar 

  3. Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: ACM SIGMOD Conference, vol. 3, pp. 200–201 (2010)

    Google Scholar 

  4. Agrawal, R., Gehrke, J., Gunopulos, D., et al.: Subspace Clustering of High Dimensional Data for Data Mining Applications. In: ACM SIGMOD Conference, vol. 1, pp. 115–116 (2010)

    Google Scholar 

  5. Guha, S., Mishra, N., Motwani, R.: Clustering data streams. In: Proc.41st IEEE Symp. on Foundations of Computer Science, vol. 6, pp. 359–366 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Lf., Han, X. (2011). A Density Granularity Grid Clustering Algorithm Based on Data Stream. In: Zhiguo, G., Luo, X., Chen, J., Wang, F.L., Lei, J. (eds) Emerging Research in Web Information Systems and Mining. WISM 2011. Communications in Computer and Information Science, vol 238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24273-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24273-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24272-4

  • Online ISBN: 978-3-642-24273-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics