http://genie.sis.pitt.edu/wiki/Applicat ... _a_Network
http://genie.sis.pitt.edu/wiki/Referenc ... SL_network (scroll down to SetDefaultBNAlgorithm)
However, I can't find all the papers online.
Here are URLs that I have found (Numbers correspond to the list of articles above):
1) http://staff.aub.edu.lb/~darwiche/Papers/ijar95.pdf (about the lauritzen junction-tree-algo)
second url: http://reasoning.cs.ucla.edu/fetch.php?id=32&type=pdf
2) Not found ("Propagating Uncertainty...") (about the henrion algo)
3) http://www.ece.tamu.edu/~bjyoon/ecen689 ... l_1986.pdf (about the pearl algo)
4) http://uai.sis.pitt.edu/papers/89/p112-fung.pdf (about sampling)
5) Not found ("Simulation Approaches...") (about sampling)
6) http://uai.sis.pitt.edu/papers/94/p227-fung.pdf (about backward simulation)
7) Not found, but a paper with similar title that's mentioned in the reference manual table: http://bmir.stanford.edu/file_asset/ind ... 8-0209.pdf (about influence diagrams)
8.) http://www.stanford.edu/dept/MSandE/cgi ... bdecns.pdf (about influence diagrams)
9) http://www.jair.org/media/764/live-764-1924-jair.pdf (about AIS sampling)
10) http://www.cse.msstate.edu/~url/publica ... pis_bn.pdf (about EPIS sampling)
If someone finds URLs to the missing papers please feel free to post an answer here
Also, I'd like to know in which paper the LBP algorithm was described (it's not given in these two documentation lists).
There are also several algorithms available in the C++ API that are not mentioned in the documentation at all. Where can I find out more about these? It's the "heuristic importance", "relevancedecomp" and "HBN" algorithms...
And a last question, there are papers mentioned in the list that are not mentioned in the table. So what SMILE algorithms are they about? It's the papers 4 and 7...
I'd be very glad if the DSL could update and clarify this documentation material, since problems like these are confusing to newcomers like me. Also it would be nice if they could provide the URLs directly, instead of letting people search them themselves... so I hope this post and your answers will help people find their way to the papers more quickly.