Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai    |    Awaiting the gospel from Sarah Connor    |    1,954 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 918 of 1,954    |
|    Yaroslav Bulatov to All    |
|    Re: Extension of SMO algorithm for Suppo    |
|    11 Feb 06 23:00:45    |
      XPost: comp.ai.neural-nets       From: yaroslavvb@gmail.com              Keerthi did a presentation on SVM optimization methods at MLSS Canberra       and from his plots, active set QP method was several times faster than       the SMO. They also have finite convergence, and are independent of C.       See also "Solving the Quadratic Programming problem arising in support       vector classification." by L. Kaufman.              [ comp.ai is moderated. To submit, just post and be patient, or if ]       [ that fails mail your article to |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca