Subspace Clustering of High Dimensional Data Streams

@article{Wang2008SubspaceCO,
  title={Subspace Clustering of High Dimensional Data Streams},
  author={Shuyun Wang and Yingjie Fan and Chenghong Zhang and Hexiang Xu and Xiulan Hao and Yunfa Hu},
  journal={Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)},
  year={2008},
  pages={165-170}
}
In this paper, SOStream, which is a novel algorithm of clustering over high dimensional online data stream is presented, it is based on subspace.-SOStream partitions the data space into grids, and maintains a superset of all dense units in an online way. A deterministic lower and upper bound of the selectivity of each maintained units are also given. With the maintained potential dense units, SOStream is capable of discovering the clusters in different subspaces over high dimensional data… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-6 of 6 extracted citations

A Weighted Subspace Clustering Algorithm in High-Dimensional Data Streams

2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC) • 2009
View 2 Excerpts

Clustering High Dimensional Data Streams with Representative Points

2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery • 2009
View 1 Excerpt

HDG-Tree: A Structure for Clustering High-dimensional Data Streams

2009 Third International Symposium on Intelligent Information Technology Application • 2009
View 1 Excerpt

Identifying Structures with Informative Dimensions in Streams

2009 Eighth IEEE/ACIS International Conference on Computer and Information Science • 2009
View 3 Excerpts

Similar Papers

Loading similar papers…