基于Mean-Shift的投影聚类算法PCMF  

Projective Clustering Algorithm PCMF Based on Mean-Shift

作　　者：黄李国[1] 王士同[1] 

机构地区：[1]江南大学信息工程学院,无锡214122

出　　处：《计算机工程》2007年第18期233-235,269,共4页Computer Engineering

摘　　要：高维数据的聚类都隐含在低维的子空间内。为找出有效的子空间,Agrawal等人提出了投影聚类概念,通过映射变换转换到子空间里,然后借助其他方法找到聚类。该文基于目前最新的投影聚类算法EPCH,提出了PCMF算法,借助Mean-Shift划分子空间聚类。与EPCH算法相比,PCMF在划分子空间中数据时,无须输入参数(EPCH中是最大聚类个数),能够有效降低划分出的子空间数量,获得与EPCH相媲美的实验结果。The clusters of a high dimensional dataset are often hidden in the subspaces of the corresponding low dimensional datasets. In order to successfully find the subspaces, Agrawal proposes the conception of projective clustering, converting the data into subspaces with mapping and using another method to find clusters. EPCH is the latest projective clustering algorithm. This paper incorporates Mean-Shift into EPCH to divide a high dimensional dataset into the corresponding subspaces. Experiments demonstrate that the approach is comparable to EPCH in the sense of obtaining the reasonable clusters, however, it doesn＇t require any parameter and can reduce the number of subspaces.

关 键 词：子空间划分 直方图 MEAN-SHIFT 投影聚类 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]