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

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

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.

中图分类号: 

• TP301.6