4255 search results - page 385 / 851 » On Learning Boolean Functions |
191
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
182
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
198
click to vote
ESANN
2006
15 years 8 months ago
2006
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
179
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...