基于新的相异度量的模糊K-Modes聚类算法  

Fuzzy K-Modes Clustering Algorithm Based on New Dissimilarity Measure

作　　者：白亮[1,2] 曹付元[1,2] 梁吉业[1,2] 

机构地区：[1]计算智能与中文信息处理教育部重点实验室,太原030006 [2]山西大学计算机与信息技术学院,太原030006

出　　处：《计算机工程》2009年第16期192-194,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2007AA01Z165);国家自然科学基金资助项目(60773133);山西省自然科学基金资助项目(2008011038);山西省高校科技开发基金资助项目(2007103)

摘　　要：传统的模糊K-Modes聚类算法采用简单匹配方法度量对象与Mode之间的相异程度,没有充分考虑Mode对类的代表程度,容易造成信息的丢失,弱化了类内的相似性。针对上述问题,通过对象对类的隶属度反映Mode对类的代表程度,提出一种新的相异度量,并将它应用于传统的模糊K-Modes聚类算法。与传统的K-Modes和模糊K-Modes聚类算法相比,该相异度量是有效的。Traditional fuzzy K-Modes clustering algorithm uses a simple matching dissimilarity measure to compute the dissimilarity between an object and Mode. However, how well Mode is representative of the cluster is not considered in the dissimilarity measure, which may lose some information and result in the cluster with weak intra-similarity. This paper proposes a new dissimilarity measure between an object and Mode, which uses membership degrees of objects to clusters to reflect how well Mode is representative of the cluster. Comparisons with traditional K-Modes and fuzzy K-Modes algorithm illustrate the effectiveness of the new distance measure.

关 键 词：模糊K—Modes聚类算法 相异度量 类中心 

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