一种改进的CLIQUE高维子空间聚类算法  

An Improved CLIQUE Subspace Clustering Algorithm for High Dimensional Data

作　　者：王东[1] 王理想[1] 范伟[1] 

机构地区：[1]重庆理工大学计算机科学与工程学院,重庆400054

出　　处：《半导体光电》2016年第2期275-278,共4页Semiconductor Optoelectronics

基　　金：重庆市教委科学技术研究计划项目(KJ1400907;KJ1400911;KJ130834)

摘　　要：分析了经典的CLIQUE聚类算法,阐述了该算法存在的局限性,针对该算法时间复杂度高和聚类精度低的问题,提出了一种改进的CLIQUE聚类算法;改进的算法不仅具有传统CLIQUE算法的优点,而且利用降低冗余维度和备份密集单元数据库D′的策略,大大降低了搜索成本和时间复杂度;且进一步用混合网格划分技术替代原有算法的固定网格划分技术,提高了聚类结果的精度,保留了密集单元的完整性。The classic clique clustering CLIQUE algorithm was analyzed,and the limitations of CLIQUE algorithm were explained.In view of the problems of high time complexity and low accuracy of clustering,an improved algorithm CLIQUE was further proposed.It not only has the advantages of traditional algorithms,but also it uses a value to reduce redundancy dimensions and backup intensive unit database,which greatly reduces the search cost and time complexity.The new algorithm also adopts the hybrid grid technology to replace the original algorithm of fixed grid technology,which both improves the accuracy of the clustering algorithm and maintains the integrity of the dense cells.

关 键 词：子空间聚类 维聚类 挖掘 类分析 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]