Parallelization Algorithm for the Calculation of Typical Testors Based on YYC

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

In the present work, a new method is proposed to find typical testors, which helps reduce the number of features needed to carry out classification processes. Using the strategy of divide and conquer, we divide a basic matrix into blocks, then we find the typical testors of the defined blocks. To find the typical testors of the complete basic matrix, unions between the elements of these sets obtained from the blocks are tested. A criterion is developed to determine when the unions of typical testors of blocks form typical testors of the complete matrix. The performance of the method is evaluated using synthetic matrices. The execution time of the method in parallel and sequential versions was compared and contrasted with the YYC algorithm used for the complete basic matrix. Finally, its performance is analyzed in a real database obtained from the UCI Repository.

Idioma originalInglés
Título de la publicación alojadaInformation Systems and Technologies - WorldCIST 2023
EditoresAlvaro Rocha, Hojjat Adeli, Gintautas Dzemyda, Fernando Moreira, Valentina Colla
EditorialSpringer Science and Business Media Deutschland GmbH
Páginas477-489
Número de páginas13
ISBN (versión impresa)9783031456411
DOI
EstadoPublicada - 2024
Evento11th World Conference on Information Systems and Technologies, WorldCIST 2023 - Pisa, Italia
Duración: 4 abr. 20236 abr. 2023

Serie de la publicación

NombreLecture Notes in Networks and Systems
Volumen799 LNNS
ISSN (versión impresa)2367-3370
ISSN (versión digital)2367-3389

Conferencia

Conferencia11th World Conference on Information Systems and Technologies, WorldCIST 2023
País/TerritorioItalia
CiudadPisa
Período4/04/236/04/23

Huella

Profundice en los temas de investigación de 'Parallelization Algorithm for the Calculation of Typical Testors Based on YYC'. En conjunto forman una huella única.

Citar esto