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

On extending extreme learning machine to non-redundant synergy pattern based graph classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 18 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…Two commonly-used methods for multi-class classification are one-against-all (OAA) and one-against-one (OAO) [41]. For the N-class problem, OAA builds N binary classifiers, one for each class separating the class from the others.…”
Section: Elm Ensemble Based On Gamentioning
confidence: 99%
“…Two commonly-used methods for multi-class classification are one-against-all (OAA) and one-against-one (OAO) [41]. For the N-class problem, OAA builds N binary classifiers, one for each class separating the class from the others.…”
Section: Elm Ensemble Based On Gamentioning
confidence: 99%