A Grid and MST Based Clustering Algorithm for Data Streams
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    CluStream algorithm has poor quality of clustering for non-spherical clusters, at the same time, most grid-based clustering algorithms improve the efficiency of clustering at the cost of reducing clustering accuracy. The paper gives a new kind of clustering algorithm for data stream—GTSClu, it is the minimum spanning tree data stream clustering algorithm based on grid, which is divided into online processing and offline clustering, combining with grid resolution and minimum spanning tree techniques. GTSClu algorithm cannot only find clusters with arbitrary shape and amount, but also deal with noise data effectively, the efficiency and quality of clustering is improved.

    Reference
    Related
    Cited by
Get Citation

王海波,王宪鹏,王芳,陈志国.一种基于网格和最小生成树的数据流聚类算法.计算机系统应用,2011,20(2):152-156

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 17,2010
  • Revised:July 16,2010
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063