Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Morph-Based Local-Search Heuristics for Large-Scale Combinatorial Data Analysis 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Classification Springer Journals

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

Brusco, Michael J.
Journal of Classification , Volume 16 (2) – Feb 28, 2014
Download PDF
18 pages

Loading next page...
 
/lp/springer-journals/morph-based-local-search-heuristics-for-large-scale-combinatorial-data-Nikk3DAXnp

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Journals
Copyright
Copyright © 1999 by Springer-Verlag New York Inc.
Subject
Statistics; Statistical Theory and Methods; Pattern Recognition; Bioinformatics; Signal, Image and Speech Processing; Psychometrics; Marketing
ISSN
0176-4268
eISSN
1432-1343
DOI
10.1007/s003579900052
Publisher site
See Article on Publisher Site

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.

Journal

Journal of Classification – Springer Journals

Published: Feb 28, 2014

There are no references for this article.