拓展差异度的高维数据聚类算法  

High Dimensional Data Clustering Algorithm Based on Extended Dissimilarity

作　　者：武森[1] 何慧霞 范岩岩 WU Sen;HE Huixia;FAN Yanyan(School of Economics and Management,University of Science and Technology Beijing,Beijing 100083,China)

机构地区：[1]北京科技大学经济管理学院,北京100083

出　　处：《计算机工程与应用》2020年第23期38-44,共7页Computer Engineering and Applications

基　　金：国家自然科学基金(No.71271027,No.71971025)。

摘　　要：CABOSFV是一种有效的高维数据聚类算法。针对CABOSFV算法倾向于将数据对象分配到更大的类中这一问题,提出一种拓展差异度的高维数据聚类算法(CABOSFV_D)。该算法引入了调整指数p,对原始稀疏差异度进行拓展,降低类大小对对象分配的影响;同时用位集的方式实现CABOSFV_D算法,使算法的运算效率明显提升。基于多个UCI标准数据集进行聚类实验,结果表明CABOSFV_D在聚类效果和时间效率上均优于原始CABOSFV算法。CABOSFV is an effective high dimensional data clustering algorithm,while it tends to allocate data objects to larger clusters.To solve this problem,CABOSFV_D,a high dimensional data clustering algorithm based on extended dissimilarity,is proposed.An adjustment index p is introduced to expand the original sparse feature dissimilarity and reduce the impact of cluster size on object allocation.At the same time,the method of bit set is used to realize the CABOSFV_D,which significantly improves the efficiency of the algorithm.Finally,experiments are performed based on multiple UCI standard datasets.The results show that CABOSFV_D is superior to traditional algorithm in clustering effect and time efficiency.

关 键 词：拓展差异度 CABOSFV 高维聚类 CABOSFV_D 位集 

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