Cluster validation using graph theoretic concepts

被引：104

作者：

Pal, NR

Biswas, J

机构：

[1] Machine Intelligence Unit, Indian Statistical Institute, Calcutta

[2] Machine Intelligence Unit, Indian Statistical Institute, Calcutta

来源：

PATTERN RECOGNITION | 1997年 / 30卷 / 06期

关键词：

cluster validity; Gabriel graph; relative neighborhood graph; minimal spanning tree; structural clusters;

D O I：

10.1016/S0031-3203(96)00127-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this article we have generalized Dunn's index and the Davies-Bouldin index for cluster validation using graph structures, such as GG, RNG and MST. Unlike Dunn's index and the Davies-BouIdin index, the proposed indices are not sensitive to noisy points and are applicable to hyperspherical and structural clusters as well. The relationships between Various indices have also been established. The effectiveness of the generalized indices and superiority over some existing cluster validity indices are established using eight data sets. (C) 1997 Pattern Recognition Society.

引用

页码：847 / 857

页数：11

共 11 条

[1]

[Anonymous], 1976, FUZZY AUTOMATA DECIS

[2]

BEZDEK JC, UNPUB IEEE T SYSTEMS

[3] CLUSTER SEPARATION MEASURE [J].