IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v16y1999i2p163-180.html
   My bibliography  Save this article

Morph-Based Local-Search Heuristics for Large-Scale Combinatorial Data Analysis

Author

Listed:
  • Michael J. Brusco

Abstract

There are a variety of data analysis techniques in the social and behavioral sciences that require the solution of NP-complete optimization problems. Unfortunately, optimal solution methods are generally intractable for problems of practical size and thus there has been an emphasis on the development of heuristic procedures. Although local-search procedures, such as simulated annealing, have been tested on several combinatorial data analysis problems, they have frequently been criticized as computationally inefficient and therefore impractical for large problems. This paper presents a process called ‘morphing’ that can substantially increase the efficiency and effectiveness of local-search heuristics. The new procedure is compared to replications of a heuristic battery of local-operations across a set of large metric unidimensional scaling (seriation) problems. Generalizations of the morphing process to other problems in combinatorial data analysis are also discussed. Copyright Springer-Verlag New York Inc. 1999

Suggested Citation

  • Michael J. Brusco, 1999. "Morph-Based Local-Search Heuristics for Large-Scale Combinatorial Data Analysis," Journal of Classification, Springer;The Classification Society, vol. 16(2), pages 163-180, July.
    • Handle: RePEc:spr:jclass:v:16:y:1999:i:2:p:163-180
    DOI: 10.1007/s003579900052
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s003579900052
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s003579900052?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:spr:jclass:v:16:y:1999:i:2:p:163-180. 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.

    We have no bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.