Conditioning of extreme learning machine for noisy data using heuristic optimization

datacite.rightshttp://purl.org/coar/access_right/c_abf2eng
dc.contributor.authorSalazar, E
dc.contributor.authorMora, M
dc.contributor.authorVásquez, A
dc.contributor.authorGelvez, E
dc.date.accessioned2020-08-27T23:53:04Z
dc.date.available2020-08-27T23:53:04Z
dc.date.issued2020
dc.description.abstractThis article provides a tool that can be used in the exact sciences to obtain good approximations to reality when noisy data is inevitable. Two heuristic optimization algorithms are implemented: Simulated Annealing and Particle Swarming for the determination of the extreme learning machine output weights. The first operates in a large search space and at each iteration it probabilistically decides between staying at its current state or moving to another. The swarm of particles, it optimizes a problem from a population of candidate solutions, moving them throughout the search space according to position and speed. The methodology consists of building data sets around a polynomial function, implementing the heuristic algorithms and comparing the errors with the traditional computation method using the Moore–Penrose inverse. The results show that the heuristic optimization algorithms implemented improve the estimation of the output weights when the input have highly noisy data.eng
dc.format.mimetypepdfeng
dc.identifier.issn17426588
dc.identifier.urihttps://hdl.handle.net/20.500.12442/6381
dc.identifier.urlhttps://iopscience.iop.org/article/10.1088/1742-6596/1514/1/012007/pdf
dc.language.isoengeng
dc.publisherIOP Publishingeng
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesseng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceJournal of Physics: Conference Serieseng
dc.sourceVol. 1514 No. 1 (2020)
dc.subjectExact scienceseng
dc.subjectDataeng
dc.subjectOptimization algorithmseng
dc.subjectHeuristic algorithmseng
dc.titleConditioning of extreme learning machine for noisy data using heuristic optimizationeng
dc.type.driverinfo:eu-repo/semantics/articleeng
dc.type.spaArtículo científicospa
dcterms.referencesVarela E and Campbells E 2011 Redes Neuronales Artificiales: Una revisión del estado del arte, aplicaciones y tendencias futuras Revista Investigación y Desarrollo en TIC 2 18spa
dcterms.referencesKarayiannis N and Venetsanopoulos A 2013 Artificial Neural Networks (New York: Springer Science+Business Media) Learning algorithms, performance evaluation, and applications 209eng
dcterms.referencesHornik K, Stinchcombe M and White H 1989 Multilayer feedforward networks are universal approximators Neural Networks 2 359eng
dcterms.referencesHuang G B, Chen L and Siew C K 2006 Universal approximation using incremental constructive feedforward networks with random hidden nodes IEEE Trans. Neural Networks 17 879eng
dcterms.referencesZhang L, Zhang D and Tian F 2016 SVM and ELM: Who Wins? Object recognition with deep convolutional features from ImageNet Proceedings of ELM-2015 1 249eng
dcterms.referencesHuang G B and Chen L 2008 Enhanced random search based incremental extreme learning machine Neurocomputing 71 3460eng
dcterms.referencesYang Y, Wang Y and Yuan X 2012 Bidirectional extreme learning machine for regression problem and its learning effectiveness IEEE Transactions on Neural Networks and Learning Systems 23 1498eng
dcterms.referencesCao W, Ming Z, Wang X and Cai S 2019 Improved bidirectional extreme learning machine based on enhanced random search Memetic Computing 11 19eng
dcterms.referencesMiche Y, Sorjamaa A, Bas P, Simula O, Jutten C and Lendasse A 2009 OP-ELM: Optimally pruned extreme learning machine IEEE transactions on Neural Networks 21 158eng
dcterms.referencesRanganathan S, Nakai K and Schonbach C 2018 Encyclopedia of Bioinformatics and Computational Biology: ABC of Bioinformatics (Cambridge: Elsevier)eng
dcterms.referencesKhachaturyan A, Semenovskaya S and Vainshtein B 1979 Statistical-thermodynamic approach to determination of structure amplitude phases Sov. Phys. Crystallography 24 519eng
dcterms.referencesKirkpatrick S, Gelatt J and Vecchi 1983 Optimization by simulated annealing Science 220 671eng
dcterms.referencesSemenovskaya S V, Khachaturyan K A and Khachaturyan A G 1985 Statistical mechanics approach to the determination of a crystal Acta Cryst. A41 268eng
dcterms.referencesBrownlee J 2011 Clever algorithms: Nature-inspired Programming Recipes (Autralia: Jason Brownlee)eng
dcterms.referencesEberhart R and Kennedy J 1995 Proceedings of ICNN'95 - International Conference on Neural Networks (Perth: IEEE) Particle swarm optimization 1942eng
dcterms.referencesEberhart R, Shi Y and Kennedy J 2001 Swarm Intelligence (San Diego: Academic Press)eng
oaire.versioninfo:eu-repo/semantics/publishedVersioneng

Archivos

Bloque original
Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
PDF.pdf
Tamaño:
1.02 MB
Formato:
Adobe Portable Document Format
Descripción:
PDF
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
381 B
Formato:
Item-specific license agreed upon to submission
Descripción:

Colecciones