Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

 

Contact Us >>

WhatsApp  +86 18163351462(WhatsApp)
   
Paper Publishing WeChat
Book Publishing WeChat
(or Email:book@scirp.org)

Article citations

More>>

C. C. Aggarwal, J. Han, J. Wang and P. S. Yu, “A Framework for Projected Clustering of High Dimensional Data Streams,” Proceedings of the Thirtieth International Conference on Very Large Data Bases, Vol. 30, VLDB, 2004, pp. 852-863.

has been cited by the following article:

  • TITLE: LeaDen-Stream: A Leader Density-Based Clustering Algorithm over Evolving Data Stream

    AUTHORS: Amineh Amini, Teh Ying Wah

    KEYWORDS: Evolving Data Streams; Density-Based Clustering; Micro Cluster; Mini-Micro Cluster

    JOURNAL NAME: Journal of Computer and Communications, Vol.1 No.5, November 8, 2013

    ABSTRACT: Clustering evolving data streams is important to be performed in a limited time with a reasonable quality. The existing micro clustering based methods do not consider the distribution of data points inside the micro cluster. We propose LeaDen-Stream (Leader Density-based clustering algorithm over evolving data Stream), a density-based clustering algorithm using leader clustering. The algorithm is based on a two-phase clustering. The online phase selects the proper mini-micro or micro-cluster leaders based on the distribution of data points in the micro clusters. Then, the leader centers are sent to the offline phase to form final clusters. In LeaDen-Stream, by carefully choosing between two kinds of micro leaders, we decrease time complexity of the clustering while maintaining the cluster quality. A pruning strategy is also used to filter out real data from noise by introducing dense and sparse mini-micro and micro-cluster leaders. Our performance study over a number of real and synthetic data sets demonstrates the effectiveness and efficiency of our method.