[ONR MPP] Thread on BBN sample complexity, tutorials online

Subject:

Comments:
: ONR MPP group and KDD BN Tools subgroup, : : A few months ago, Dr. Lianwen (Nevin) Zhang of the Hong Kong University of Science and Technology (HKUST) posted a query to the UAI mailing list about BBN sample complexity. : : Haipeng had been asking me about BBN sample complexity a few weeks before that, and I had gotten him started reading about computational learning theory (COLT) in Kearns and Vazirani's book: : http://mitpress.mit.edu/book-home.tcl?isbn=0262111934 : http://www.amazon.com/exec/obidos/ASIN/0262111934 : He then went and did a web literature search on BBNs and learning sample complexity that turned up a repository of useful papers. : : Anyway, I thought I'd post the thread following Lianwen Zhang's post, consisting of replies from Russ Greiner (U. of Alberta, CA), Jae-Hyuck Lee (U. of Guelph, CA), and with local followups from Haipeng and me: : : http://www.kddresearch.org/Board/messages/51.html (Greiner) : http://www.kddresearch.org/Board/messages/53.html (Lee) : http://www.kddresearch.org/Board/messages/71.html (Guo) : http://www.kddresearch.org/Board/messages/83.html (Hsu) : : My post briefly reviews a couple of very good BBN inference and learning tutorials that you may all find useful (I suggest looking at Breese and Koller's tutorial first, then Friedman and Goldszmidt's). : : Please feel free to post questions and comments in our web board. : : -Bill : ======================================================= : William H. Hsu, Ph.D. : Assistant Professor of CIS, Kansas State University : Research Scientist, Automated Learning Group, NCSA : bhsu@cis.ksu.edu, bhsu@ncsa.uiuc.edu : http://www.cis.ksu.edu/~bhsu ICQ: 28651394 : =======================================================

Optional Link URL:
Link Title:
Optional Image URL: