Sequential Minimal Optimization

The value yi is +1 for the positive examples in a class and –1 for the negative examples. Using a Lagrangian, this optimization problem can be converted into a dual form which is a QP problem where the objective function is solely dependent on a set of Lagrange multipliers i, (where N is the number of training examples), subject to the inequality constraints, and one linear equality ... ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download