SOStream: self organizing density-based clustering over data stream

Authors:
Charlie Isaksson;Margaret H. Dunham;Michael Hahsler
Affiliations:
Department of Computer Science and Engineering, Southern Methodist University, Dallas, Texas;Department of Computer Science and Engineering, Southern Methodist University, Dallas, Texas;Department of Computer Science and Engineering, Southern Methodist University, Dallas, Texas
Venue:
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
Year:
2012

Citing 10
Cited 1

BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
CURE: an efficient clustering algorithm for large databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Unsupervised Clustering In Streaming Data

ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Density-based clustering for real-time stream data

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for clustering evolving data streams

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A framework for projected clustering of high dimensional data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
E-Stream: Evolution-Based Technique for Stream Clustering

ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Density-based clustering of data streams at multiple resolutions

ACM Transactions on Knowledge Discovery from Data (TKDD)
Visualising the cluster structure of data streams

IDA'07 Proceedings of the 7th international conference on Intelligent data analysis

Data stream clustering: A survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a data stream clustering algorithm, called Self Organizing density based clustering over data Stream (SOStream). This algorithm has several novel features. Instead of using a fixed, user defined similarity threshold or a static grid, SOStream detects structure within fast evolving data streams by automatically adapting the threshold for density-based clustering. It also employs a novel cluster updating strategy which is inspired by competitive learning techniques developed for Self Organizing Maps (SOMs). In addition, SOStream has built-in online functionality to support advanced stream clustering operations including merging and fading. This makes SOStream completely online with no separate offline components. Experiments performed on KDD Cup'99 and artificial datasets indicate that SOStream is an effective and superior algorithm in creating clusters of higher purity while having lower space and time requirements compared to previous stream clustering algorithms.