Commit a5036437 authored by Davis King's avatar Davis King

updated the docs

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%402373
parent c8bc4464
......@@ -118,6 +118,7 @@
<item>svm_nu_train</item>
<item>svm_nu_train_prob</item>
<item>svm_nu_cross_validate</item>
<item>rank_features</item>
</sub>
</item>
<item>randomize_samples</item>
......@@ -1015,6 +1016,25 @@
</component>
<!-- ************************************************************************* -->
<component>
<name>rank_features</name>
<file>dlib/svm.h</file>
<spec_file link="true">dlib/svm/feature_ranking_abstract.h</spec_file>
<description>
Finds a ranking of the top N (a user supplied parameter) features in a set of data
from a two class classification problem. It
does this by computing the distance between the centroids of both classes in kernel defined
feature space. Good features are then ones that result in the biggest separation between
the two centroids.
</description>
<examples>
<example>rank_features_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
......
......@@ -107,6 +107,10 @@
<name>Image</name>
<link>image_ex.cpp.html</link>
</item>
<item>
<name>Rank_Features</name>
<link>rank_features_ex.cpp.html</link>
</item>
<item>
<name>Support_Vector_Machine</name>
<link>svm_ex.cpp.html</link>
......
......@@ -401,6 +401,7 @@
<term link="algorithms.html#running_stats" name="running_stats"/>
<term link="algorithms.html#kkmeans" name="kkmeans"/>
<term link="algorithms.html#pick_initial_centers" name="pick_initial_centers"/>
<term link="algorithms.html#rank_features" name="rank_features"/>
<term link="dlib/svm/svm_abstract.h.html#maximum_nu" name="maximum_nu"/>
......
......@@ -36,10 +36,6 @@ make htmlify work right on tempalte function calls
mutual information based feature selection
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment