On a Minimal Spanning, Tree Approach in the Cluster Validation Problem

Barzily Z., Volkovich Z., ÖZTÜRK B., Weber G.

INFORMATICA, cilt.20, sa.2, ss.187-202, 2009 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 20 Sayı: 2
  • Basım Tarihi: 2009
  • Dergi Adı: INFORMATICA
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.187-202
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this paper, a method for the study of cluster stability is purposed. We draw pairs of samples from the data, according to two sampling distributions. The first distribution corresponds to the high density zones of data-elements distribution. Thus it is associated with the clusters cores. The second one, associated with file cluster margins, is related to the low density zones. The samples are clustered and the two obtained partitions are compared. The partitions are considered to be consistent if the obtained clusters are similar. The resemblance is measured by the total number of edges, in the clusters minimal spanning trees, connecting points from different samples. We use the Friedman and Rafsky two sample test Statistic. Under the homogeneity hypothesis, this statistic is normally distributed. Thus, it can he expected that the true number of clusters corresponds to the statistic empirical distribution which is closest to normal. Numerical experiments demonstrate the ability of the approach to detect the true number of clusters.