Sciweavers

352 search results - page 18 / 71
» A local search approximation algorithm for k-means clusterin...
Sort
View
80
Voted
EMO
2003
Springer
137views Optimization» more  EMO 2003»
15 years 2 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle
79
Voted
BMCBI
2008
87views more  BMCBI 2008»
14 years 9 months ago
Protein structure search and local structure characterization
Background: Structural similarities among proteins can provide valuable insight into their functional mechanisms and relationships. As the number of available three-dimensional (3...
Shih-Yen Ku, Yuh-Jyh Hu
CPAIOR
2007
Springer
15 years 3 months ago
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, An...
ECSQARU
2005
Springer
15 years 3 months ago
Default Clustering from Sparse Data Sets
Categorization with a very high missing data rate is seldom studied, especially from a non-probabilistic point of view. This paper proposes a new algorithm called default clusterin...
Julien Velcin, Jean-Gabriel Ganascia
CBMS
2005
IEEE
14 years 11 months ago
Local Dimensionality Reduction within Natural Clusters for Medical Data Analysis
Inductive learning systems have been successfully applied in a number of medical domains. Nevertheless, the effective use of these systems requires data preprocessing before apply...
Mykola Pechenizkiy, Alexey Tsymbal, Seppo Puuronen