A Graph Theoretic Criterion for Determining the Number of Clusters in a Data Set
This article is concerned with procedures for determining the number of clusters in a data set. Most of the procedures or stopping rules currently in use involve finding internally coherent and externally isolated clusters, but do not derive from the formal structure of the respective clustering mod...
Uloženo v:
| Vydáno v: | Multivariate behavioral research Ročník 27; číslo 4; s. 541 - 565 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Fort Worth, TX
Lawrence Erlbaum Associates, Inc
01.10.1992
Society of Multivariate Experimental Psychology |
| Témata: | |
| ISSN: | 0027-3171, 1532-7906 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This article is concerned with procedures for determining the number of clusters in a data set. Most of the procedures or stopping rules currently in use involve finding internally coherent and externally isolated clusters, but do not derive from the formal structure of the respective clustering model. Based on the graph theoretic concepts of minimal spanning tree, maximal spanning tree, and homomorphic function, a new criterion is advanced that yields a well-defined clustering solution. Its performance in determining the number of clusters in several empirical data sets is evaluated by comparing it to four prominent stopping rules. It is shown that the proposed criterion not only possesses mathematically attractive properties but also may contribute to solving the number-of-clusters problem. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0027-3171 1532-7906 |
| DOI: | 10.1207/s15327906mbr2704_3 |