Sciweavers

1628 search results - page 51 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
GD
2005
Springer
15 years 4 months ago
Hierarchical Layouts of Directed Graphs in Three Dimensions
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
Seok-Hee Hong, Nikola S. Nikolov
MLMTA
2007
15 years 17 days ago
Consensus Based Ensembles of Soft Clusterings
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
Kunal Punera, Joydeep Ghosh
ICTAI
1993
IEEE
15 years 3 months ago
Robust Feature Selection Algorithms
Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, adaptive cont...
Haleh Vafaie, Kenneth DeJong
65
Voted
ICPR
2006
IEEE
16 years 7 days ago
Approximation of Digital Curves using a Multi-Objective Genetic Algorithm
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...
Hervé Locteau, Romain Raveaux, Sébas...
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 4 months ago
Investigations in meta-GAs: panaceas or pipe dreams?
A meta-GA (GA within a GA) is used to investigate evolving the parameter settings of genetic operators for genetic and evolutionary algorithms (GEA) in the hope of creating a self...
Jeff Clune, Sherri Goings, Bill Punch, Eric Goodma...