Please use this identifier to cite or link to this item: http://repositorio.ufc.br/handle/riufc/70721
Type: Artigo de Evento
Title: Improving the classification performance of optimal linear associative memory in the presence of outliers
Authors: Barros, Ana Luiza Bessa de Paula
Barreto, Guilherme de Alencar
Keywords: Linear associative memory;Moore-Penrose generalized inverse;Pattern classification;Outliers;M-estimation
Issue Date: 2013
Publisher: International Work-Conference on Artificial Neural Networks
Citation: BARROS, A. L. B. P.; BARRETO, G. A. Improving the classification performance of optimal linear associative memory in the presence of outliers. In: INTERNATIONAL WORK-CONFERENCE ON ARTIFICIAL NEURAL NETWORKS, 12., 2013, Tenerife. Anais... Tenerife: Springer, 2013. p. 1-11.
Abstract: The optimal linear associative memory (OLAM) proposed by Kohonen and Ruohonen [16] is a classic neural network model widely used as a standalone pattern classifier or as a fundamental component of multilayer nonlinear classification approaches, such as the extreme learning machine (ELM) [10] and the echo-state network (ESN) [6]. In this paper, we develop an extension of OLAM which is robust to labeling errors (outliers) in the data set. The proposed model is robust to label noise not only near the class boundaries, but also far from the class boundaries which can result from mistakes in labelling or gross errors in measuring the input features. To deal with this problem, we propose the use of M -estimators, a parameter estimation framework widely used in robust regression, to compute the weight matrix operator, instead of using the ordinary least squares solution. We show the usefulness of the proposed classification approach through simulation results using synthetic and real-world data.
URI: http://www.repositorio.ufc.br/handle/riufc/70721
Appears in Collections:DETE - Trabalhos apresentados em eventos

Files in This Item:
File Description SizeFormat 
2013_eve_gabarreto.pdf156,27 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.