diff --git a/docs/pages/doctrees/Introduction.doctree b/docs/pages/doctrees/Introduction.doctree index 32f1983..9d5274e 100644 Binary files a/docs/pages/doctrees/Introduction.doctree and b/docs/pages/doctrees/Introduction.doctree differ diff --git a/docs/pages/doctrees/environment.pickle b/docs/pages/doctrees/environment.pickle index aacd882..e7da0f6 100644 Binary files a/docs/pages/doctrees/environment.pickle and b/docs/pages/doctrees/environment.pickle differ diff --git a/docs/pages/html/Introduction.html b/docs/pages/html/Introduction.html index 53308a6..81348de 100644 --- a/docs/pages/html/Introduction.html +++ b/docs/pages/html/Introduction.html @@ -50,9 +50,6 @@
ExhaustiveSearch (ex)
Hill Climbing (hc)
Chow-liu (cl)
NaiveBayesian (nb)
Tree-augmented Naive Bayes (tan)
With constraint-based structure learning, a DAG can be constructed by identifying independencies in the data set using hypothesis tests, such as chi2 test statistic. diff --git a/docs/pages/html/_sources/Introduction.rst.txt b/docs/pages/html/_sources/Introduction.rst.txt index d6161ae..e1d27db 100644 --- a/docs/pages/html/_sources/Introduction.rst.txt +++ b/docs/pages/html/_sources/Introduction.rst.txt @@ -39,23 +39,6 @@ Score-based algorithm can be used with the following score functions: * a score equivalent Dirichlet posterior density (bdeu); - -Score-based algorithms -^^^^^^^^^^^^^^^^^^^^^^^^^^^ -* ExhaustiveSearch (ex) -* Hill Climbing (hc) - -Local discovery algorithms -^^^^^^^^^^^^^^^^^^^^^^^^^^^ -* Chow-liu (cl) - -Bayesian network classifiers -^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -* NaiveBayesian (nb) -* Tree-augmented Naive Bayes (tan) - - - Constraint-based structure learning algorithms ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ diff --git a/docs/pages/html/index.html b/docs/pages/html/index.html index 4a41c05..4eeb90a 100644 --- a/docs/pages/html/index.html +++ b/docs/pages/html/index.html @@ -232,9 +232,6 @@