Skip to content

GitLab

Commit 937f61b8 authored by Davis King's avatar Davis King
Browse files

Reorganized the stuff on the algorithms page. I pulled the machine learning 

and bayesian networking stuff out and gave them their own pages.

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%402933
parent 0955ec45
Expand all Hide whitespace changes
Inline Side-by-side
Showing with 1309 additions and 1148 deletions
docs/docs/algorithms.xml
View file @ 937f61b8
This diff is collapsed.
docs/docs/bayes.xml 0 → 100644
View file @ 937f61b8
<?xml version="1.0" encoding="ISO-8859-1"?>
<?xml-stylesheet type="text/xsl" href="stylesheet.xsl"?>
<doc>
<title>Bayesian Networks</title>
<!-- ************************************************************************* -->
<body>
<br/><br/>
<p>
This page documents all the tools within the dlib library that relate
to the construction and evaluation of Bayesian networks. If you want
a quick introduction to the tools then you should consult the
Bayesian Net <a href="bayes_net_ex.cpp.html">example program</a>.
</p>
<p>
The
library also comes with a graphical application to assist in the
creation of bayesian networks. This application is one of the example
programs, so to use it you have to compile it yourself or download
one of the binaries from the sourceforge download page.
</p>
</body>
<!-- ************************************************************************* -->
<menu width="150">
<top>
<section>
<name>Tools</name>
<item>assignment</item>
<item>joint_probability_table</item>
<item>conditional_probability_table</item>
<item>bayes_node</item>
<item>bayesian_network_gibbs_sampler</item>
<item>bayesian_network_join_tree</item>
</section>
<section>
<name>Node Utilities</name>
<item>set_node_value</item>
<item>node_value</item>
<item>node_is_evidence</item>
<item>set_node_as_evidence</item>
<item>set_node_as_nonevidence</item>
<item>set_node_num_values</item>
<item>node_num_values</item>
<item>node_probability</item>
<item>set_node_probability</item>
<item>node_first_parent_assignment</item>
<item>node_next_parent_assignment</item>
<item>node_cpt_filled_out</item>
</section>
</top>
</menu>
<!-- ************************************************************************* -->
<!-- ************************************************************************* -->
<!-- ************************************************************************* -->
<components>
<!-- ************************************************************************* -->
<component>
<name>bayesian_network_join_tree</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This object represents an implementation of the join tree algorithm
(a.k.a. the junction tree algorithm)
for inference in bayesian networks.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
<example>bayes_net_gui_ex.cpp.html</example>
<example>bayes_net_from_disk_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>bayesian_network_gibbs_sampler</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This object performs Markov Chain Monte Carlo sampling of a bayesian
network using the Gibbs sampling technique.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>bayes_node</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This object represents a node in a bayesian network. It is
intended to be used inside the <a href="containers.html#directed_graph">directed_graph</a> object to
represent bayesian networks.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
<example>bayes_net_gui_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>conditional_probability_table</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This object represents a conditional probability table.
</description>
</component>
<!-- ************************************************************************* -->
<component>
<name>joint_probability_table</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This object represents a joint probability table.
</description>
</component>
<!-- ************************************************************************* -->
<component>
<name>assignment</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This object models an assignment of random variables to particular values.
It is used with the <a href="#joint_probability_table">joint_probability_table</a> and
<a href="#conditional_probability_table">conditional_probability_table</a>
objects to represent assignments of various random variables to actual values.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
<example>bayes_net_gui_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>set_node_probability</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily set the probability of a
<a href="#bayes_node">bayes_node</a> given its parents when it is inside
a <a href="containers.html#directed_graph">directed_graph</a> object.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>node_first_parent_assignment</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily obtain an <a href="#assignment">assignment</a>
that contains all the parents of a node in a bayesian network.
</description>
<examples>
<example>bayes_net_gui_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>node_next_parent_assignment</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily loop through all the parent <a href="#assignment">assignments</a>
of a node in a bayesian network.
</description>
<examples>
<example>bayes_net_gui_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>node_cpt_filled_out</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily verify that a node
in a bayesian network has its <a href="#conditional_probability_table">conditional_probability_table</a>
completely filled out.
</description>
<examples>
<example>bayes_net_gui_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>node_probability</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily obtain the probability of a
<a href="#bayes_node">bayes_node</a> given its parents when it is inside
a <a href="containers.html#directed_graph">directed_graph</a> object.
</description>
</component>
<!-- ************************************************************************* -->
<component>
<name>node_num_values</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily obtain the number of values of a
<a href="#bayes_node">bayes_node</a> when it is inside
a <a href="containers.html#directed_graph">directed_graph</a> object.
</description>
</component>
<!-- ************************************************************************* -->
<component>
<name>set_node_num_values</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily set the number of values of a
<a href="#bayes_node">bayes_node</a> when it is inside
a <a href="containers.html#directed_graph">directed_graph</a> object.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>set_node_as_nonevidence</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily remove the evidence flag of a
<a href="#bayes_node">bayes_node</a> when it is inside
a <a href="containers.html#directed_graph">directed_graph</a> object.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>set_node_as_evidence</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily set the evidence flag of a
<a href="#bayes_node">bayes_node</a> when it is inside
a <a href="containers.html#directed_graph">directed_graph</a> object.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
<component>
<name>node_is_evidence</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily determine if a
<a href="#bayes_node">bayes_node</a> is evidence when it is inside
a <a href="containers.html#directed_graph"> directed_graph</a> object.
</description>
</component>
<!-- ************************************************************************* -->
<component>
<name>node_value</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily obtain the value of a
<a href="#bayes_node">bayes_node</a> when it is inside a <a href="containers.html#directed_graph">
directed_graph</a> object.
</description>
</component>
<!-- ************************************************************************* -->
<component>
<name>set_node_value</name>
<file>dlib/bayes_utils.h</file>
<spec_file link="true">dlib/bayes_utils/bayes_utils_abstract.h</spec_file>
<description>
This is a function declared in the dlib::bayes_node_utils namespace. It
is a convenience function that allows you to easily modify the value of a
<a href="#bayes_node">bayes_node</a> when it is inside a <a href="containers.html#directed_graph">
directed_graph</a> object.
</description>
<examples>
<example>bayes_net_ex.cpp.html</example>
</examples>
</component>
<!-- ************************************************************************* -->
</components>
<!-- ************************************************************************* -->
</doc>
docs/docs/containers.xml
View file @ 937f61b8
...@@ -26,7 +26,9 @@ ...@@ -26,7 +26,9 @@
short section about the component you would like to use. Then pick which implementation you short section about the component you would like to use. Then pick which implementation you
would like and typedef it to something nice. Here is an example of creating a typedef for would like and typedef it to something nice. Here is an example of creating a typedef for
a set of integers using the first kernel implementation. <br/> a set of integers using the first kernel implementation. <br/>
<tt>typedef dlib::set&lt;int&gt;::kernel_1a set_of_ints;</tt> <tt>typedef dlib::set&lt;int&gt;::kernel_1a set_of_ints;</tt>. Or as another example,
if you wanted to make an expandable array of ints you might say <br/>
<tt>typedef dlib::array&lt;int&gt;::expand_1d_c array_of_ints;</tt>.
</p> </p>
......
docs/docs/index.xml
View file @ 937f61b8
...@@ -117,18 +117,22 @@ ...@@ -117,18 +117,22 @@
<li><b>Machine Learning Algorithms</b> <li><b>Machine Learning Algorithms</b>
<ul> <ul>
<li><a href="algorithms.html#mlp">Multi layer perceptrons</a> </li> <li><a href="ml.html#mlp">Multi layer perceptrons</a> </li>
<li><a href="algorithms.html#svm_nu_trainer">Support vector machines</a> for classification</li> <li><a href="ml.html#svm_nu_trainer">Support vector machines</a> for classification</li>
<li>Relevance vector machines for <a href="algorithms.html#rvm_trainer">classification</a> <li>Relevance vector machines for <a href="ml.html#rvm_trainer">classification</a>
and <a href="algorithms.html#rvm_regression_trainer">regression</a> </li> and <a href="ml.html#rvm_regression_trainer">regression</a> </li>
<li>An online <a href="algorithms.html#krls">kernel RLS regression</a> algorithm</li> <li>An online <a href="ml.html#krls">kernel RLS regression</a> algorithm</li>
<li>An online <a href="algorithms.html#svm_pegasos">SVM classification</a> algorithm</li> <li>An online <a href="ml.html#svm_pegasos">SVM classification</a> algorithm</li>
<li>An online kernelized <a href="algorithms.html#kcentroid">centroid estimator</a>/novelty detector</li> <li>An online kernelized <a href="ml.html#kcentroid">centroid estimator</a>/novelty detector</li>
<li>A kernelized <a href="algorithms.html#kkmeans">k-means</a> clustering algorithm</li> <li>A kernelized <a href="ml.html#kkmeans">k-means</a> clustering algorithm</li>
<li><a href="algorithms.html#rbf_network_trainer">Radial Basis Function Networks</a></li> <li><a href="ml.html#rbf_network_trainer">Radial Basis Function Networks</a></li>
<li>Bayesian network inference algorithms such as the </ul>
<a href="algorithms.html#bayesian_network_join_tree">join tree</a> algorithm and </li>
<a href="algorithms.html#bayesian_network_gibbs_sampler">gibbs sampler</a> markov chain monte carlo algorithm</li>
<li><b>Bayesian Network Inference Algorithms</b>
<ul>
<li><a href="bayes.html#bayesian_network_join_tree">join tree</a> algorithm for exact inference</li>
<li><a href="bayes.html#bayesian_network_gibbs_sampler">gibbs sampler</a> markov chain monte carlo algorithm</li>
</ul> </ul>
</li> </li>
......
docs/docs/main_menu.xml
View file @ 937f61b8
...@@ -10,6 +10,16 @@ ...@@ -10,6 +10,16 @@
<link>algorithms.html</link> <link>algorithms.html</link>
<chm_sub>algorithms.xml</chm_sub> <chm_sub>algorithms.xml</chm_sub>
</item> </item>
<item>
<name>Machine Learning</name>
<link>ml.html</link>
<chm_sub>ml.xml</chm_sub>
</item>
<item>
<name>Bayesian Nets</name>
<link>bayes.html</link>
<chm_sub>bayes.xml</chm_sub>
</item>
<item> <item>
<name>Containers</name> <name>Containers</name>
<link>containers.html</link> <link>containers.html</link>
......
docs/docs/ml.xml 0 → 100644
View file @ 937f61b8
This diff is collapsed.
docs/docs/parsing.xml
View file @ 937f61b8
...@@ -57,6 +57,7 @@ ...@@ -57,6 +57,7 @@
<item>toupper</item> <item>toupper</item>
<item>convert_utf8_to_utf32</item> <item>convert_utf8_to_utf32</item>
<item>is_combining_char</item> <item>is_combining_char</item>
<item>strings_equal_ignore_case</item>
</section> </section>
</top> </top>
</menu> </menu>
...@@ -216,6 +217,18 @@ ...@@ -216,6 +217,18 @@
</component> </component>
<!-- ************************************************************************* -->
<component>
<name>strings_equal_ignore_case</name>
<file>dlib/string.h</file>
<spec_file link="true">dlib/string/string_abstract.h</spec_file>
<description>
This is a pair of functions to do a case insensitive comparison between strings.
</description>
</component>
<!-- ************************************************************************* --> <!-- ************************************************************************* -->
<component> <component>
......
docs/docs/term_index.xml
View file @ 937f61b8
...@@ -355,27 +355,26 @@ ...@@ -355,27 +355,26 @@
<term link="algorithms.html#find_min_quasi_newton2" name="find_min_quasi_newton2"/> <term link="algorithms.html#find_min_quasi_newton2" name="find_min_quasi_newton2"/>
<term link="algorithms.html#find_min_conjugate_gradient2" name="find_min_conjugate_gradient2"/> <term link="algorithms.html#find_min_conjugate_gradient2" name="find_min_conjugate_gradient2"/>
<term link="bayes.html#set_node_value" name="set_node_value"/>
<term link="bayes.html#node_value" name="node_value"/>
<term link="bayes.html#node_is_evidence" name="node_is_evidence"/>
<term link="bayes.html#set_node_as_evidence" name="set_node_as_evidence"/>
<term link="bayes.html#set_node_as_nonevidence" name="set_node_as_nonevidence"/>
<term link="bayes.html#set_node_num_values" name="set_node_num_values"/>
<term link="bayes.html#node_num_values" name="node_num_values"/>
<term link="bayes.html#node_probability" name="node_probability"/>
<term link="bayes.html#set_node_probability" name="set_node_probability"/>
<term link="bayes.html#assignment" name="assignment"/>
<term link="bayes.html#joint_probability_table" name="joint_probability_table"/>
<term link="bayes.html#conditional_probability_table" name="conditional_probability_table"/>
<term link="bayes.html#bayes_node" name="bayes_node"/>
<term link="bayes.html#bayesian_network_gibbs_sampler" name="bayesian_network_gibbs_sampler"/>
<term link="bayes.html#bayesian_network_join_tree" name="bayesian_network_join_tree"/>
<term link="bayes.html#node_first_parent_assignment" name="node_first_parent_assignment"/>
<term link="bayes.html#node_next_parent_assignment" name="node_next_parent_assignment"/>
<term link="bayes.html#node_cpt_filled_out" name="node_cpt_filled_out"/>
<term link="algorithms.html#rectangle" name="rectangle"/> <term link="algorithms.html#rectangle" name="rectangle"/>
<term link="algorithms.html#set_node_value" name="set_node_value"/>
<term link="algorithms.html#node_value" name="node_value"/>
<term link="algorithms.html#node_is_evidence" name="node_is_evidence"/>
<term link="algorithms.html#set_node_as_evidence" name="set_node_as_evidence"/>
<term link="algorithms.html#set_node_as_nonevidence" name="set_node_as_nonevidence"/>
<term link="algorithms.html#set_node_num_values" name="set_node_num_values"/>
<term link="algorithms.html#node_num_values" name="node_num_values"/>
<term link="algorithms.html#node_probability" name="node_probability"/>
<term link="algorithms.html#set_node_probability" name="set_node_probability"/>
<term link="algorithms.html#assignment" name="assignment"/>
<term link="algorithms.html#joint_probability_table" name="joint_probability_table"/>
<term link="algorithms.html#conditional_probability_table" name="conditional_probability_table"/>
<term link="algorithms.html#bayes_node" name="bayes_node"/>
<term link="algorithms.html#bayesian_network_gibbs_sampler" name="bayesian_network_gibbs_sampler"/>
<term link="algorithms.html#bayesian_network_join_tree" name="bayesian_network_join_tree"/>
<term link="algorithms.html#node_first_parent_assignment" name="node_first_parent_assignment"/>
<term link="algorithms.html#node_next_parent_assignment" name="node_next_parent_assignment"/>
<term link="algorithms.html#node_cpt_filled_out" name="node_cpt_filled_out"/>
<term link="algorithms.html#edge" name="edge"/> <term link="algorithms.html#edge" name="edge"/>
<term link="algorithms.html#is_join_tree" name="is_join_tree"/> <term link="algorithms.html#is_join_tree" name="is_join_tree"/>
...@@ -391,9 +390,6 @@ ...@@ -391,9 +390,6 @@
<term link="algorithms.html#isort_array" name="isort_array"/> <term link="algorithms.html#isort_array" name="isort_array"/>
<term link="algorithms.html#md5" name="md5"/> <term link="algorithms.html#md5" name="md5"/>
<term link="algorithms.html#median" name="median"/> <term link="algorithms.html#median" name="median"/>
<term link="algorithms.html#mlp" name="mlp"/>
<term link="algorithms.html#mlp" name="multi-layer perceptron"/>
<term link="algorithms.html#mlp" name="neural network"/>
<term link="algorithms.html#qsort_array" name="qsort_array"/> <term link="algorithms.html#qsort_array" name="qsort_array"/>
<term link="algorithms.html#rand" name="rand"/> <term link="algorithms.html#rand" name="rand"/>
<term link="algorithms.html#rand" name="Mersenne Twister"/> <term link="algorithms.html#rand" name="Mersenne Twister"/>
...@@ -408,53 +404,55 @@ ...@@ -408,53 +404,55 @@
<term link="algorithms.html#graph_is_connected" name="graph_is_connected"/> <term link="algorithms.html#graph_is_connected" name="graph_is_connected"/>
<term link="algorithms.html#is_clique" name="is_clique"/> <term link="algorithms.html#is_clique" name="is_clique"/>
<term link="algorithms.html#is_maximal_clique" name="is_maximal_clique"/> <term link="algorithms.html#is_maximal_clique" name="is_maximal_clique"/>
<term link="algorithms.html#svm_pegasos" name="svm_pegasos"/>
<term link="algorithms.html#batch" name="batch"/>
<term link="algorithms.html#verbose_batch" name="verbose_batch"/>
<term link="algorithms.html#batch_trainer" name="batch_trainer"/>
<term link="algorithms.html#randomize_samples" name="randomize_samples"/>
<term link="algorithms.html#is_binary_classification_problem" name="is_binary_classification_problem"/>
<term link="algorithms.html#square_root" name="square_root"/> <term link="algorithms.html#square_root" name="square_root"/>
<term link="algorithms.html#svm_nu_trainer" name="svm_nu_trainer"/>
<term link="algorithms.html#rvm_trainer" name="rvm_trainer"/>
<term link="algorithms.html#rvm_regression_trainer" name="rvm_regression_trainer"/>
<term link="algorithms.html#rbf_network_trainer" name="rbf_network_trainer"/>
<term link="algorithms.html#reduced" name="reduced"/>
<term link="algorithms.html#reduced_decision_function_trainer" name="reduced_decision_function_trainer"/>
<term link="algorithms.html#reduced2" name="reduced2"/>
<term link="algorithms.html#reduced_decision_function_trainer2" name="reduced_decision_function_trainer2"/>
<term link="algorithms.html#train_probabilistic_decision_function" name="train_probabilistic_decision_function"/>
<term link="algorithms.html#cross_validate_trainer" name="cross_validate_trainer"/>
<term link="algorithms.html#cross_validate_trainer_threaded" name="cross_validate_trainer_threaded"/>
<term link="algorithms.html#test_binary_decision_function" name="test_binary_decision_function"/>
<term link="algorithms.html#svm_nu_trainer" name="support vector machine"/>
<term link="algorithms.html#rvm_trainer" name="relevance vector machine"/>
<term link="algorithms.html#vector" name="vector"/> <term link="algorithms.html#vector" name="vector"/>
<term link="algorithms.html#point" name="point"/> <term link="algorithms.html#point" name="point"/>
<term link="algorithms.html#krls" name="krls"/>
<term link="algorithms.html#kcentroid" name="kcentroid"/>
<term link="algorithms.html#linearly_independent_subset_finder" name="linearly_independent_subset_finder"/>
<term link="algorithms.html#running_stats" name="running_stats"/> <term link="algorithms.html#running_stats" name="running_stats"/>
<term link="algorithms.html#vector_normalizer" name="vector_normalizer"/>
<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="ml.html#mlp" name="mlp"/>
<term link="ml.html#mlp" name="multi-layer perceptron"/>
<term link="ml.html#mlp" name="neural network"/>
<term link="ml.html#svm_pegasos" name="svm_pegasos"/>
<term link="ml.html#batch" name="batch"/>
<term link="ml.html#verbose_batch" name="verbose_batch"/>
<term link="ml.html#batch_trainer" name="batch_trainer"/>
<term link="ml.html#randomize_samples" name="randomize_samples"/>
<term link="ml.html#is_binary_classification_problem" name="is_binary_classification_problem"/>
<term link="ml.html#svm_nu_trainer" name="svm_nu_trainer"/>
<term link="ml.html#rvm_trainer" name="rvm_trainer"/>
<term link="ml.html#rvm_regression_trainer" name="rvm_regression_trainer"/>
<term link="ml.html#rbf_network_trainer" name="rbf_network_trainer"/>
<term link="ml.html#reduced" name="reduced"/>
<term link="ml.html#reduced_decision_function_trainer" name="reduced_decision_function_trainer"/>
<term link="ml.html#reduced2" name="reduced2"/>
<term link="ml.html#reduced_decision_function_trainer2" name="reduced_decision_function_trainer2"/>
<term link="ml.html#train_probabilistic_decision_function" name="train_probabilistic_decision_function"/>
<term link="ml.html#cross_validate_trainer" name="cross_validate_trainer"/>
<term link="ml.html#cross_validate_trainer_threaded" name="cross_validate_trainer_threaded"/>
<term link="ml.html#test_binary_decision_function" name="test_binary_decision_function"/>
<term link="ml.html#svm_nu_trainer" name="support vector machine"/>
<term link="ml.html#rvm_trainer" name="relevance vector machine"/>
<term link="ml.html#krls" name="krls"/>
<term link="ml.html#kcentroid" name="kcentroid"/>
<term link="ml.html#linearly_independent_subset_finder" name="linearly_independent_subset_finder"/>
<term link="ml.html#vector_normalizer" name="vector_normalizer"/>
<term link="ml.html#kkmeans" name="kkmeans"/>
<term link="ml.html#pick_initial_centers" name="pick_initial_centers"/>
<term link="ml.html#rank_features" name="rank_features"/>
<term link="dlib/svm/svm_abstract.h.html#maximum_nu" name="maximum_nu"/> <term link="dlib/svm/svm_abstract.h.html#maximum_nu" name="maximum_nu"/>
<term link="algorithms.html#decision_function" name="decision_function"/> <term link="ml.html#decision_function" name="decision_function"/>
<term link="algorithms.html#normalized_function" name="normalized_function"/> <term link="ml.html#normalized_function" name="normalized_function"/>
<term link="algorithms.html#distance_function" name="distance_function"/> <term link="ml.html#distance_function" name="distance_function"/>
<term link="algorithms.html#probabilistic_decision_function" name="probabilistic_decision_function"/> <term link="ml.html#probabilistic_decision_function" name="probabilistic_decision_function"/>
<term link="algorithms.html#linear_kernel" name="linear_kernel"/> <term link="ml.html#linear_kernel" name="linear_kernel"/>
<term link="algorithms.html#offset_kernel" name="offset_kernel"/> <term link="ml.html#offset_kernel" name="offset_kernel"/>
<term link="algorithms.html#polynomial_kernel" name="polynomial_kernel"/> <term link="ml.html#polynomial_kernel" name="polynomial_kernel"/>
<term link="algorithms.html#sigmoid_kernel" name="sigmoid_kernel"/> <term link="ml.html#sigmoid_kernel" name="sigmoid_kernel"/>
<term link="algorithms.html#radial_basis_kernel" name="radial_basis_kernel"/> <term link="ml.html#radial_basis_kernel" name="radial_basis_kernel"/>
<term link="dlib/svm/kernel_abstract.h.html#Kernel_Function_Objects" name="Kernel Function Objects"/> <term link="dlib/svm/kernel_abstract.h.html#Kernel_Function_Objects" name="Kernel Function Objects"/>
<term link="dlib/svm/kernel_abstract.h.html#kernel_derivative" name="kernel_derivative"/> <term link="dlib/svm/kernel_abstract.h.html#kernel_derivative" name="kernel_derivative"/>
...@@ -761,6 +759,7 @@ ...@@ -761,6 +759,7 @@
<term link="parsing.html#ustring" name="ustring"/> <term link="parsing.html#ustring" name="ustring"/>
<term link="parsing.html#convert_utf8_to_utf32" name="convert_utf8_to_utf32"/> <term link="parsing.html#convert_utf8_to_utf32" name="convert_utf8_to_utf32"/>
<term link="parsing.html#is_combining_char" name="is_combining_char"/> <term link="parsing.html#is_combining_char" name="is_combining_char"/>
<term link="parsing.html#strings_equal_ignore_case" name="strings_equal_ignore_case"/>
<term link="dlib/unicode/unicode_abstract.h.html#invalid_utf8_error" name="invalid_utf8_error"/> <term link="dlib/unicode/unicode_abstract.h.html#invalid_utf8_error" name="invalid_utf8_error"/>
......
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