Efficient Data Stream Clustering With Sliding Windows Based on Locality-Sensitive Hashing

Data stream clustering over sliding windows generates clusters as the window moves. However, iterative clustering using all data in a window is highly inefficient in terms of memory use and computational load. In this paper, we improve data stream clustering over sliding windows using sliding window...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2018, Vol.6, p.63757-63776
Main Authors: Youn, Jonghem, Shim, Junho, Lee, Sang-Goo
Format: Article
Language:English
Subjects:
Agglomeration
Algorithms
Approximation algorithms
Clustering
Clustering algorithms
Data models
Data stream
Data structures
Data transmission
Iterative methods
k-means clustering
locality-sensitive hashing
Microsoft Windows
Partitioning algorithms
Sliding
sliding window
Windows
Windows (computer programs)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Data stream clustering over sliding windows generates clusters as the window moves. However, iterative clustering using all data in a window is highly inefficient in terms of memory use and computational load. In this paper, we improve data stream clustering over sliding windows using sliding window aggregation and nearest neighbor search techniques. Our algorithm constructs and maintains temporal group features as a summary of the window using the sliding window aggregation technique. In order to maintain a constant size for the summary, the algorithm reduces the size of the summary by joining the nearest neighbor. We exploit locality-sensitive hashing for rapid nearest neighbor searching. In addition, we also suggest a re-clustering policy that determines whether to append a new summary to pre-existing clusters or to perform clustering on the whole summary. We conduct experiments on real-world and synthetic datasets in order to demonstrate that our algorithm can significantly improve continuous clustering on data streams with sliding windows.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2877138