Dimension Reduction With Extreme Learning Machine

Data may often contain noise or irrelevant information, which negatively affect the generalization capability of machine learning algorithms. The objective of dimension reduction algorithms, such as principal component analysis (PCA), non-negative matrix factorization (NMF), random projection (RP),...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on image processing Ročník 25; číslo 8; s. 3906 - 3918
Hlavní autoři:	Kasun, Liyanaarachchi Lekamalage Chamara, Yang, Yan, Huang, Guang-Bin, Zhang, Zhengyou
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States IEEE 01.08.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms auto-encoder (AE) Dimension reduction Extreme Learning Machine (ELM) Learning Machine learning Machine learning algorithms Mathematical model Neural networks Noise Non-negative Matrix Factorization (NMF) Nonlinearity Object recognition Principal component analysis Principal Component Analysis (PCA) Principal components analysis random projection (RP) Reduction Regression analysis Subspaces Support vector machines Extreme learning machine (ELM) auto-encoder (AE) dimension reduction principal component analysis (PCA) random projection (RP) non-negative matrix factorization (NMF)
ISSN:	1057-7149, 1941-0042, 1941-0042
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Data may often contain noise or irrelevant information, which negatively affect the generalization capability of machine learning algorithms. The objective of dimension reduction algorithms, such as principal component analysis (PCA), non-negative matrix factorization (NMF), random projection (RP), and auto-encoder (AE), is to reduce the noise or irrelevant information of the data. The features of PCA (eigenvectors) and linear AE are not able to represent data as parts (e.g. nose in a face image). On the other hand, NMF and non-linear AE are maimed by slow learning speed and RP only represents a subspace of original data. This paper introduces a dimension reduction framework which to some extend represents data as parts, has fast learning speed, and learns the between-class scatter subspace. To this end, this paper investigates a linear and non-linear dimension reduction framework referred to as extreme learning machine AE (ELM-AE) and sparse ELM-AE (SELM-AE). In contrast to tied weight AE, the hidden neurons in ELM-AE and SELM-AE need not be tuned, and their parameters (e.g, input weights in additive neurons) are initialized using orthogonal and sparse random weights, respectively. Experimental results on USPS handwritten digit recognition data set, CIFAR-10 object recognition, and NORB object recognition data set show the efficacy of linear and non-linear ELM-AE and SELM-AE in terms of discriminative capability, sparsity, training time, and normalized mean square error.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ISSN:	1057-7149 1941-0042 1941-0042
DOI:	10.1109/TIP.2016.2570569