1 |
J. Suzuki, "Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: Basic Properties," IEICE Transactions on Fundamentals, Vol. E82-A, No. 9, pp. 1-9, 1999
|
2 |
R. Etxeberria, P. Larranaga and J. M. Picaza, "Analysis of the Behaviour of Genetic Algorithms when Learning Bayesian Network Structure from Data," Pattern Recognition Letters, Vol. 18, pp. 1269-1273, 1997
DOI
ScienceOn
|
3 |
N. Friedman, I. Nachman and D. Peer, "Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm," Proceedings of the Fifteenth Conference on Unceratainty in Artificial Intelligence, pp. 206-215, 1999
|
4 |
R. E. Neapolitan, Learning Bayesian Networks, Pearson Prentice Hall, New Jersey, 2004
|
5 |
K. Hwang, J. Lee, S. Chung and B. Zhang, "Construction of Large-Scale Bayesian Networks by Local to Global Search," PRICAI 2002, pp. 375-384, 2002
|
6 |
P. Grunwald, "A Tutorial Introduction to the Minimum Description Length Principle," Advances in Minimum Description Length: Theory and Applications, MIT Press, 2004
|
7 |
L. E. Brown, I. Tsamardinos and C. F. Aliferis, "A Novel Algorithm for Scalable and Accurate Bayesian Network Learning," MEDINFO, 2004
|
8 |
S. Jung, K. Lee and D. Lee, "Enabling Large-Scale Bayesian Network Learning by Preserving Intercluster Directionality," IEICE Transactions on Information and Systems, Vol. E90-D, No. 7, 2007, to appear
|
9 |
D. Heckerman, D. Gerger and D. M. Chickering, "Learning Bayesian Networks: The Combination of Knowledge and Statistical Data," Machine Learning, Vol. 20, pp. 197-243, 1995
|
10 |
R. W. Robinson, "Counting Labeled Acyclic Digraphs," New Directions in the Theory of Graphs, pp. 239-273, Academic Press, New York, 1973
|