LFD Book Forum  

Go Back   LFD Book Forum > Course Discussions > Online LFD course > The Final

 
 
Thread Tools Display Modes
Prev Previous Post   Next Post Next
  #1  
Old 09-17-2012, 03:26 AM
DavidNJ DavidNJ is offline
Member
 
Join Date: Jul 2012
Posts: 28
Default P13 Question

The problem wording is to find the runs that are not linearly separable with a hard margin SVM. The expectation is that there are some.

Using LIBSVM with C=10^6, Ein is always 0; svmpredict is always 100%. The number of support vectors varies between 6 and 12, mode and median are 8.

Based on the question I was expecting some to be linearly inseparable. I increased the noise level (from .25 to 5.0). Still solved everyone, although the number of support vectors went up.

I tried 1000 points instead of 100. Eout soared, but Ein didn't budge.
Reply With Quote
 

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -7. The time now is 03:31 AM.


Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2019, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.