Examinando por Materia "Descriptors"

Mostrando 1 - 2 de 2
  • Miniatura
    Ítem
    Characterization, identification and location of voltage sags: review of state of art
    (Universidad EAFIT, 2012-06-15) Blanco Solano, Jairo; Petit Suárez, Johann F; Ordoñez Plata, Gabriel; Barrera Núñez, Víctor; Universidad Industrial de Santander; Universidad Industrial de Santander; Universidad Industrial de Santander; Universitat de Girona
  • No hay miniatura disponible
    Ítem
    LAMDA-HAD, an Extension to the LAMDA Classifier in the Context of Supervised Learning
    (World Scientific Publishing Co, 2020-01-01) Morales L.; Aguilar J.; Chávez D.; Isaza C.; Morales L.; Aguilar J.; Chávez D.; Isaza C.; Universidad EAFIT. Departamento de Ingeniería de Sistemas; I+D+I en Tecnologías de la Información y las Comunicaciones
    This paper proposes a new approach to improve the performance of Learning Algorithm for Multivariable Data Analysis (LAMDA). This algorithm can be used for supervised and unsupervised learning, based on the calculation of the Global Adequacy Degree (GAD) of one individual to a class, through the contributions of all its descriptors. LAMDA has the capability of creating new classes after the training stage. If an individual does not have enough similarity to the preexisting classes, it is evaluated with respect to a threshold called the Non-Informative Class (NIC), this being the novelty of the algorithm. However, LAMDA has problems making good classifications, either because the NIC is constant for all classes, or because the GAD calculation is unreliable. In this work, its efficiency is improved by two strategies, the first one, by the calculation of adaptable NICs for each class, which prevents that correctly classified individuals create new classes; and the second one, by computing the Higher Adequacy Degree (HAD), which grants more robustness to the algorithm. LAMDA-HAD is validated by applying it in different benchmarks and comparing it with LAMDA and other classifiers, through a statistical analysis to determinate the cases in which our algorithm presents a better performance. © 2019 World Scientific Publishing Company.