2012
DOI: 10.1007/s00521-012-1053-8
|View full text |Cite
|
Sign up to set email alerts
|

Reviewing and designing pre-processing units for RBF networks: initial structure identification and coarse-tuning of free parameters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0
2

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 35 publications
0
4
0
2
Order By: Relevance
“…Furthermore, the center and spread width for each hidden node is determined by using k-means clustering algorithm [55,56]. The RBFNN is a fully connected three-layer FFNN and establishes nonlinearity in the hidden layer neurons.…”
Section: B Radial Basis Function Neural Network (Rbfnn)mentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, the center and spread width for each hidden node is determined by using k-means clustering algorithm [55,56]. The RBFNN is a fully connected three-layer FFNN and establishes nonlinearity in the hidden layer neurons.…”
Section: B Radial Basis Function Neural Network (Rbfnn)mentioning
confidence: 99%
“…In conventional RBFNN, training approach and the number of hidden nodes are usually defined according to the statistical properties of the input data. Furthermore, the center and spread width for each hidden node is determined by using k-means clustering algorithm [55,56].…”
Section: B Radial Basis Function Neural Network (Rbfnn)mentioning
confidence: 99%
“…Bulduğu küme sayısı en iyi olmamasına rağmen kullanıcıya bir başlangıç değeri sunar. Bu çalışmada [9]' da sunulan melez yapı denenmiştir. Kohanen ağı ile BCO (Bulanık C Ortalamalar) algoritması melez kullanılmıştır.…”
Section: Melez Yapı İle Müap Kümelemeunclassified
“…In the recent literature, many studies have dealt with multi-stage learning algorithms [6,10,12]; clustering algorithms for centroid relocation [4, 6-8, 10, 12, 13]; and optimal width adjustment for the basis functions [2,3,6,11,12,14,17]. To briefly describe a few, a three-stage algorithm, comprising k-means, k-nn and Optimal Steepest Descent (OSD) methods, is proposed in [12].…”
Section: Introductionmentioning
confidence: 99%