Mostrando 9 resultados de: 9
Publisher
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(4)
IEEE Access(2)
International Geoscience and Remote Sensing Symposium (IGARSS)(1)
Pattern Recognition(1)
Pattern Recognition Letters(1)
Área temáticas
Programación informática, programas, datos, seguridad(5)
Ciencias de la computación(3)
Funcionamiento de bibliotecas y archivos(2)
Ciencias Naturales y Matemáticas(1)
Matemáticas(1)
An overview of the evolution of the concept of testor
ArticleAbstract: In this paper, the historical evolution of the concept of testor is presented. Testors in a bivaluedPalabras claves:Discriminating features, Feature combination, feature selection, TestorAutores:Eduardo Alba-Cabrera, Lazo-Cortes M.S., Ruiz-Shulcloper J.Fuentes:googlescopusA mixed learning strategy for finding typical testors in large datasets
Conference ObjectAbstract: This paper presents a mixed, global and local, learning strategy for finding typical testors in largPalabras claves:ALGORITHMS, feature selection, testor theoryAutores:Eduardo Alba-Cabrera, Godoy-Calderon S., González-Guevara V., Julio Ibarra-FialloFuentes:scopusA theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms
Conference ObjectAbstract: Although the general relevance of Testor Theory as the theoretical ground for useful feature selectiPalabras claves:feature selection, testor theory, Typical testor algorithmsAutores:Eduardo Alba-Cabrera, Godoy-Calderon S., Julio Ibarra-FialloFuentes:scopusDGLC: A density-based global logical combinatorial clustering algorithm for Large Mixed Incomplete Data
Conference ObjectAbstract: Clustering has been widely used in areas as Pattern Recognition, Data Analysis and Image Processing.Palabras claves:Autores:Eduardo Alba-Cabrera, Ruiz-Shulcloper J., Sanchez-Diaz G.Fuentes:googlescopusGenerating synthetic test matrices as a benchmark for the computational behavior of typical testor-finding algorithms
ArticleAbstract: Each typical testor-finding algorithm has a specific sensibility towards the number of rows, columnsPalabras claves:feature selection, testor theory, Typical testor algorithmsAutores:Eduardo Alba-Cabrera, Godoy-Calderon S., Julio Ibarra-FialloFuentes:scopusNew strategies for evaluating the performance of typical testor algorithms
Conference ObjectAbstract: Typical testors have been used in feature selection and supervised classification problems in the loPalabras claves:feature selection, Logical combinatorial PR, test matrices, testor theory, typical testors algorithmsAutores:Diego Guilcapi, Eduardo Alba-Cabrera, Julio Ibarra-FialloFuentes:scopusOn the Relation between the Concepts of Irreducible Testor and Minimal Transversal
ArticleAbstract: This paper aims at studying the relationship between two rather relevant theoretic fields such as GrPalabras claves:Graph Theory, Hitting set, Irreducible testor, Minimal transversal, testor theoryAutores:Carrasco-Ochoa J.A., Eduardo Alba-Cabrera, Fco Martinez-Trinidad J., Godoy-Calderon S., Lazo-Cortes M.S.Fuentes:googlescopusYYC: A fast performance incremental algorithm for finding typical testors
Conference ObjectAbstract: The last few years have seen an important increase in research publications dealing with external tyPalabras claves:feature selection, testor theory, Typical testor algorithmsAutores:Cervantes-Alonso F., Eduardo Alba-Cabrera, Godoy-Calderon S., Julio Ibarra-FialloFuentes:scopusSymbolic Learning for Improving the Performance of Transversal-Computation Algorithms
ArticleAbstract: Using the hypergraphs as the central data structure in dynamic discrete association problems is a coPalabras claves:LEARNING STRATEGY, minimal hitting set, Symbolic learning, transversal hypergraphAutores:Calvo H., Eduardo Alba-Cabrera, Godoy-Calderon S., González-Guevara V.Fuentes:googlescopus