Approximate Counting of Graphical Models Via MCMC Revisited
2013 (English)In: Advances in Artificial Intelligence, Springer Berlin/Heidelberg, 2013, 383-392 p.Conference paper (Refereed)
In , MCMC sampling is applied to approximately calculate the ratio of essential graphs (EGs) to directed acyclic graphs (DAGs) for up to 20 nodes. In the present paper, we extend that work from 20 to 31 nodes. We also extend that work by computing the approximate ratio of connected EGs to connected DAGs, of connected EGs to EGs, and of connected DAGs to DAGs. Furthermore, we prove that the latter ratio is asymptotically 1. We also discuss the implications of these results for learning DAGs from data.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 383-392 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 8109
IdentifiersURN: urn:nbn:se:liu:diva-98068DOI: 10.1007/978-3-642-40643-0_39ISI: 000340401800039ISBN: 978-3-642-40642-3 (print)ISBN: 978-3-642-40643-0 (online)OAI: oai:DiVA.org:liu-98068DiVA: diva2:651934
15th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2013, Madrid, Spain, September 17-20, 2013
Best paper award at the 15th Conference of the Spanish Association for Artificial Intelligence (CAEPIA 2013)2013-09-272013-09-272014-09-12