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

Gaussian kernel optimization: Complex problem and a simple solution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 23 publications
(8 citation statements)
references
References 4 publications
0
8
0
Order By: Relevance
“…The optimal complexity parameter in the SVM classifier is fixed by grid search. Throughout, the radial basis kernel function (RBF) is used and the corresponding kernel parameter can be determined by grid search or automatic methods [58], [59]. We select the method GFO for the supervised case proposed in [59] due to its simplicity.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The optimal complexity parameter in the SVM classifier is fixed by grid search. Throughout, the radial basis kernel function (RBF) is used and the corresponding kernel parameter can be determined by grid search or automatic methods [58], [59]. We select the method GFO for the supervised case proposed in [59] due to its simplicity.…”
Section: Resultsmentioning
confidence: 99%
“…Throughout, the radial basis kernel function (RBF) is used and the corresponding kernel parameter can be determined by grid search or automatic methods [58], [59]. We select the method GFO for the supervised case proposed in [59] due to its simplicity. In GFO, the optimal kernel parameter is approximated by the mathematical expectation of distances between data points.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The general mathematical form of the output nodes in an RBFN is as follows: gj(x)=i=1kwjiϕ(xμi;σi); g j ( x )is the function corresponding to the j th output node and is a linear combination of k radial basis functions ϕ() with center µ i and bandwidth σ i ; The value of σ can be estimated with data‐driven methods and we used a fixed bandwidth of 5 for each kernel function, which showed the best performance. Also, w ji is the weight associated with the link between the j th output node and the i th hidden node.…”
Section: Methodsmentioning
confidence: 99%
“…Because each sample is repeatedly used during iterations, the method consumes a large amount of computation time. Hence, we use Gaussian Kernel Optimization (GKO) [31] to optimize β in our experiments.…”
Section: Classification Using Svm With Gkomentioning
confidence: 99%