602 search results - page 35 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
107
Voted
FGCS
2010
14 years 8 months ago
2010
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
This paper investigates fitness sharing in genetic programming. Implicit fitness sharing is applied to populations of programs. Three treatments are compared: raw fitness, pure fi...
97
Voted
TCBB
2011
14 years 4 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...