I want to know that what is time complexity of the linear support vector machine and kernel support vector machine having tarring size n. If any one have good literature which describes time complexity of svm then please prove the link.
If you are referring to standard SVM it has O(N^3) time and O(N^2) space complexity where N is training set size using quadratic programming formulation. There are better implementation of SVM; one of them is mentioned above by R. K. Tripathi.
Hi colleagues,
Thank you for your answers. Do you know the complexity of the SMO implementation of SVM with polynomial kernel? This is a setting available in Weka open-source tool.
Thank you
https://www.thekerneltrip.com/machine/learning/computational-complexity-learning-algorithms/
- Badges
- Science topic