Daniel@0: function [pdag, G] = learn_struct_pdag_pc(cond_indep, n, k, varargin)
Daniel@0: % LEARN_STRUCT_PDAG_PC Learn a partially oriented DAG (pattern) using the PC algorithm
Daniel@0: % P = learn_struct_pdag_pc(cond_indep, n, k, ...)
Daniel@0: %
Daniel@0: % n is the number of nodes.
Daniel@0: % k is an optional upper bound on the fan-in (default: n)
Daniel@0: % cond_indep is a boolean function that will be called as follows:
Daniel@0: %   feval(cond_indep, x, y, S, ...)
Daniel@0: % where x and y are nodes, and S is a set of nodes (positive integers),
Daniel@0: % and ... are any optional parameters passed to this function.
Daniel@0: %
Daniel@0: % The output P is an adjacency matrix, in which
Daniel@0: % P(i,j) = -1 if there is an i->j edge.
Daniel@0: % P(i,j) = P(j,i) = 1 if there is an undirected edge i <-> j
Daniel@0: %
Daniel@0: % The PC algorithm does structure learning assuming all variables are observed.
Daniel@0: % See Spirtes, Glymour and Scheines, "Causation, Prediction and Search", 1993, p117.
Daniel@0: % This algorithm may take O(n^k) time if there are n variables and k is the max fan-in,
Daniel@0: % but this is quicker than the Verma-Pearl IC algorithm, which is always O(n^n).
Daniel@0: 
Daniel@0:   
Daniel@0: sep = cell(n,n);
Daniel@0: ord = 0;
Daniel@0: done = 0;
Daniel@0: G = ones(n,n);
Daniel@0: G=setdiag(G,0);
Daniel@0: while ~done
Daniel@0:   done = 1;
Daniel@0:   [X,Y] = find(G); 
Daniel@0:   for i=1:length(X)
Daniel@0:     x = X(i); y = Y(i);
Daniel@0:     %nbrs = mysetdiff(myunion(neighbors(G, x), neighbors(G,y)), [x y]);
Daniel@0:     nbrs = mysetdiff(neighbors(G, y), x);  % bug fix by Raanan Yehezkel <raanany@ee.bgu.ac.il> 6/27/04
Daniel@0:     if length(nbrs) >= ord & G(x,y) ~= 0
Daniel@0:       done = 0;
Daniel@0:       %SS = subsets(nbrs, ord, ord); % all subsets of size ord
Daniel@0:       SS = subsets1(nbrs, ord);
Daniel@0:       for si=1:length(SS)
Daniel@0: 	S = SS{si};
Daniel@0: 	if feval(cond_indep, x, y, S, varargin{:})
Daniel@0: 	  %if isempty(S)
Daniel@0:  	  %  fprintf('%d indep of %d ', x, y);
Daniel@0: 	  %else
Daniel@0:  	  %  fprintf('%d indep of %d given ', x, y); fprintf('%d ', S);
Daniel@0:  	  %end
Daniel@0:  	  %fprintf('\n');
Daniel@0: 	  
Daniel@0: 	  % diagnostic
Daniel@0: 	  %[CI, r] = cond_indep_fisher_z(x, y, S, varargin{:});
Daniel@0: 	  %fprintf(': r = %6.4f\n', r);
Daniel@0: 	  
Daniel@0: 	  G(x,y) = 0;
Daniel@0: 	  G(y,x) = 0;
Daniel@0: 	  sep{x,y} = myunion(sep{x,y}, S);
Daniel@0: 	  sep{y,x} = myunion(sep{y,x}, S);
Daniel@0: 	  break; % no need to check any more subsets 
Daniel@0: 	end
Daniel@0:       end
Daniel@0:     end 
Daniel@0:   end
Daniel@0:   ord = ord + 1;
Daniel@0: end
Daniel@0: 
Daniel@0: 
Daniel@0: % Create the minimal pattern,
Daniel@0: % i.e., the only directed edges are V structures.
Daniel@0: pdag = G;
Daniel@0: [X, Y] = find(G);
Daniel@0: % We want to generate all unique triples x,y,z
Daniel@0: % This code generates x,y,z and z,y,x.
Daniel@0: for i=1:length(X)
Daniel@0:   x = X(i);
Daniel@0:   y = Y(i);
Daniel@0:   Z = find(G(y,:));
Daniel@0:   Z = mysetdiff(Z, x);
Daniel@0:   for z=Z(:)'
Daniel@0:     if G(x,z)==0 & ~ismember(y, sep{x,z}) & ~ismember(y, sep{z,x})
Daniel@0:       %fprintf('%d -> %d <- %d\n', x, y, z);
Daniel@0:       pdag(x,y) = -1; pdag(y,x) = 0;
Daniel@0:       pdag(z,y) = -1; pdag(y,z) = 0;
Daniel@0:     end
Daniel@0:   end
Daniel@0: end
Daniel@0: 
Daniel@0: % Convert the minimal pattern to a complete one,
Daniel@0: % i.e., every directed edge in P is compelled
Daniel@0: % (must be directed in all Markov equivalent models),
Daniel@0: % and every undirected edge in P is reversible.
Daniel@0: % We use the rules of Pearl (2000) p51 (derived in Meek (1995))
Daniel@0: 
Daniel@0: old_pdag = zeros(n);
Daniel@0: iter = 0;
Daniel@0: while ~isequal(pdag, old_pdag)
Daniel@0:   iter = iter + 1;
Daniel@0:   old_pdag = pdag;
Daniel@0:   % rule 1
Daniel@0:   [A,B] = find(pdag==-1); % a -> b
Daniel@0:   for i=1:length(A)
Daniel@0:     a = A(i); b = B(i);
Daniel@0:     C = find(pdag(b,:)==1 & G(a,:)==0); % all nodes adj to b but not a
Daniel@0:     if ~isempty(C)
Daniel@0:       pdag(b,C) = -1; pdag(C,b) = 0;
Daniel@0:       %fprintf('rule 1: a=%d->b=%d and b=%d-c=%d implies %d->%d\n', a, b, b, C, b, C);
Daniel@0:     end
Daniel@0:   end
Daniel@0:   % rule 2
Daniel@0:   [A,B] = find(pdag==1); % unoriented a-b edge
Daniel@0:   for i=1:length(A)
Daniel@0:     a = A(i); b = B(i);
Daniel@0:     if any( (pdag(a,:)==-1) & (pdag(:,b)==-1)' );
Daniel@0:       pdag(a,b) = -1; pdag(b,a) = 0;
Daniel@0:       %fprintf('rule 2: %d -> %d\n', a, b);
Daniel@0:     end
Daniel@0:   end
Daniel@0:   % rule 3
Daniel@0:   [A,B] = find(pdag==1); % a-b
Daniel@0:   for i=1:length(A)
Daniel@0:     a = A(i); b = B(i);
Daniel@0:     C = find( (pdag(a,:)==1) & (pdag(:,b)==-1)' );
Daniel@0:     % C contains nodes c s.t. a-c->ba
Daniel@0:     G2 = setdiag(G(C, C), 1);
Daniel@0:     if any(G2(:)==0) % there are 2 different non adjacent elements of C
Daniel@0:       pdag(a,b) = -1; pdag(b,a) = 0;
Daniel@0:       %fprintf('rule 3: %d -> %d\n', a, b);
Daniel@0:     end
Daniel@0:   end
Daniel@0: end
Daniel@0: 
Daniel@0: