An Efficient Discovering and Maintenance Algorithm of Subspace Clustering over High Dimensional Data Streams

Zhou Xiaoyun, Sun Zhihui, Zhang Baili, and Yang Yidong

Journal of Computer Research and Development > 2006 > 43(5): 834-840.

Zhou Xiaoyun, Sun Zhihui, Zhang Baili, and Yang Yidong. An Efficient Discovering and Maintenance Algorithm of Subspace Clustering over High Dimensional Data Streams[J]. Journal of Computer Research and Development, 2006, 43(5): 834-840.

Citation:

PDF (418 KB)

An Efficient Discovering and Maintenance Algorithm of Subspace Clustering over High Dimensional Data Streams

Zhou Xiaoyun, Sun Zhihui, Zhang Baili, and Yang Yidong

(Department of Computer Science and Engineering, Southeast University, Nanjing 210096)

More Information

Published Date: May 14, 2006

Graphical Abstract

Abstract

Abstract

Data mining based on data stream has become a very hot research field in recent years. In this paper a novel discovering and maintenance algorithm of subspace clustering over high dimensional data streams is presented, which is based on Hoeffding bound and named SHStream. SHStream partitions data streams (the length of each segment is computed by Hoeffding bound), makes subspace clusters on the segments and discovers clusters step-by-step. Meanwhile, focusing on dynamic of data stream, SHStream adjusts and maintains the cluster results. SHStream can deal with high dimensional clustering problem effectively and discover clusters with arbitrary shape through the technology based on grids and density. The experimental results on real datasets and synthetic datasets demonstrate promising availabilities of the approach.
- data stream,
- clustering algorithm,
- subspace clustering,
- Hoeffding bound

FullText(HTML)

References (0)

[1]	Lin Yuxiu, Liu Hui, Yu Xiao, Zhang Caiming. A Multi-View Unified Representation Learning Network for Subspace Clustering[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202440431
[2]	Zhu Yingwen, Chen Songcan. High Dimensional Data Stream Clustering Algorithm Based on Random Projection[J]. Journal of Computer Research and Development, 2020, 57(8): 1683-1696. DOI: 10.7544/issn1000-1239.2020.20200432
[3]	Xu Kai, Wu Xiaojun, Yin Hefeng. Distributed Low Rank Representation-Based Subspace Clustering Algorithm[J]. Journal of Computer Research and Development, 2016, 53(7): 1605-1611. DOI: 10.7544/issn1000-1239.2016.20148362
[4]	Bi Anqi, Dong Aimei, Wang Shitong. A Dynamic Data Stream Clustering Algorithm Based on Probability and Exemplar[J]. Journal of Computer Research and Development, 2016, 53(5): 1029-1042. DOI: 10.7544/issn1000-1239.2016.20148428
[5]	Liu Zhuo, Yang Yue, Zhang Jianpei, Yang Jing, Chu Yan, Zhang Zebao. An Adaptive Grid-Density Based Data Stream Clustering Algorithm Based on Uncertainty Model[J]. Journal of Computer Research and Development, 2014, 51(11): 2518-2527. DOI: 10.7544/issn1000-1239.2014.20130869
[6]	Xu Min, Deng Zhaohong, Wang Shitong, Shi Yingzhong. MMCKDE: m-Mixed Clustering Kernel Density Estimation over Data Streams[J]. Journal of Computer Research and Development, 2014, 51(10): 2277-2294. DOI: 10.7544/issn1000-1239.2014.20130718
[7]	Yu Xiang, Yin Guisheng, Xu Xiandong, Wang Jianwei. A Data Stream Subspace Clustering Algorithm Based on Region Partition[J]. Journal of Computer Research and Development, 2014, 51(1): 88-95.
[8]	Xie Kunwu, Bi Xiaoling, and Ye Bin. Clustering Algorithm of High-Dimensional Data Based on Units[J]. Journal of Computer Research and Development, 2007, 44(9): 1618-1623.
[9]	Jin Yifu, Zhu Qingsheng, Xing Yongkang. An Algorithm for Clustering of Outliers Based on Key Attribute Subspace[J]. Journal of Computer Research and Development, 2007, 44(4): 651-659.
[10]	Zhou Xiaoyun, Sun Zhihui, Zhang Baili, and Yang Yidong. Research on Clustering and Evolution Analysis of High Dimensional Data Stream[J]. Journal of Computer Research and Development, 2006, 43(11): 2005-2011.