Please use this identifier to cite or link to this item: http://repositorio.ufc.br/handle/riufc/70716
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMattos, César Lincoln Cavalcante-
dc.contributor.authorBarreto, Guilherme de Alencar-
dc.contributor.authorAcuña, Gonzalo-
dc.date.accessioned2023-02-09T16:57:37Z-
dc.date.available2023-02-09T16:57:37Z-
dc.date.issued2017-
dc.identifier.citationMATTOS, C. L. C; BARRETO, G. A.; ACUÑA, G. Randomized neural networks for recursive system identification in the presence of outliers: a performance comparison. In: INTERNATIONAL WORK-CONFERENCE ON ARTIFICIAL NEURAL NETWORKS, 14., 2017, Cádis. Anais... Cádis: Springer, 2017. p. 1-12.pt_BR
dc.identifier.urihttp://www.repositorio.ufc.br/handle/riufc/70716-
dc.description.abstractIn this paper, randomized single-hidden layer feedforward networks (SLFNs) are extended to handle outliers sequentially in online system identification tasks involving large-scale datasets. Starting from the description of the original batch learning algorithms of the evaluated randomized SLFNs, we discuss how these neural architectures can be easily adapted to cope with sequential data by means of the famed least mean squares (LMS). In addition, a robust variant of this rule, known as the least mean M -estimate (LMM) rule, is used to cope with outliers. Comprehensive performance comparison on benchmarking datasets are carried out in order to assess the validity of the proposed methodology.pt_BR
dc.language.isoenpt_BR
dc.publisherInternational Work-Conference on Artificial Neural Networkspt_BR
dc.subjectRandomized SLFNspt_BR
dc.subjectOnline system identificationpt_BR
dc.subjectNARX modelpt_BR
dc.subjectOutlierspt_BR
dc.titleRandomized neural networks for recursive system identification in the presence of outliers: a performance comparisonpt_BR
dc.typeArtigo de Eventopt_BR
Appears in Collections:DETE - Trabalhos apresentados em eventos

Files in This Item:
File Description SizeFormat 
2017_eve_gabarreto.pdf552,78 kBAdobe PDFView/Open


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