BNW using Octave instead of Matlab.

This version of BNW should perform the same as the original version. The only difference is that it uses Octave instead of Matlab when running BayesNet Toolbox during parameter learning.

I am calling this BNW_1.02. It can be accessed at:
compbio.uthsc.edu/BNW_1.02

1 files changed, 24 insertions, 0 deletions

diff --git a/sourcecodes/bnt-master/graph/findroot.m b/sourcecodes/bnt-master/graph/findroot.m
new file mode 100644
index 00000000..d242a3a3
--- /dev/null
+++ b/sourcecodes/bnt-master/graph/findroot.m
@@ -0,0 +1,24 @@
+function root = findroot(bnet, cliques)
+
+%% findroot is to find the strong root in a clique tree assume it has one
+%% in the tree. For a clique tree constructed from a strongly triangulated
+%% graph, an interface clique that contains all discrete parents
+%% and at least one continuous node from a connected continuous component
+%% is for sure to be available as a guaranteed strong root.
+%% -By Wei Sun, George Mason University, 4/17/2010.
+
+%% We choose the interface clique that contains the max number 
+%% of interface nodes to be the strong root.
+n0 = 0 ;
+for i=1:length(cliques)
+    % check hybrid cliques
+    hc = intersect(cliques{i}, bnet.cnodes) ; 
+    hd = intersect(cliques{i}, bnet.dnodes) ;
+    if ~isempty(hd) & ~isempty(hc)
+        nd = length(hd) ;
+        if nd > n0
+            root = i ;
+            n0 = nd ;
+        end
+    end    
+end