Density-based data streams subspace clustering over weighted sliding windows

Jiadong Ren*, Shiyuan Cao, Changzhen Hu

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

2 引用 (Scopus)

摘要

Most real-world data sets are characterized by a high dimensinal, inherely sparse data space. In this paper, we present a novel density-based approach to the subspace clustering problem. A new framework for data stream mining is introduced, called the weighted sliding window. In the online component, the structure of Exponential Histogram of Cluster Feature(EHCF) is improved to maintain the micro-clusters. The concepts of potential core-micro-cluster and outlier micro-cluster are applied to distinguish the potential clusters and outliers. A novel pruning strategy is proposed to decrease the number of micro-clusters. In the offline component, the final clusters are generated by SUBCLU algorithm. Our performance study demonstrates the effectiveness and efficiency of our algorithm.

源语言英语
主期刊名Proceedings - 2010 1st ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems, CDEE 2010
出版商IEEE Computer Society
212-216
页数5
ISBN(印刷版)9780769543321
DOI
出版状态已出版 - 2010

出版系列

姓名Proceedings - 2010 1st ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems, CDEE 2010

指纹

探究 'Density-based data streams subspace clustering over weighted sliding windows' 的科研主题。它们共同构成独一无二的指纹。

引用此