%0 Journal Article
%T A Grid-based Subspace Clustering Algorithm for High-dimensional Data Streams<br>一种基于网格方法的高维数据流子空间聚类算法
%A SUN Yu-Fen
%A LU Yan-Sheng
%A <br>孙玉芬
%A 卢炎生
%J 计算机科学
%D 2007
%I 
%X Based on the analysis of grid-based clustering algorithms, we propose a subspace clustering algorithm that can find clusters in different subspaces for high-dimensional data streams. The algorithm combines the advantages of bottom-up grid-based method and top-down grid-based method. A uniformly partitioned grid data structure is used to summarize the data stream online. A top-down grid partition method is used o find the subspaces in which clusters locate. Theory analysis and performance study with real datasets and synthetic dataset demonstrate the efficiency and effectiveness of our proposed algorithm.
%K Grid
%K Subspace clustering
%K Data stream
%K High-dimensional data<br>网格
%K 子空间聚类
%K 数据流
%K 高维数据
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=424A09C4EA0F925C261D628B111893DA&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=E158A972A605785F&sid=FCD27DC5E1F2EEE7&eid=38685BC770C663F2&journal_id=1002-137X&journal_name=计算机科学&referenced_num=3&reference_num=15