Dataset structure as prior information for parameter-free regularization of extreme learning machines
Regularization
Backus–Gilbert method
Extreme Learning Machine
Cosine similarity
Fisher information
DOI:
10.1016/j.neucom.2014.11.080
Publication Date:
2015-04-09T11:40:49Z
AUTHORS (4)
ABSTRACT
Abstract This paper proposes a novel regularization approach for Extreme Learning Machines. Regularization is performed using a priori spatial information expressed by an affinity matrix. We show that the use of this type of a priori information is similar to perform Tikhonov regularization. Furthermore, if a parameter free affinity matrix is used, like the cosine similarity matrix, regularization is performed without any need for parameter tuning. Experiments are performed using classification problems to validate the proposed approach.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (18)
CITATIONS (11)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....