A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms
Abstract:
Although the general relevance of Testor Theory as the theoretical ground for useful feature selection procedures is well known, there are no practical means, nor any standard methodologies, for assessing the behavior of a testor-finding algorithm when faced with specific circumstances. In this work, we present a practical framework, with proven theoretical foundation, for assessing the behavior of both deterministic and meta-heuristic testor-finding algorithms when faced with specific phenomena. © Springer-Verlag 2013.
Año de publicación:
2013
Keywords:
- testor theory
- Typical testor algorithms
- feature selection
Fuente:

Tipo de documento:
Conference Object
Estado:
Acceso abierto
Áreas de conocimiento:
- Algoritmo
- Ciencias de la computación
- Ciencias de la computación
Áreas temáticas:
- Ciencias de la computación