2015
DOI: 10.1016/j.neucom.2013.12.065
|View full text |Cite
|
Sign up to set email alerts
|

Discriminative graph regularized extreme learning machine and its application to face recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
44
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
2
1

Relationship

3
5

Authors

Journals

citations
Cited by 105 publications
(44 citation statements)
references
References 37 publications
0
44
0
Order By: Relevance
“…Recent studies [22][23][24][25][26] have shown that learning performance can be greatly enhanced by considering the geometrical structure and local invariant idea [27]. It is obvious that this idea should be considered in both original data space and the reproducing kernel Hilbert space (RKHS).…”
Section: Introductionmentioning
confidence: 99%
“…Recent studies [22][23][24][25][26] have shown that learning performance can be greatly enhanced by considering the geometrical structure and local invariant idea [27]. It is obvious that this idea should be considered in both original data space and the reproducing kernel Hilbert space (RKHS).…”
Section: Introductionmentioning
confidence: 99%
“…Naturally, in ELM framework, it is necessary to introduce both properties to enhance its performance [21,22,26]. Fig.…”
Section: Discussionmentioning
confidence: 99%
“…Though many ELM variants were proposed in the last few years [16][17][18][19][20][21]8], the extension on ELM research focused mainly on the supervised learning tasks. This greatly limits the applicability of ELM in utilizing unlabeled data.…”
Section: Introductionmentioning
confidence: 99%
“…2) Graph regularized extreme learning machine: Graph regularized extreme Learning Machine (GELM) is based the idea that similar samples should share similar properties and through adding a graph regularization term on the objective of conventional ELM to ensure the output of samples from the same class should be similar [13]. The standard ELM with K hidden nodes with activation function g(x) can be modeled as following:…”
Section: ) Features Based On Statisticsmentioning
confidence: 99%
“…For the classification, Support vector machines (SVMs) have been extensively used in widespread applications and were proved to have good generalization ability. The discriminative graph regularized Extreme Learning Machine (GELM) also is used to improve the performance based on the idea that similar samples should share similar properties and were proved to achieve much performance gain over standard ELM [13]. Therefore, by using these classifiers, our proposed features and the existing wavelet energy features are evaluated respectively.…”
Section: Introductionmentioning
confidence: 99%