Advanced Search
MyIDEAS: Login to save this article or follow this journal

Design of hybrids for the minimum sum-of-squares clustering problem


Author Info

  • Pacheco, Joaquin
  • Valencia, Olga
Registered author(s):


    No abstract is available for this item.

    Download Info

    If 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.
    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Computational Statistics & Data Analysis.

    Volume (Year): 43 (2003)
    Issue (Month): 2 (June)
    Pages: 235-248

    as in new window
    Handle: RePEc:eee:csdana:v:43:y:2003:i:2:p:235-248

    Contact details of provider:
    Web page:

    Related research



    No references listed on IDEAS
    You can help add them by filling out this form.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Woodruff, David L. & Reiners, Torsten, 2004. "Experiments with, and on, algorithms for maximum likelihood clustering," Computational Statistics & Data Analysis, Elsevier, Elsevier, vol. 47(2), pages 237-253, September.
    2. Michael Brusco & Douglas Steinley, 2007. "A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer, vol. 72(4), pages 583-600, December.
    3. Michael Brusco & Douglas Steinley, 2011. "A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices," Psychometrika, Springer, vol. 76(4), pages 612-633, October.
    4. Douglas Steinley & Lawrence Hubert, 2008. "Order-Constrained Solutions in K-Means Clustering: Even Better Than Being Globally Optimal," Psychometrika, Springer, vol. 73(4), pages 647-664, December.
    5. Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, Elsevier, vol. 47(2), pages 211-223, September.
    6. Michael Brusco & Hans-Friedrich Köhn, 2009. "Clustering Qualitative Data Based on Binary Equivalence Relations: Neighborhood Search Heuristics for the Clique Partitioning Problem," Psychometrika, Springer, vol. 74(4), pages 685-703, December.
    7. Van Aelst, Stefan & (Steven) Wang, Xiaogang & Zamar, Ruben H. & Zhu, Rong, 2006. "Linear grouping using orthogonal regression," Computational Statistics & Data Analysis, Elsevier, Elsevier, vol. 50(5), pages 1287-1312, March.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:43:y:2003:i:2:p:235-248. 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: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.