摘要
This article studies the grey clustering method based on the grey correlation degree, defines the connected intensity,λ-cut graph and connected closure of a weighted graph, gets the properties of the maximum spanning tree, λ-cut graph and connected closure, presents the maximum spanning tree algorithm of grey correlation cluster, and checks the method by an example.
This article studies the grey clustering method based on the grey correlation degree, defines the connected intensity,λ-cut graph and connected closure of a weighted graph, gets the properties of the maximum spanning tree, λ-cut graph and connected closure, presents the maximum spanning tree algorithm of grey correlation cluster, and checks the method by an example.
出处
《山东交通学院学报》
CAS
2004年第2期72-75,共4页
Journal of Shandong Jiaotong University
关键词
灰色关联聚类
关联度
关联图
最大支撑树
grey correlation cluster
correlation degree
correlation graph
maximum spanning tree
