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

Experiments with, and on, algorithms for maximum likelihood clustering

Author

Listed:
  • Woodruff, David L.
  • Reiners, Torsten

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:csdana:v:47:y:2004:i:2:p:237-253
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(03)00273-1
    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. Hennig, Christian & Christlieb, Norbert, 2002. "Validating visual clusters in large datasets: fixed point clusters of spectral features," Computational Statistics & Data Analysis, Elsevier, vol. 40(4), pages 723-739, October.
    2. Hawkins, Douglas M., 1994. "The feasible solution algorithm for the minimum covariance determinant estimator in multivariate data," Computational Statistics & Data Analysis, Elsevier, vol. 17(2), pages 197-210, February.
    3. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    4. 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.
    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. 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.
    3. Qian, Dajun & Kaddis, John & Niland, Joyce C., 2007. "A matching algorithm for the distribution of human pancreatic islets," Computational Statistics & Data Analysis, Elsevier, vol. 51(12), pages 5494-5506, August.
    4. Garcia-Escudero, L.A. & Gordaliza, A., 2007. "The importance of the scales in heterogeneous robust clustering," Computational Statistics & Data Analysis, Elsevier, vol. 51(9), pages 4403-4412, May.
    5. Luis García-Escudero & Alfonso Gordaliza & Carlos Matrán & Agustín Mayo-Iscar, 2010. "A review of robust clustering methods," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 4(2), pages 89-109, September.
    6. Gallegos, María Teresa & Ritter, Gunter, 2010. "Using combinatorial optimization in model-based trimmed clustering with cardinality constraints," Computational Statistics & Data Analysis, Elsevier, vol. 54(3), pages 637-654, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    2. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    3. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    4. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    5. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    6. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    7. Li, Mingjie & Hao, Jin-Kao & Wu, Qinghua, 2024. "A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment," European Journal of Operational Research, Elsevier, vol. 312(2), pages 473-492.
    8. Rex K. Kincaid & Keith E. Laba & Sharon L. Padula, 1997. "Quelling Cabin Noise in Turboprop Aircraft via Active Control," Journal of Combinatorial Optimization, Springer, vol. 1(3), pages 229-250, October.
    9. Croux, Christophe & Haesbroeck, Gentiane, 1997. "An easy way to increase the finite-sample efficiency of the resampled minimum volume ellipsoid estimator," Computational Statistics & Data Analysis, Elsevier, vol. 25(2), pages 125-141, July.
    10. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    11. 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.
    12. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    13. Hawkins, Douglas M. & Olive, David J., 1999. "Improved feasible solution algorithms for high breakdown estimation," Computational Statistics & Data Analysis, Elsevier, vol. 30(1), pages 1-11, March.
    14. Juan Carlos Duque & Raúl Ramos, 2004. "Design of homogenous territorial units: a methodological proposal," ERSA conference papers ersa04p6, European Regional Science Association.
    15. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    16. Woodruff, David L., 1998. "Proposals for chunking and tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 585-598, April.
    17. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
    18. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.
    19. Shen, Liji & Dauzère-Pérès, Stéphane & Maecker, Söhnke, 2023. "Energy cost efficient scheduling in flexible job-shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 310(3), pages 992-1016.
    20. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.

    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:47:y:2004:i:2:p:237-253. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.