Abstract

In order to improve the execution time and clustering quality of sequence clustering algorithm in large-scale dynamic dataset, a novel algorithm RPCAISC (Representative Points and Cluster Attributes Based Incremental Sequence Clustering) was presented. In this paper, density factor is defined. The primary representative point that has a density factor less than the prescribed threshold will be deleted directly. New representative points can be reselected from non-representative points. Moreover, the representative points of each cluster are modeled using the K-nearest neighbor method. The definition of the relevant degree (RD) between clusters was also proposed. The RD is computed by comprehensively considering the correlations of objects within a cluster and between different clusters. Then, whether the two clusters need to merge is determined. Additionally, the cluster attributes of the initial clustering are retained with this process. By calculating the matching degree between the incremental sequence and the existing cluster attributes, dynamic sequence clustering can be achieved. The theoretic experimental results and analysis prove that RPCAISC has better correct rate of clustering results and execution efficiency.

Keywords

Cite this article

@article{cai-2740,
  author  = {Di Wu and Jiadong Ren},
  title   = {Representative Points and Cluster Attributes Based Incremental Sequence Clustering Algorithm},
  journal = {Computing and Informatics},
  volume  = {36},
  number  = {6},
  pages   = {1361--1384},
  year    = {2017},
  issn    = {1335-9150},
  doi     = {10.4149/cai_2017_6_1361}
}
Download .bib