Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

›› 2003, Vol. 29 ›› Issue (01): 140-141.

• Papers • Previous Articles     Next Articles

Research on a Fast Algorithm to Cluster High Dimensional Data

YAN Xuesong,CAI Zhihua   

  1. (Information Engineering Faculty, China University of Geosciences,Wuhan 430074)
  • Published:2003-01-15

一种快速聚类高维数据的算法研究

颜雪松,蔡之华   

  1. 中国地质大学信息工程学院,中国地质大学信息工程学院 武汉 430074

Abstract: Clustering is a data mining problem that has received significant attention by the database community. Data set size, dimensionality and sparsity have been identified as aspects that make cluster more difficult. This paper introduces a fast algorithm to cluster large binary data sets where data points have high dimensionality and most of their coordinates are zero. At the end of the paper, it analyzes the algorithm.

摘要: 聚类作为数据挖掘的一个问题已经受到了数据库团体的密切关注。数据集合的大小,数据的维数和数据的稀疏性都是制约聚类的不同方面。文介绍了一种聚类大型二元数据集合的快速算法,在该数据集合中数据点是高维的,并且大多数的坐标值为零。文章最后对算法进行了分析。

关键词: 聚类, 协方差, 稀疏, 数据挖掘

CLC Number: