Space distortion and monotone admissibility in agglomerative clustering
This paper discusses the admissibility of agglomerative hierarchical clustering algorithms with respect to space distortion and monotonicity, as defined by Yadohisa et al. and Batagelj, respectively. Several admissibilities and their properties are given for selecting a clustering algorithm. Necessary and sufficient conditions for an updating formula, as introduced by Lance and Williams, are provided for the proposed admissibility criteria. A detailed explanation of the admissibility of eight popular algorithms is also given.
|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
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Vladimir Batagelj, 1981. "Note on ultrametric hierarchical clustering algorithms," Psychometrika, Springer, vol. 46(3), pages 351-352, September.
When requesting a correction, please mention this item's handle: RePEc:zbw:sfb373:200178. 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.