Measures for the structure of clustering and admissibilities of its algorithm
The problem of selecting a clustering algorithm from the myriad of algorithms has been discussed in recent years. Many researchers have attacked this problem by using the concept of admissibility (e.g. Fisher and Van Ness, 1971, Yadohisa, et al., 1999). We propose a new criterion called the structured ratio for measuring the clustering results. It includes the concept of the well-structured admissibility as a special case, and represents some kind of goodness-of-fit of the clustering result. New admissibilities of the clustering algorithm and a new agglomerative hierarchical clustering algorithm are also provided by using the structured ratio. Details of the admissibilities of the eight popular algorithms are discussed.
|Date of creation:||2001|
|Date of revision:|
|Contact details of provider:|| Postal: Spandauer Str. 1,10178 Berlin|
Web page: http://www.wiwi.hu-berlin.de/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:zbw:sfb373:200179. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (ZBW - German National Library of Economics)
If references are entirely missing, you can add them using this form.