Paper
28 March 2005 Highly efficient incremental estimation of Gaussian mixture models for online data stream clustering
Author Affiliations +
Abstract
We present a probability-density-based data stream clustering approach which requires only the newly arrived data, not the entire historical data, to be saved in memory. This approach incrementally updates the density estimate taking only the newly arrived data and the previously estimated density. The idea roots on a theorem of estimator updating and it works naturally with Gaussian mixture models. We implement it through the expectation maximization algorithm and a cluster merging strategy by multivariate statistical tests for equality of covariance and mean. Our approach is highly efficient in clustering voluminous online data streams when compared to the standard EM algorithm. We demonstrate the performance of our algorithm on clustering a simulated Gaussian mixture data stream and clustering real noisy spike signals extracted from neuronal recordings.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mingzhou Song and Hongbin Wang "Highly efficient incremental estimation of Gaussian mixture models for online data stream clustering", Proc. SPIE 5803, Intelligent Computing: Theory and Applications III, (28 March 2005); https://doi.org/10.1117/12.601724
Lens.org Logo
CITATIONS
Cited by 105 scholarly publications and 2 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Expectation maximization algorithms

Data modeling

Estimation theory

Computer simulations

Data centers

Detection and tracking algorithms

Performance modeling

Back to Top