Kernel-based SVM Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "---- __NOTOC__ " to "---- __NOTOC__ ")
m (Text replacement - ". ----" to ". ----")
Line 3: Line 3:
** a [[Radial-Kernel SVM]].
** a [[Radial-Kernel SVM]].
* <B>See:</B> [[Linear SVM]].
* <B>See:</B> [[Linear SVM]].
----
----
----
----

Revision as of 18:39, 17 September 2021

A Kernel-based SVM Algorithm is an SVM algorithm that ...



References

2016

  • https://www.quora.com/Why-is-kernelized-SVM-much-slower-than-linear-SVM
    • QUOTE: Basically, a kernel-based SVM requires on the order of n^2 computation for training and order of nd computation for classification, where n is the number of training examples and d the input dimension (and assuming that the number of support vectors ends up being a fraction of n, which is shown to be expected in theory and in practice). Instead, a 2-class linear SVM requires on the order of nd computation for training (times the number of training iterations, which remains small even for large n) and on the order of d computations for classification.