Measures for the structure of clustering and admissibilities of its algorithm
AbstractThe 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. --
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Humboldt University of Berlin, Interdisciplinary Research Project 373: Quantification and Simulation of Economic Processes in its series SFB 373 Discussion Papers with number 2001,79.
Date of creation: 2001
Date of revision:
structure; admissibility; AHCA (agglomerative hierarchical clustering algorithm);
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.