mirror of
https://github.com/davisking/dlib.git
synced 2024-11-01 10:14:53 +08:00
updated the docs
--HG-- extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%402253
This commit is contained in:
parent
dbff99837c
commit
2ae506deac
@ -56,7 +56,7 @@
|
||||
<item>decision_function</item>
|
||||
<item>probabilistic_decision_function</item>
|
||||
<item>krls</item>
|
||||
<item>one_class</item>
|
||||
<item>kcentroid</item>
|
||||
</sub>
|
||||
</item>
|
||||
</section>
|
||||
@ -682,12 +682,12 @@
|
||||
<!-- ************************************************************************* -->
|
||||
|
||||
<component>
|
||||
<name>one_class</name>
|
||||
<name>kcentroid</name>
|
||||
<file>dlib/svm.h</file>
|
||||
<spec_file link="true">dlib/svm/one_class_abstract.h</spec_file>
|
||||
<spec_file link="true">dlib/svm/kcentroid_abstract.h</spec_file>
|
||||
<description>
|
||||
This is an implementation of an online algorithm for recursively estimating the
|
||||
center of mass of a sequence of training points. It uses the sparsification technique
|
||||
centroid of a sequence of training points. It uses the sparsification technique
|
||||
described in the paper The Kernel Recursive Least Squares Algorithm by Yaakov Engel.
|
||||
|
||||
<p>
|
||||
|
@ -375,7 +375,7 @@
|
||||
<term link="algorithms.html#vector" name="vector"/>
|
||||
<term link="algorithms.html#point" name="point"/>
|
||||
<term link="algorithms.html#krls" name="krls"/>
|
||||
<term link="algorithms.html#one_class" name="one_class"/>
|
||||
<term link="algorithms.html#kcentroid" name="kcentroid"/>
|
||||
|
||||
<term link="dlib/svm/svm_abstract.h.html#maximum_nu" name="maximum_nu"/>
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user