IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v43y2003i2p235-248.html
   My bibliography  Save this article

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

Author

Listed:
  • Pacheco, Joaquin
  • Valencia, Olga

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:csdana:v:43:y:2003:i:2:p:235-248
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(02)00224-4
    Download Restriction: Full text for ScienceDirect subscribers only.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Haber, Michael, 1985. "Maximum likelihood methods for linear and log-linear models in categorical data," Computational Statistics & Data Analysis, Elsevier, vol. 3(1), pages 1-10, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 211-223, September.
    2. Douglas Steinley & Lawrence Hubert, 2008. "Order-Constrained Solutions in K-Means Clustering: Even Better Than Being Globally Optimal," Psychometrika, Springer;The Psychometric Society, vol. 73(4), pages 647-664, December.
    3. repec:spr:jclass:v:34:y:2017:i:2:d:10.1007_s00357-017-9231-0 is not listed on IDEAS
    4. Van Aelst, Stefan & (Steven) Wang, Xiaogang & Zamar, Ruben H. & Zhu, Rong, 2006. "Linear grouping using orthogonal regression," Computational Statistics & Data Analysis, Elsevier, vol. 50(5), pages 1287-1312, March.
    5. Woodruff, David L. & Reiners, Torsten, 2004. "Experiments with, and on, algorithms for maximum likelihood clustering," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 237-253, September.
    6. Michael Brusco & Douglas Steinley, 2011. "A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices," Psychometrika, Springer;The Psychometric Society, vol. 76(4), pages 612-633, October.
    7. 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;The Psychometric Society, vol. 74(4), pages 685-703, December.
    8. Michael Brusco & Douglas Steinley, 2007. "A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer;The Psychometric Society, vol. 72(4), pages 583-600, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.

    We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.