TY - GEN
T1 - Learning Dendrite Morphological Neurons Using Linkage Trees for Pattern Classification
AU - Tovias-Alanis, Samuel Omar
AU - Gómez-Flores, Wilfrido
AU - Toscano-Pulido, Gregorio
AU - Sossa-Azuela, Juan Humberto
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - This article presents a Dendrite Morphological Neuron model learned by Linkage Trees (LT-DMN). It is presented as an alternative to modern DMN model training approaches based on k-means clustering that must tune the number of dendrites per class by defining a k-value. Also, the k-means based methods have a problem of non-reproducibility and, for each potential solution, they may present the risk of falling into local minima. The LT-DMN algorithm selects the centroids from a deterministic hierarchical clustering, which builds a linkage tree for each class of patterns. In addition, the simulated annealing algorithm is used to automatically fit a suitable cut-off point in the structure of each tree that minimizes the classification error and the number of dendrites. The proposed method is evaluated on nine synthetic data sets and 17 real-world problems. The results reveal that the proposed method is competitive or even better than seven DMN models from the literature. Furthermore, LT-DMN achieves low architectural complexity by using few dendrites.
AB - This article presents a Dendrite Morphological Neuron model learned by Linkage Trees (LT-DMN). It is presented as an alternative to modern DMN model training approaches based on k-means clustering that must tune the number of dendrites per class by defining a k-value. Also, the k-means based methods have a problem of non-reproducibility and, for each potential solution, they may present the risk of falling into local minima. The LT-DMN algorithm selects the centroids from a deterministic hierarchical clustering, which builds a linkage tree for each class of patterns. In addition, the simulated annealing algorithm is used to automatically fit a suitable cut-off point in the structure of each tree that minimizes the classification error and the number of dendrites. The proposed method is evaluated on nine synthetic data sets and 17 real-world problems. The results reveal that the proposed method is competitive or even better than seven DMN models from the literature. Furthermore, LT-DMN achieves low architectural complexity by using few dendrites.
KW - Classification
KW - Dendrite morphological neuron
KW - Linkage trees
KW - Spherical dendrites
UR - http://www.scopus.com/inward/record.url?scp=85133005153&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-07750-0_10
DO - 10.1007/978-3-031-07750-0_10
M3 - Contribución a la conferencia
AN - SCOPUS:85133005153
SN - 9783031077494
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 105
EP - 115
BT - Pattern Recognition - 14th Mexican Conference, MCPR 2022, Proceedings
A2 - Vergara-Villegas, Osslan Osiris
A2 - Cruz-Sánchez, Vianey Guadalupe
A2 - Sossa-Azuela, Juan Humberto
A2 - Carrasco-Ochoa, Jesús Ariel
A2 - Martínez-Trinidad, José Francisco
A2 - Olvera-López, José Arturo
PB - Springer Science and Business Media Deutschland GmbH
T2 - 14th Mexican Conference on Pattern Recognition, MCPR 2022
Y2 - 22 June 2022 through 25 June 2022
ER -