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

计算机工程 ›› 2009, Vol. 35 ›› Issue (8): 68-69. doi: 10.3969/j.issn.1000-3428.2009.08.023

• 软件技术与数据库 • 上一篇    下一篇

基于灰关联规则和连通分支的聚类算法

聂 轰,陈湘涛,王爱云,谢伟平   

  1. (湖南大学计算机与通信学院,长沙 410082)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-20 发布日期:2009-04-20

Clustering Algorithm Based on Gray Association Rule and Connected Component

NIE Hong, CHEN Xiang-tao, WANG Ai-yun, XIE Wei-ping

  

  1. (School of Computer and Communication, Hunan University, Changsha 410082)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-04-20 Published:2009-04-20

摘要: 提出一种新的聚类算法,分析待考察属性间的灰关联度,将其转化为属性权值,用于连通分支聚类的距离量度。该算法被用于处理铝电解工业生产中的分类问题。实验结果证明,它在一定程度上克服了欧氏距离的缺陷,能反映属性间的相互影响,提高聚类质量和 性能。

关键词: 灰关联规则, 聚类算法, 欧氏距离

Abstract: This paper proposes a new clustering algorithm which analyzes the gray association value of inspected attribute, transforms them into attribute weight, and applies them in distance calculation of connected components clustering. The algorithm is applied into clustering analysis of categorized problems about cell status in industry production of aluminum electrolysis. Experimental results proves that this algorithm overcomes the defects of the euclidean distance on some extent, reflects the impact of attribute, and improves the quality and performance of clustering.

Key words: gray association rule, clustering algorithm, Euclidean distance

中图分类号: