Parallelization Algorithm for the Calculation of Typical Testors Based on YYC

Ariana Soria-Salgado; Julio Ibarra-Fiallo; Eduardo Alba-Cabrera

doi:10.1007/978-3-031-45642-8_47

Parallelization Algorithm for the Calculation of Typical Testors Based on YYC

Ariana Soria-Salgado, Julio Ibarra-Fiallo, Eduardo Alba-Cabrera

Universidad San Francisco de Quito

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

Abstract

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.

Original language	English
Title of host publication	Information Systems and Technologies - WorldCIST 2023
Editors	Alvaro Rocha, Hojjat Adeli, Gintautas Dzemyda, Fernando Moreira, Valentina Colla
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	477-489
Number of pages	13
ISBN (Print)	9783031456411
DOIs	https://doi.org/10.1007/978-3-031-45642-8_47
State	Published - 2024
Event	11th World Conference on Information Systems and Technologies, WorldCIST 2023 - Pisa, Italy Duration: 4 Apr 2023 → 6 Apr 2023

Publication series

Name	Lecture Notes in Networks and Systems
Volume	799 LNNS
ISSN (Print)	2367-3370
ISSN (Electronic)	2367-3389

Conference

Conference	11th World Conference on Information Systems and Technologies, WorldCIST 2023
Country/Territory	Italy
City	Pisa
Period	4/04/23 → 6/04/23

Keywords

accuracy
classification
computational efficiency
neural networks
pattern recognition
time execution
typical testors

Access to Document

10.1007/978-3-031-45642-8_47

Cite this

Soria-Salgado, A., Ibarra-Fiallo, J., & Alba-Cabrera, E. (2024). Parallelization Algorithm for the Calculation of Typical Testors Based on YYC. In A. Rocha, H. Adeli, G. Dzemyda, F. Moreira, & V. Colla (Eds.), Information Systems and Technologies - WorldCIST 2023 (pp. 477-489). (Lecture Notes in Networks and Systems; Vol. 799 LNNS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-45642-8_47

Soria-Salgado, Ariana ; Ibarra-Fiallo, Julio ; Alba-Cabrera, Eduardo. / Parallelization Algorithm for the Calculation of Typical Testors Based on YYC. Information Systems and Technologies - WorldCIST 2023. editor / Alvaro Rocha ; Hojjat Adeli ; Gintautas Dzemyda ; Fernando Moreira ; Valentina Colla. Springer Science and Business Media Deutschland GmbH, 2024. pp. 477-489 (Lecture Notes in Networks and Systems).

@inproceedings{c6b5913d5a5748ca84f75073c164586c,

title = "Parallelization Algorithm for the Calculation of Typical Testors Based on YYC",

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

keywords = "accuracy, classification, computational efficiency, neural networks, pattern recognition, time execution, typical testors",

author = "Ariana Soria-Salgado and Julio Ibarra-Fiallo and Eduardo Alba-Cabrera",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.; 11th World Conference on Information Systems and Technologies, WorldCIST 2023 ; Conference date: 04-04-2023 Through 06-04-2023",

year = "2024",

doi = "10.1007/978-3-031-45642-8_47",

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

isbn = "9783031456411",

series = "Lecture Notes in Networks and Systems",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "477--489",

editor = "Alvaro Rocha and Hojjat Adeli and Gintautas Dzemyda and Fernando Moreira and Valentina Colla",

booktitle = "Information Systems and Technologies - WorldCIST 2023",

}

Soria-Salgado, A, Ibarra-Fiallo, J & Alba-Cabrera, E 2024, Parallelization Algorithm for the Calculation of Typical Testors Based on YYC. in A Rocha, H Adeli, G Dzemyda, F Moreira & V Colla (eds), Information Systems and Technologies - WorldCIST 2023. Lecture Notes in Networks and Systems, vol. 799 LNNS, Springer Science and Business Media Deutschland GmbH, pp. 477-489, 11th World Conference on Information Systems and Technologies, WorldCIST 2023, Pisa, Italy, 4/04/23. https://doi.org/10.1007/978-3-031-45642-8_47

Parallelization Algorithm for the Calculation of Typical Testors Based on YYC. / Soria-Salgado, Ariana; Ibarra-Fiallo, Julio ; Alba-Cabrera, Eduardo.
Information Systems and Technologies - WorldCIST 2023. ed. / Alvaro Rocha; Hojjat Adeli; Gintautas Dzemyda; Fernando Moreira; Valentina Colla. Springer Science and Business Media Deutschland GmbH, 2024. p. 477-489 (Lecture Notes in Networks and Systems; Vol. 799 LNNS).

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

TY - GEN

T1 - Parallelization Algorithm for the Calculation of Typical Testors Based on YYC

AU - Soria-Salgado, Ariana

AU - Ibarra-Fiallo, Julio

AU - Alba-Cabrera, Eduardo

N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

PY - 2024

Y1 - 2024

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

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

KW - accuracy

KW - classification

KW - computational efficiency

KW - neural networks

KW - pattern recognition

KW - time execution

KW - typical testors

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

U2 - 10.1007/978-3-031-45642-8_47

DO - 10.1007/978-3-031-45642-8_47

M3 - Contribución a la conferencia

AN - SCOPUS:85187662118

SN - 9783031456411

T3 - Lecture Notes in Networks and Systems

SP - 477

EP - 489

BT - Information Systems and Technologies - WorldCIST 2023

A2 - Rocha, Alvaro

A2 - Adeli, Hojjat

A2 - Dzemyda, Gintautas

A2 - Moreira, Fernando

A2 - Colla, Valentina

PB - Springer Science and Business Media Deutschland GmbH

T2 - 11th World Conference on Information Systems and Technologies, WorldCIST 2023

Y2 - 4 April 2023 through 6 April 2023

ER -

Soria-Salgado A, Ibarra-Fiallo J , Alba-Cabrera E. Parallelization Algorithm for the Calculation of Typical Testors Based on YYC. In Rocha A, Adeli H, Dzemyda G, Moreira F, Colla V, editors, Information Systems and Technologies - WorldCIST 2023. Springer Science and Business Media Deutschland GmbH. 2024. p. 477-489. (Lecture Notes in Networks and Systems). doi: 10.1007/978-3-031-45642-8_47