作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (16): 192-194. doi: 10.3969/j.issn.1000-3428.2009.16.069

• 人工智能及识别技术 • 上一篇    下一篇

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

白 亮1,2,曹付元1,2,梁吉业1,2   

  1. (1. 计算智能与中文信息处理教育部重点实验室,太原 030006;2. 山西大学计算机与信息技术学院,太原 030006)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-08-20 发布日期:2009-08-20

Fuzzy K-Modes Clustering Algorithm                     Based on New Dissimilarity Measure

BAI Liang1,2, CAO Fu-yuan1,2, LIANG Ji-ye1,2   

  1. (1. Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, Taiyuan 030006;2. School of Computer and Information Technology, Shanxi University, Taiyuan 030006)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-08-20 Published:2009-08-20

摘要: 传统的模糊K-Modes聚类算法采用简单匹配方法度量对象与Mode之间的相异程度,没有充分考虑Mode对类的代表程度,容易造成信息的丢失,弱化了类内的相似性。针对上述问题,通过对象对类的隶属度反映Mode对类的代表程度,提出一种新的相异度量,并将它应用于传统的模糊K-Modes聚类算法。与传统的K-Modes和模糊K-Modes聚类算法相比,该相异度量是有效的。

关键词: 模糊K-Modes聚类算法, 相异度量, 类中心

Abstract: 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.

Key words: fuzzy K-modes clustering algorithm, dissimilarity measure, cluster center

中图分类号: