Density-based data streams subspace clustering over weighted sliding windows

Jiadong Ren*, Shiyuan Cao, Changzhen Hu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 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
PublisherIEEE Computer Society
Pages212-216
Number of pages5
ISBN (Print)9780769543321
DOIs
Publication statusPublished - 2010

Publication series

NameProceedings - 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

Keywords

  • Data stream
  • Density-based
  • Subspace clustering
  • Weighted sliding windows

Fingerprint

Dive into the research topics of 'Density-based data streams subspace clustering over weighted sliding windows'. Together they form a unique fingerprint.

Cite this