Sciweavers

212 search results - page 26 / 43
» Optimal sampling of genetic algorithms on polynomial regress...
Sort
View
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 11 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
GECCO
2003
Springer
14 years 3 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
UAI
2004
13 years 11 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 months ago
Exploring extended particle swarms: a genetic programming approach
Particle Swarm Optimisation (PSO) uses a population of particles that fly over the fitness landscape in search of an optimal solution. The particles are controlled by forces tha...
Riccardo Poli, Cecilia Di Chio, William B. Langdon
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 1 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang