Sciweavers

21 search results - page 1 / 5
» An Iterated Local Search Approach for Minimum Sum-of-Squares...
Sort
View
IDA
2003
Springer
13 years 10 months ago
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Peter Merz
CVPR
2005
IEEE
14 years 6 months ago
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
Tianli Yu, Jiebo Luo, Narendra Ahuja
SDM
2004
SIAM
187views Data Mining» more  SDM 2004»
13 years 6 months ago
Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvri...
SBIA
2004
Springer
13 years 10 months ago
Detecting Promising Areas by Evolutionary Clustering Search
A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This pape...
Alexandre César Muniz de Oliveira, Luiz Ant...
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 8 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache