I have a question about the support vector machine (SVM) kernel trick. How do you find the boundaries of the training data set in kernel projected space? Is that the same boundaries as you can obtain in original input space? Does kernel mapping change the data distribution? I am new to SVM, can someone please give me a straightforward explanation or links to related information?

  • $\begingroup$ boundaries in input space can be find via convex-hull or concaved-hull yet in kernel space there is no obvious way to find such exact boundaries as geometrical algorithms are not feasible. $\endgroup$ – tommi Sep 27 '13 at 19:15
  • $\begingroup$ see stats.stackexchange.com/questions/168051/… $\endgroup$ – user83346 Aug 22 '15 at 7:44

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.