一种三支决策软增量聚类算法  

An incremental three-way decisions soft clustering algorithm

作　　者：张聪[1] 于洪[1] 

机构地区：[1]重庆邮电大学计算智能重庆市重点实验室

出　　处：《山东大学学报（理学版）》2014年第8期40-47,共8页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(61379114;61272060);重庆市自然科学基金资助项目(cstc2013jcyjA40063)

摘　　要：已有的大多数聚类算法都假设数据集保持不变,然而,很多应用中数据集是会随时间变化的。为此,提出了一种新的三支决策软增量聚类算法。采用区间集的形式表示类簇,区间集的上界、边界与下界就对应着三支决策产生的正域、边界域和负域,并提出了一种基于代表点的初始聚类算法。采用同样的方式对新增数据集进行一次预聚类,以消除数据处理顺序对最终聚类结果产生的影响。为了快速查找新增数据的相似区域,建立了代表点搜索树,并且给出了查找和更新搜索树的策略。运用三支决策策略完成增量聚类。实验结果表明提出的增量聚类算法是有效的。Most of the clustering algorithms reported assume a data set always does not change.However,it is often observed that the analyzed data set changes over time in many applications.To combat changes,we introduce a new in-cremental soft clustering approach based on three-way decisions theory.Firstly,the interval sets are used to represent a cluster,wherein the upper bound,the border,the lower bound of interval sets corresponding to positive region,bounda-ry region,negative region generated by the three-way decisions respectively,and an initial clustering algorithm is pro-posed by using representative points.Secondly,to eliminate the influence of the processing order on final incremental clustering results,the incremental data is pre-clustered used the same way.To quickly search similar areas for incremen-tal data,a searching tree based on the representative points is constructed,and the strategies of searching and updating are presented.Finally,the three-way decisions strategy is used to incremental clustering.The results of the experiments show the approach is effective to incremental clustering.

关 键 词：增量聚类 软聚类 搜索树 三支决策 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]