A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms

Eduardo Alba-Cabrera; Julio Ibarra-Fiallo; Salvador Godoy-Calderon

doi:10.1007/978-3-642-41822-8_44

A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms

Eduardo Alba-Cabrera, Julio Ibarra-Fiallo, Salvador Godoy-Calderon

IPN

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

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.

Original language	English
Title of host publication	Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings
Pages	351-358
Number of pages	8
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-41822-8_44
State	Published - 2013
Event	18th Iberoamerican Congress on Pattern Recognition, CIARP 2013 - Havana, Cuba Duration: 20 Nov 2013 → 23 Nov 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	8258 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th Iberoamerican Congress on Pattern Recognition, CIARP 2013
Country/Territory	Cuba
City	Havana
Period	20/11/13 → 23/11/13

Keywords

Feature selection
Testor theory
Typical testor algorithms

Access to Document

10.1007/978-3-642-41822-8_44

Cite this

Alba-Cabrera, E., Ibarra-Fiallo, J., & Godoy-Calderon, S. (2013). A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings (PART 1 ed., pp. 351-358). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8258 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-41822-8_44

Alba-Cabrera, Eduardo ; Ibarra-Fiallo, Julio ; Godoy-Calderon, Salvador. / A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms. Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings. PART 1. ed. 2013. pp. 351-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{dc38a933e1854f81a03f723d6eb70ac3,

title = "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.",

keywords = "Feature selection, Testor theory, Typical testor algorithms",

author = "Eduardo Alba-Cabrera and Julio Ibarra-Fiallo and Salvador Godoy-Calderon",

note = "Funding Information: This research was supported by Collaboration Grants from Universidad San Francisco de Quito, Ecuador. The third author is also grateful for the finantial support by Instituto Polit{\'e}cnico Nacional and CONACyT, M{\'e}xico, particularly through project SIP-20130932; 18th Iberoamerican Congress on Pattern Recognition, CIARP 2013 ; Conference date: 20-11-2013 Through 23-11-2013",

year = "2013",

doi = "10.1007/978-3-642-41822-8_44",

language = "Ingl{\'e}s",

isbn = "9783642418211",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "351--358",

booktitle = "Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings",

edition = "PART 1",

}

Alba-Cabrera, E , Ibarra-Fiallo, J & Godoy-Calderon, S 2013, A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms. in Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 8258 LNCS, pp. 351-358, 18th Iberoamerican Congress on Pattern Recognition, CIARP 2013, Havana, Cuba, 20/11/13. https://doi.org/10.1007/978-3-642-41822-8_44

A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms. / Alba-Cabrera, Eduardo ; Ibarra-Fiallo, Julio; Godoy-Calderon, Salvador.
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings. PART 1. ed. 2013. p. 351-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8258 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms

AU - Alba-Cabrera, Eduardo

AU - Ibarra-Fiallo, Julio

AU - Godoy-Calderon, Salvador

N1 - Funding Information: This research was supported by Collaboration Grants from Universidad San Francisco de Quito, Ecuador. The third author is also grateful for the finantial support by Instituto Politécnico Nacional and CONACyT, México, particularly through project SIP-20130932

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Feature selection

KW - Testor theory

KW - Typical testor algorithms

UR - http://www.scopus.com/inward/record.url?scp=84893190462&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-41822-8_44

DO - 10.1007/978-3-642-41822-8_44

M3 - Contribución a la conferencia

AN - SCOPUS:84893190462

SN - 9783642418211

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 351

EP - 358

BT - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings

T2 - 18th Iberoamerican Congress on Pattern Recognition, CIARP 2013

Y2 - 20 November 2013 through 23 November 2013

ER -

Alba-Cabrera E , Ibarra-Fiallo J, Godoy-Calderon S. A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 18th Iberoamerican Congress, CIARP 2013, Proceedings. PART 1 ed. 2013. p. 351-358. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-41822-8_44

A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this