4 ms·
I believe it's (1) and I think it might originate in Judea Pearl's textbook on causality [1], particularly the section on the IC algorithm. I've also encountere
by YeGoblynQueenne 10y ago
I believe it's (1) and I think it might originate in Judea Pearl's textbook on causality [1], particularly the section on the IC algorithm. I've also encountered it in a bunch of papers on graph reconstruction, by Wermuth, Lauritzen, Spirtes and Glymour (not all in one go, I don't think). For instance, see [2].
I guess it's convenient notation for a typical step in those algorithms, where two edges are oriented towards a common vertex- shown as A -> B <- C or similar. That's a little more concise than {(A,B),(C,B)} but also more intuitive when the intention is to show how to (re)construct a graph from dependence relations, as those algorithms usually do.
___________________
[1] Causality; models, reasoning and inference:
http://bayes.cs.ucla.edu/BOOK-2K/ http://bayes.cs.ucla.edu/BOOK-2K/
[2] A Fast Algorithm for Discovering Sparse Causal Graphs; Peter Spirtes & Clark Glymour:
http://repository.cmu.edu/cgi/viewcontent.cgi?article=1316&context=philosophy http://repository.cmu.edu/cgi/viewcontent.cgi?article=1316&c...