Order-Constrained Solutions in K-Means Clustering: Even Better Than Being Globally Optimal
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 Psychometrika.
Volume (Year): 73 (2008)
Issue (Month): 4 (December)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=112911
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.:
- Michael Brusco & Stephanie Stahl, 2001. "Compact integer-programming models for extracting subsets of stimuli from confusion matrices," Psychometrika, Springer, vol. 66(3), pages 405-419, September.
- Pacheco, Joaquin & Valencia, Olga, 2003. "Design of hybrids for the minimum sum-of-squares clustering problem," Computational Statistics & Data Analysis, Elsevier, vol. 43(2), pages 235-248, June.
- Glenn Milligan, 1980. "An examination of the effect of six types of error perturbation on fifteen clustering algorithms," Psychometrika, Springer, vol. 45(3), pages 325-342, September.
- Glenn Milligan & Martha Cooper, 1988. "A study of standardization of variables in cluster analysis," Journal of Classification, Springer, vol. 5(2), pages 181-204, September.
- Sebastian Krey & Uwe Ligges & Friedrich Leisch, 2014. "Music and timbre segmentation by recursive constrained K-means clustering," Computational Statistics, Springer, vol. 29(1), pages 37-50, February.
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.