some svm typos corrected
This commit is contained in:
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
@@ -174,7 +174,7 @@ MathJax.Hub.Config({
|
||||
<center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
|
||||
<br>
|
||||
<p>
|
||||
<center><h4>Nov 23, 2019</h4></center> <!-- date -->
|
||||
<center><h4>Nov 25, 2019</h4></center> <!-- date -->
|
||||
<br>
|
||||
<p>
|
||||
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
@@ -155,7 +155,7 @@ MathJax.Hub.Config({
|
||||
<a name="part0012"></a>
|
||||
<!-- !split -->
|
||||
|
||||
<h2 id="___sec11" class="anchor">A quick reminder on Lagrangian multipliers </h2>
|
||||
<h2 id="___sec11" class="anchor">A quick Reminder on Lagrangian Multipliers </h2>
|
||||
|
||||
<p>
|
||||
Consider a function of three independent variables \( f(x,y,z) \) . For the function \( f \) to be an
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
@@ -155,7 +155,7 @@ MathJax.Hub.Config({
|
||||
<a name="part0013"></a>
|
||||
<!-- !split -->
|
||||
|
||||
<h2 id="___sec12" class="anchor">Adding the muliplier </h2>
|
||||
<h2 id="___sec12" class="anchor">Adding the Multiplier </h2>
|
||||
|
||||
<p>
|
||||
However, we can add to
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
@@ -155,7 +155,7 @@ MathJax.Hub.Config({
|
||||
<a name="part0014"></a>
|
||||
<!-- !split -->
|
||||
|
||||
<h2 id="___sec13" class="anchor">Setting up the problem </h2>
|
||||
<h2 id="___sec13" class="anchor">Setting up the Problem </h2>
|
||||
In order to solve the above problem, we define the following Lagrangian function to be minimized
|
||||
$$
|
||||
{\cal L}(\lambda,b,\boldsymbol{w})=\frac{1}{2}\boldsymbol{w}^T\boldsymbol{w}-\sum_{i=1}^n\lambda_i\left[y_i(\boldsymbol{w}^T\boldsymbol{x}_i+b)-1\right],
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
@@ -158,11 +158,11 @@ MathJax.Hub.Config({
|
||||
<h2 id="___sec18" class="anchor">Kernels and non-linearity </h2>
|
||||
|
||||
<p>
|
||||
The cases we have studied till were all characterized by two classes
|
||||
The cases we have studied till now, were all characterized by two classes
|
||||
with a close to linear separability. The classifiers we have described
|
||||
so far find linear boundaries in our input feature space. It is
|
||||
possible to make our procedure more flexible by exploring the feature
|
||||
space using other basis expansions such higher-order polynomials,
|
||||
space using other basis expansions such as higher-order polynomials,
|
||||
wavelets, splines etc.
|
||||
|
||||
<p>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
@@ -175,7 +175,7 @@ y_i(\boldsymbol{w}^T\boldsymbol{z}_i+b)= 1 \hspace{0.1cm}\forall i,
|
||||
$$
|
||||
|
||||
from which we also find \( b \).
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kerne \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kernel \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
$$
|
||||
K(\boldsymbol{x}_i,\boldsymbol{x}_j)=\boldsymbol{z}_i^T\boldsymbol{z}_j= \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j).
|
||||
$$
|
||||
@@ -195,7 +195,7 @@ the dot product \( (\boldsymbol{x}_i^T\boldsymbol{x}_j)^2 \).
|
||||
This leads to the so-called
|
||||
kernel trick and the result leads to the same as if we went through
|
||||
the trouble of performing the transformation
|
||||
\( (\phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
\( \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
|
||||
<p>
|
||||
<p>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
|
||||
@@ -52,12 +52,12 @@ Automatically generated HTML file from DocOnce source
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -123,9 +123,9 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs009.html#___sec8" style="font-size: 80%;">Code Example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs010.html#___sec9" style="font-size: 80%;">Problems with the Simpler Approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs011.html#___sec10" style="font-size: 80%;">A better approach</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick reminder on Lagrangian multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the muliplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs012.html#___sec11" style="font-size: 80%;">A quick Reminder on Lagrangian Multipliers</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs013.html#___sec12" style="font-size: 80%;">Adding the Multiplier</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs014.html#___sec13" style="font-size: 80%;">Setting up the Problem</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs015.html#___sec14" style="font-size: 80%;">The problem to solve</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs016.html#___sec15" style="font-size: 80%;">The last steps</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._svm-bs017.html#___sec16" style="font-size: 80%;">A soft classifier</a></li>
|
||||
@@ -174,7 +174,7 @@ MathJax.Hub.Config({
|
||||
<center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
|
||||
<br>
|
||||
<p>
|
||||
<center><h4>Nov 23, 2019</h4></center> <!-- date -->
|
||||
<center><h4>Nov 25, 2019</h4></center> <!-- date -->
|
||||
<br>
|
||||
<p>
|
||||
|
||||
|
||||
@@ -148,7 +148,7 @@ MathJax.Hub.Config({
|
||||
<center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
|
||||
<br>
|
||||
<p> <br>
|
||||
<center><h4>Nov 23, 2019</h4></center> <!-- date -->
|
||||
<center><h4>Nov 25, 2019</h4></center> <!-- date -->
|
||||
<br>
|
||||
<p>
|
||||
|
||||
@@ -554,7 +554,7 @@ about Lagrangian multipliers.
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec11">A quick reminder on Lagrangian multipliers </h2>
|
||||
<h2 id="___sec11">A quick Reminder on Lagrangian Multipliers </h2>
|
||||
|
||||
<p>
|
||||
Consider a function of three independent variables \( f(x,y,z) \) . For the function \( f \) to be an
|
||||
@@ -616,7 +616,7 @@ Then \( dz \) is no longer arbitrary.
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec12">Adding the muliplier </h2>
|
||||
<h2 id="___sec12">Adding the Multiplier </h2>
|
||||
|
||||
<p>
|
||||
However, we can add to
|
||||
@@ -671,7 +671,7 @@ $$
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec13">Setting up the problem </h2>
|
||||
<h2 id="___sec13">Setting up the Problem </h2>
|
||||
In order to solve the above problem, we define the following Lagrangian function to be minimized
|
||||
<p> <br>
|
||||
$$
|
||||
@@ -909,11 +909,11 @@ $$
|
||||
<h2 id="___sec18">Kernels and non-linearity </h2>
|
||||
|
||||
<p>
|
||||
The cases we have studied till were all characterized by two classes
|
||||
The cases we have studied till now, were all characterized by two classes
|
||||
with a close to linear separability. The classifiers we have described
|
||||
so far find linear boundaries in our input feature space. It is
|
||||
possible to make our procedure more flexible by exploring the feature
|
||||
space using other basis expansions such higher-order polynomials,
|
||||
space using other basis expansions such as higher-order polynomials,
|
||||
wavelets, splines etc.
|
||||
|
||||
<p>
|
||||
@@ -1006,7 +1006,7 @@ $$
|
||||
<p> <br>
|
||||
|
||||
from which we also find \( b \).
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kerne \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kernel \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
<p> <br>
|
||||
$$
|
||||
K(\boldsymbol{x}_i,\boldsymbol{x}_j)=\boldsymbol{z}_i^T\boldsymbol{z}_j= \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j).
|
||||
@@ -1030,7 +1030,7 @@ the dot product \( (\boldsymbol{x}_i^T\boldsymbol{x}_j)^2 \).
|
||||
This leads to the so-called
|
||||
kernel trick and the result leads to the same as if we went through
|
||||
the trouble of performing the transformation
|
||||
\( (\phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
\( \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
</section>
|
||||
|
||||
|
||||
|
||||
@@ -46,12 +46,12 @@ div { text-align: justify; text-justify: inter-word; }
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -110,7 +110,7 @@ MathJax.Hub.Config({
|
||||
<center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
|
||||
<br>
|
||||
<p>
|
||||
<center><h4>Nov 23, 2019</h4></center> <!-- date -->
|
||||
<center><h4>Nov 25, 2019</h4></center> <!-- date -->
|
||||
<br>
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
@@ -472,7 +472,7 @@ about Lagrangian multipliers.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec11">A quick reminder on Lagrangian multipliers </h2>
|
||||
<h2 id="___sec11">A quick Reminder on Lagrangian Multipliers </h2>
|
||||
|
||||
<p>
|
||||
Consider a function of three independent variables \( f(x,y,z) \) . For the function \( f \) to be an
|
||||
@@ -522,7 +522,7 @@ Then \( dz \) is no longer arbitrary.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec12">Adding the muliplier </h2>
|
||||
<h2 id="___sec12">Adding the Multiplier </h2>
|
||||
|
||||
<p>
|
||||
However, we can add to
|
||||
@@ -565,7 +565,7 @@ $$
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec13">Setting up the problem </h2>
|
||||
<h2 id="___sec13">Setting up the Problem </h2>
|
||||
In order to solve the above problem, we define the following Lagrangian function to be minimized
|
||||
$$
|
||||
{\cal L}(\lambda,b,\boldsymbol{w})=\frac{1}{2}\boldsymbol{w}^T\boldsymbol{w}-\sum_{i=1}^n\lambda_i\left[y_i(\boldsymbol{w}^T\boldsymbol{x}_i+b)-1\right],
|
||||
@@ -756,11 +756,11 @@ $$
|
||||
<h2 id="___sec18">Kernels and non-linearity </h2>
|
||||
|
||||
<p>
|
||||
The cases we have studied till were all characterized by two classes
|
||||
The cases we have studied till now, were all characterized by two classes
|
||||
with a close to linear separability. The classifiers we have described
|
||||
so far find linear boundaries in our input feature space. It is
|
||||
possible to make our procedure more flexible by exploring the feature
|
||||
space using other basis expansions such higher-order polynomials,
|
||||
space using other basis expansions such as higher-order polynomials,
|
||||
wavelets, splines etc.
|
||||
|
||||
<p>
|
||||
@@ -846,7 +846,7 @@ y_i(\boldsymbol{w}^T\boldsymbol{z}_i+b)= 1 \hspace{0.1cm}\forall i,
|
||||
$$
|
||||
|
||||
from which we also find \( b \).
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kerne \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kernel \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
$$
|
||||
K(\boldsymbol{x}_i,\boldsymbol{x}_j)=\boldsymbol{z}_i^T\boldsymbol{z}_j= \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j).
|
||||
$$
|
||||
@@ -866,7 +866,7 @@ the dot product \( (\boldsymbol{x}_i^T\boldsymbol{x}_j)^2 \).
|
||||
This leads to the so-called
|
||||
kernel trick and the result leads to the same as if we went through
|
||||
the trouble of performing the transformation
|
||||
\( (\phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
\( \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
+11
-11
@@ -51,12 +51,12 @@ div { text-align: justify; text-justify: inter-word; }
|
||||
('Code Example', 2, None, '___sec8'),
|
||||
('Problems with the Simpler Approach', 2, None, '___sec9'),
|
||||
('A better approach', 2, None, '___sec10'),
|
||||
('A quick reminder on Lagrangian multipliers',
|
||||
('A quick Reminder on Lagrangian Multipliers',
|
||||
2,
|
||||
None,
|
||||
'___sec11'),
|
||||
('Adding the muliplier', 2, None, '___sec12'),
|
||||
('Setting up the problem', 2, None, '___sec13'),
|
||||
('Adding the Multiplier', 2, None, '___sec12'),
|
||||
('Setting up the Problem', 2, None, '___sec13'),
|
||||
('The problem to solve', 2, None, '___sec14'),
|
||||
('The last steps', 2, None, '___sec15'),
|
||||
('A soft classifier', 2, None, '___sec16'),
|
||||
@@ -115,7 +115,7 @@ MathJax.Hub.Config({
|
||||
<center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
|
||||
<br>
|
||||
<p>
|
||||
<center><h4>Nov 23, 2019</h4></center> <!-- date -->
|
||||
<center><h4>Nov 25, 2019</h4></center> <!-- date -->
|
||||
<br>
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
@@ -477,7 +477,7 @@ about Lagrangian multipliers.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec11">A quick reminder on Lagrangian multipliers </h2>
|
||||
<h2 id="___sec11">A quick Reminder on Lagrangian Multipliers </h2>
|
||||
|
||||
<p>
|
||||
Consider a function of three independent variables \( f(x,y,z) \) . For the function \( f \) to be an
|
||||
@@ -527,7 +527,7 @@ Then \( dz \) is no longer arbitrary.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec12">Adding the muliplier </h2>
|
||||
<h2 id="___sec12">Adding the Multiplier </h2>
|
||||
|
||||
<p>
|
||||
However, we can add to
|
||||
@@ -570,7 +570,7 @@ $$
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec13">Setting up the problem </h2>
|
||||
<h2 id="___sec13">Setting up the Problem </h2>
|
||||
In order to solve the above problem, we define the following Lagrangian function to be minimized
|
||||
$$
|
||||
{\cal L}(\lambda,b,\boldsymbol{w})=\frac{1}{2}\boldsymbol{w}^T\boldsymbol{w}-\sum_{i=1}^n\lambda_i\left[y_i(\boldsymbol{w}^T\boldsymbol{x}_i+b)-1\right],
|
||||
@@ -761,11 +761,11 @@ $$
|
||||
<h2 id="___sec18">Kernels and non-linearity </h2>
|
||||
|
||||
<p>
|
||||
The cases we have studied till were all characterized by two classes
|
||||
The cases we have studied till now, were all characterized by two classes
|
||||
with a close to linear separability. The classifiers we have described
|
||||
so far find linear boundaries in our input feature space. It is
|
||||
possible to make our procedure more flexible by exploring the feature
|
||||
space using other basis expansions such higher-order polynomials,
|
||||
space using other basis expansions such as higher-order polynomials,
|
||||
wavelets, splines etc.
|
||||
|
||||
<p>
|
||||
@@ -851,7 +851,7 @@ y_i(\boldsymbol{w}^T\boldsymbol{z}_i+b)= 1 \hspace{0.1cm}\forall i,
|
||||
$$
|
||||
|
||||
from which we also find \( b \).
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kerne \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
To compute \( \boldsymbol{z}_i^T\boldsymbol{z}_j \) we define the kernel \( K(\boldsymbol{x}_i,\boldsymbol{x}_j) \) as
|
||||
$$
|
||||
K(\boldsymbol{x}_i,\boldsymbol{x}_j)=\boldsymbol{z}_i^T\boldsymbol{z}_j= \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j).
|
||||
$$
|
||||
@@ -871,7 +871,7 @@ the dot product \( (\boldsymbol{x}_i^T\boldsymbol{x}_j)^2 \).
|
||||
This leads to the so-called
|
||||
kernel trick and the result leads to the same as if we went through
|
||||
the trouble of performing the transformation
|
||||
\( (\phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
\( \phi(\boldsymbol{x}_i)^T\phi(\boldsymbol{x}_j) \) during the SVM calculations.
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
Binary file not shown.
@@ -10,7 +10,7 @@
|
||||
"<!-- Author: --> \n",
|
||||
"**Morten Hjorth-Jensen**, Department of Physics, University of Oslo and Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University\n",
|
||||
"\n",
|
||||
"Date: **Nov 23, 2019**\n",
|
||||
"Date: **Nov 25, 2019**\n",
|
||||
"\n",
|
||||
"Copyright 1999-2019, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license\n",
|
||||
"\n",
|
||||
@@ -526,7 +526,7 @@
|
||||
"possible margin $M$. Before we proceed, we need to remind ourselves\n",
|
||||
"about Lagrangian multipliers.\n",
|
||||
"\n",
|
||||
"## A quick reminder on Lagrangian multipliers\n",
|
||||
"## A quick Reminder on Lagrangian Multipliers\n",
|
||||
"\n",
|
||||
"Consider a function of three independent variables $f(x,y,z)$ . For the function $f$ to be an\n",
|
||||
"extreme we have"
|
||||
@@ -637,7 +637,7 @@
|
||||
"variables.\n",
|
||||
"Then $dz$ is no longer arbitrary.\n",
|
||||
"\n",
|
||||
"## Adding the muliplier\n",
|
||||
"## Adding the Multiplier\n",
|
||||
"\n",
|
||||
"However, we can add to"
|
||||
]
|
||||
@@ -741,7 +741,7 @@
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Setting up the problem\n",
|
||||
"## Setting up the Problem\n",
|
||||
"In order to solve the above problem, we define the following Lagrangian function to be minimized"
|
||||
]
|
||||
},
|
||||
@@ -1169,11 +1169,11 @@
|
||||
"source": [
|
||||
"## Kernels and non-linearity\n",
|
||||
"\n",
|
||||
"The cases we have studied till were all characterized by two classes\n",
|
||||
"The cases we have studied till now, were all characterized by two classes\n",
|
||||
"with a close to linear separability. The classifiers we have described\n",
|
||||
"so far find linear boundaries in our input feature space. It is\n",
|
||||
"possible to make our procedure more flexible by exploring the feature\n",
|
||||
"space using other basis expansions such higher-order polynomials,\n",
|
||||
"space using other basis expansions such as higher-order polynomials,\n",
|
||||
"wavelets, splines etc.\n",
|
||||
"\n",
|
||||
"If our feature space is not easy to separate, as shown in the figure\n",
|
||||
@@ -1296,7 +1296,7 @@
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"from which we also find $b$.\n",
|
||||
"To compute $\\boldsymbol{z}_i^T\\boldsymbol{z}_j$ we define the kerne $K(\\boldsymbol{x}_i,\\boldsymbol{x}_j)$ as"
|
||||
"To compute $\\boldsymbol{z}_i^T\\boldsymbol{z}_j$ we define the kernel $K(\\boldsymbol{x}_i,\\boldsymbol{x}_j)$ as"
|
||||
]
|
||||
},
|
||||
{
|
||||
@@ -1337,7 +1337,7 @@
|
||||
"This leads to the so-called\n",
|
||||
"kernel trick and the result leads to the same as if we went through\n",
|
||||
"the trouble of performing the transformation\n",
|
||||
"$(\\phi(\\boldsymbol{x}_i)^T\\phi(\\boldsymbol{x}_j)$ during the SVM calculations.\n",
|
||||
"$\\phi(\\boldsymbol{x}_i)^T\\phi(\\boldsymbol{x}_j)$ during the SVM calculations.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"## The problem to solve\n",
|
||||
|
||||
Binary file not shown.
@@ -342,7 +342,7 @@ possible margin $M$. Before we proceed, we need to remind ourselves
|
||||
about Lagrangian multipliers.
|
||||
|
||||
!split
|
||||
===== A quick reminder on Lagrangian multipliers =====
|
||||
===== A quick Reminder on Lagrangian Multipliers =====
|
||||
|
||||
Consider a function of three independent variables $f(x,y,z)$ . For the function $f$ to be an
|
||||
extreme we have
|
||||
@@ -394,7 +394,7 @@ variables.
|
||||
Then $dz$ is no longer arbitrary.
|
||||
|
||||
!split
|
||||
===== Adding the muliplier =====
|
||||
===== Adding the Multiplier =====
|
||||
|
||||
However, we can add to
|
||||
!bt
|
||||
@@ -441,7 +441,7 @@ If we have a set of constraints $\phi_k$ we have the equations
|
||||
!et
|
||||
|
||||
!split
|
||||
===== Setting up the problem =====
|
||||
===== Setting up the Problem =====
|
||||
In order to solve the above problem, we define the following Lagrangian function to be minimized
|
||||
!bt
|
||||
\[
|
||||
@@ -634,11 +634,11 @@ y_i(\bm{w}^T\bm{x}_i+b) -(1-\xi_) \geq 0 \hspace{0.1cm}\forall i.
|
||||
!split
|
||||
===== Kernels and non-linearity =====
|
||||
|
||||
The cases we have studied till were all characterized by two classes
|
||||
The cases we have studied till now, were all characterized by two classes
|
||||
with a close to linear separability. The classifiers we have described
|
||||
so far find linear boundaries in our input feature space. It is
|
||||
possible to make our procedure more flexible by exploring the feature
|
||||
space using other basis expansions such higher-order polynomials,
|
||||
space using other basis expansions such as higher-order polynomials,
|
||||
wavelets, splines etc.
|
||||
|
||||
If our feature space is not easy to separate, as shown in the figure
|
||||
@@ -724,7 +724,7 @@ y_i(\bm{w}^T\bm{z}_i+b)= 1 \hspace{0.1cm}\forall i,
|
||||
\]
|
||||
!et
|
||||
from which we also find $b$.
|
||||
To compute $\bm{z}_i^T\bm{z}_j$ we define the kerne $K(\bm{x}_i,\bm{x}_j)$ as
|
||||
To compute $\bm{z}_i^T\bm{z}_j$ we define the kernel $K(\bm{x}_i,\bm{x}_j)$ as
|
||||
!bt
|
||||
\[
|
||||
K(\bm{x}_i,\bm{x}_j)=\bm{z}_i^T\bm{z}_j= \phi(\bm{x}_i)^T\phi(\bm{x}_j).
|
||||
@@ -746,7 +746,7 @@ the dot product $(\bm{x}_i^T\bm{x}_j)^2$.
|
||||
This leads to the so-called
|
||||
kernel trick and the result leads to the same as if we went through
|
||||
the trouble of performing the transformation
|
||||
$(\phi(\bm{x}_i)^T\phi(\bm{x}_j)$ during the SVM calculations.
|
||||
$\phi(\bm{x}_i)^T\phi(\bm{x}_j)$ during the SVM calculations.
|
||||
|
||||
|
||||
!split
|
||||
|
||||
Reference in New Issue
Block a user