Journal of Software:2001.12(4):475-484

(中国科学院数学与系统科学研究院,北京 100080;北京航空航天大学管理学院,北京 100083)
An Effective Clustering Algorithm in Large Transaction Databases
CHEN Ning,CHEN An,ZHOU Long-xiang
Chart / table
Similar Articles
Article :Browse 2996   Download 3303
Received:July 28, 2000    Revised:December 19, 2000
> 中文摘要: 研究大规模交易数据库的聚类问题,提出了一种二次聚类算法——CATD.该算法首先将数据库划分成若干分区,在每个分区内利用层次聚类算法进行局部聚类,把交易初步划分成若干亚聚类,亚聚类的个数由聚类间的距离参数控制.然后对所有的亚聚类进行全局聚类,同时识别出噪声.由于采用了分区方法和聚类的支持向量表示法,该算法只需扫描一次数据库,聚类过程在内存中进行,因此能处理大规模的数据库.
Abstract:Clustering of transactions can find potential useful patterns to improve the product profit. In this paper, a two-step clustering algorithm——CATD is proposed, applicable in large transaction databases. First, the database is divided into partitions in which transactions are partially clustered into a number of subclusters. A hierarchical clustering algorithm is used to control the distance between these subclusters. In the global clustering, a k-medoids clustering algorithm is performed on the subclusters to get a set of k global clusters and identify noise. The algorithm is feasible for large databases because it only scans the original databases once and the clustering process can be performed in main memory due to the partitioning scheme and the support vector representative of subclusters.
文章编号:     中图分类号:    文献标志码:
Foundation items:
Reference text:


CHEN Ning,CHEN An,ZHOU Long-xiang.An Effective Clustering Algorithm in Large Transaction Databases.Journal of Software,2001,12(4):475-484