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

A fast modified constructive-covering algorithm for binary multi-layer neural networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…It was not easy to establish the model of complex production processes because there exists so much measurement noise that one pattern sample was labeled by at least one label. Similarly, the authors (Wang, 2008;Wang and Chaudhari, 2006) proposed a modified constructive-covering algorithm for binary NN. A separating hyperplane was obtained using geometrical distribution of pattern samples and the constructed separating hypersphere, and it was considered hidden unit.…”
Section: Introductionmentioning
confidence: 99%
“…It was not easy to establish the model of complex production processes because there exists so much measurement noise that one pattern sample was labeled by at least one label. Similarly, the authors (Wang, 2008;Wang and Chaudhari, 2006) proposed a modified constructive-covering algorithm for binary NN. A separating hyperplane was obtained using geometrical distribution of pattern samples and the constructed separating hypersphere, and it was considered hidden unit.…”
Section: Introductionmentioning
confidence: 99%
“…Sample classification, including linear and nonlinear sample classification, is the most basic problem in neural networks [1,2]. Linearly separable structures are employed in most classification cases due to the characteristic of being simple relatively.…”
Section: Introductionmentioning
confidence: 99%