Timeline for SVM - running time for detecting if data is linearly separable?
Current License: CC BY-SA 3.0
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 14, 2015 at 6:43 | comment | added | Marc Claesen | Linear SVM can be trained in sublinear time. The complexity of exact kernel SVM ranges from $O(n^2)$ to $O(n^3)$, depending on the strength of regularization, where $n$ is the size of your training set. | |
Aug 14, 2015 at 1:12 | answer | added | Danica | timeline score: 1 | |
Aug 1, 2015 at 16:32 | history | asked | Fequish | CC BY-SA 3.0 |