Time Complexity Analysis of Support Vector Machines (SVM) in LibSVM
Citations
1,189 citations
443 citations
Cites background from "Time Complexity Analysis of Support..."
...It takes O(n3) time (Abdiansah and Wardoyo 2015) in the worst case and around O(n2) on typical cases, where n is the number of data points....
[...]
186 citations
Cites background from "Time Complexity Analysis of Support..."
...with problem and implementation, so these are rough estimates [186]....
[...]
155 citations
Cites background from "Time Complexity Analysis of Support..."
...Time complexity and space complexity are two types of computational complexity [81,82]....
[...]
114 citations
Cites background from "Time Complexity Analysis of Support..."
..., the time complexity for SVM is OðjEj(3)Þ [80], for RF and GBDT is OðTF jEjlog jEjÞ,...
[...]
...For supervised methods,the time complexity is mainly determined by the training part, e.g., the time complexity for SVM is OðjEj3Þ [80], for RF and GBDT is OðTF jEjlog jEjÞ, where T denotes the number of trees, F denotes the number of attributes [81]....
[...]
References
40,826 citations
40,147 citations
7,069 citations
6,562 citations
2,295 citations