ACM Home Page
Please provide us with feedback. Feedback
A method for clustering transient data streams
Full text PdfPdf (315 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
POSTER SESSION: Poster papers table of contents
Pages 1518-1519  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
Pimwadee Chaovalit  University of Maryland, Baltimore County
Aryya Gangopadhyay  University of Maryland, Baltimore County
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 48,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529622
What is a DOI?

ABSTRACT

This paper describes a novel method for clustering single and multi-dimensional data streams. With incremental computation of the incoming data, our method determines if the cluster formation should change from an initial cluster formation. Four main types of cluster evolutions are studied: cluster appearance, cluster disappearance, cluster splitting, and cluster merging. We present experimental results of our algorithms both in terms of scalability and cluster quality, compared with recent work in this area.



Collaborative Colleagues:
Pimwadee Chaovalit: colleagues
Aryya Gangopadhyay: colleagues