Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
AbstractNo abstract is available for this item.
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 InfoArticle provided by Springer in its journal Journal of Classification.
Volume (Year): 7 (1990)
Issue (Month): 1 (March)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=101794
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.:
- Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer, vol. 39(3), pages 283-309, September.
- C. Glasbey, 1987. "Complete linkage as a multiple stopping rule for single linkage clustering," Journal of Classification, Springer, vol. 4(1), pages 103-109, March.
- Gordon, A. D., 1996. "A survey of constrained classification," Computational Statistics & Data Analysis, Elsevier, vol. 21(1), pages 17-29, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.