Sciweavers

374 search results - page 20 / 75
» A Genetic Algorithm for the Index Selection Problem
Sort
View
JUCS
2002
131views more  JUCS 2002»
14 years 9 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 3 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
CIBB
2008
14 years 11 months ago
Stability and Performances in Biclustering Algorithms
Abstract. Stability is an important property of machine learning algorithms. Stability in clustering may be related to clustering quality or ensemble diversity, and therefore used ...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
15 years 2 months ago
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
Helio J. C. Barbosa, Afonso C. C. Lemonge
GECCO
2003
Springer
15 years 2 months ago
Coarse-Graining in Genetic Algorithms: Some Issues and Examples
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
Andrés Aguilar Contreras, Jonathan E. Rowe,...