Аннотация
We describe two versions of a novel approach to
developing binary classifiers, based on two
evolutionary computation paradigms: cellular
programming and genetic programming. Such an approach
achieves high computation efficiency both during
evolution and at runtime. Evolution speed is optimised
by allowing multiple solutions to be computed in
parallel. Runtime performance is optimized explicitly
using parallel computation in the case of cellular
programming or implicitly, taking advantage of the
intrinsic parallelism of bitwise operators on standard
sequential architectures in the case of genetic
programming.
The approach was tested on a digit recognition problem
and compared to a reference classifier.
Пользователи данного ресурса
Пожалуйста,
войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)