Sciweavers

402 search results - page 7 / 81
» Random Search for Hyper-Parameter Optimization
Sort
View
ISCI
2008
102views more  ISCI 2008»
14 years 9 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
ESANN
2007
14 years 11 months ago
A novel kernel-based method for local pattern extraction in random process signals
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...
Majid Beigi, Andreas Zell
CP
2006
Springer
15 years 1 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 3 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
IMCSIT
2010
14 years 7 months ago
Enhanced Competitive Differential Evolution for Constrained Optimization
Abstract--The constrained optimization with differential evolution (DE) is addressed. A novel variant of competitive differential evolution with a hybridized search of feasibility ...
Josef Tvrdík, Radka Polakova