About-BAMT-algorithms.md

@@ -5,4 +5,16 @@ Web-BAMT is a web service that allows you to train Bayesian networks on demonstr
 A Bayesian network is a pair of directed acyclic graph (DAG) describing the dependencies of characteristics and some factorization of the joint distribution of characteristics in the product of conditional, generated by these dependencies. 
 The task of training a Bayesian network is thus split into two subtasks:
 * Finding the structure of the Bayesian network.
-* Parametric training of the Bayesian network or, in other words, selection of marginal and conditional distributions that describe the conditional ones accurately enough.
+* Parametric training of the Bayesian network or, in other words, selection of marginal and conditional distributions that describe the conditional ones accurately enough.
\ No newline at end of file
+
+# Structural learning algorithms for a Bayesian network
+Often the task of constructing a network is reduced to optimization. In the DAG space, score functions are introduced that evaluate how well the graph describes the dependencies between features. Web BAMT uses the Hill-Climbing algorithm to search in this space.
+Steps of Hill-Climbing algorithm:
+1. Initialized by a graph without edges;
+2. For each pair of nodes, an edge is added, removed or the direction is changed; 
+3. The score-function value is counted after the selected action on the pair; 
+4. If the value of score-function is better than that of the previous iteration, the result is memorized;
+5. Stops when the value changes less than the threshold value.
+
+The following score functions from [BAMT package](https://github.com/ITMO-NSS-team/BAMT) are included in Web BAMT: K2, BIC (Bayesian Information Criterion), MI (Mutual Information).
+The above approach to structure search allows to introduce elements of expert control by narrowing the search area to structures that include expert-specified edges or fixed root nodes describing key and basic features.
\ No newline at end of file