An EM-based algorithm for clustering data streams in sliding windows
Data(s) |
01/01/2009
|
---|---|
Resumo |
Cluster analysis has played a key role in data understanding. When such an important data mining task is extended to the context of data streams, it becomes more challenging since the data arrive at a mining system in one-pass manner. The problem is even more difficult when the clustering task is considered in a sliding window model which requiring the elimination of outdated data must be dealt with properly. We propose SWEM algorithm that exploits the Expectation Maximization technique to address these challenges. SWEM is not only able to process the stream in an incremental manner, but also capable to adapt to changes happened in the underlying stream distribution.<br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30029056/ong-embasedalgorithm-2009.pdf http://dx.doi.org/10.1007/978-3-642-00887-0_18 |
Direitos |
2009, Springer-Verlag |
Tipo |
Journal Article |