%0 Journal Article
%T Fast Clustering of Data Streams Using Graphics Processors<br>基于图形处理器的数据流快速聚类
%A CAO Feng
%A ZHOU Ao-Ying
%A <br>曹锋
%A 周傲英
%J 软件学报
%D 2007
%I 
%X Clustering data stream basically requires fast processing speed as well as quality clustering results. In this paper, some novel approaches are presented for such a clustering task using graphics processing units (GPUs), e.g., K-means-based method, stream clustering method, and evolving data stream analysis method. The common characteristics of these methods are making use of the strong computational and pipeline power of GPUs. Different from the pervious clustering methods with individual framework, the methods share the same framework with multi-function, which provides a uniform platform for stream clustering. In stream clustering, the core operations are distance computing and comparison. These two operations could be implemented by using capabilities of GPUs on fragment vector processing. Extensive experiments are conducted in a PC with Pentium IV 3.4G CPU and NVIDIA GeForce 6800 GT graphic card. A comprehensive performance study is presented to prove the efficiency of the proposed algorithms. It is shown that these algorithms are about 7 times faster than the previous CPU-based algorithms. Therefore, they well support the applications of high speed data streams.
%K data stream
%K clustering
%K graphics processor
%K evolving
%K window<br>数据流
%K 聚类
%K 图形处理器
%K 进化
%K 窗口
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2094520784362310&yid=A732AF04DDA03BB3&vid=13553B2D12F347E8&iid=0B39A22176CE99FB&sid=6490F0E20C4B41AD&eid=119B6C0AA09DE6B9&journal_id=1000-9825&journal_name=软件学报&referenced_num=14&reference_num=23