The 2013 International Joint Conference on Neural Networks (IJCNN) 2013
DOI: 10.1109/ijcnn.2013.6706860
|View full text |Cite
|
Sign up to set email alerts
|

Multidimensional splines with infinite number of knots as SVM kernels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
26
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 19 publications
(28 citation statements)
references
References 9 publications
2
26
0
Order By: Relevance
“…In Ref. [7], a multidimensional spline kernel was proposed as the multiplication of one-dimensional kernels (11) corresponding to each dimension of the data. 1 The authors also propose normalizing it to mitigate (but not avoid) numerical difficulties.…”
Section: Choosing a Kernel Function For Krlsmentioning
confidence: 99%
See 3 more Smart Citations
“…In Ref. [7], a multidimensional spline kernel was proposed as the multiplication of one-dimensional kernels (11) corresponding to each dimension of the data. 1 The authors also propose normalizing it to mitigate (but not avoid) numerical difficulties.…”
Section: Choosing a Kernel Function For Krlsmentioning
confidence: 99%
“…[7], the kernel in Expression (12) was experimentally evaluated only on SVM classification. In this work, we evaluate it on KRLS regression.…”
Section: Choosing a Kernel Function For Krlsmentioning
confidence: 99%
See 2 more Smart Citations
“…The first point is to choose a proper baseline algorithm for online sequential setting, and the second is to reconstruct a new balanced dataset with the raw distribution of online sequential data unchanged. As a classical learning algorithm SVM [12] is widely applied. However, it mainly tackles the small-scale learning problem, and is computationally expensive when facing large-scale data, especially in sequential learning settings.…”
Section: Introductionmentioning
confidence: 99%