A Clustering Algorithm for Data Stream based on Grid-Tree and Similarity


Algorithms based on k-means are incompetent to find clusters of arbitrary shapes, and the number of clusters needs to be pre-specified. Moreover, most grid-based clustering algorithms can not deal with boundary points accurately. To address these issues, a novel approach based on density gird-tree and similarity, DGTSstream, is proposed. In DGTSstream, each… (More)


3 Figures and Tables