[1] A Aussem,S R de Morais.A conservative feature subset selection algorithm with missing data[J].Neurocomputing,2010,73(4-6):585-590.[2] 王洪泊,涂序彦.一种面向最经济服务流的可视化动态贝叶斯网络模型.电子学报,2011,39(6):1331-1335.Hongbo WANG,Xuyan TU.A visual dynamic bayesian network model oriented most economical service-flows,Acta Electronica Sinica,2011,39(6):1331-1335.(in Chinese).[3] S R de Morais,A Aussem.A novel Markov boundary based feature subset selection algorithm[J].Neurocomputing, 2010,73(4-6):578-584.[4] J P Pellet,A Elisseef.Using Markov blankets for causal structure learning[J].Journal of Machine Learning Research,2008,9:1295-1342.[5] C Borgelt.A conditional independence algorithm for learning undirected graphical models[J].Journal of Computer and System Sciences,2010,76(1):21-33.[6] Xianchao Xie,Zhi Geng.A recursive method for structural learning of directed acyclic graphs[J].Journal of Machine Learning Research,2008,9:459-483.[7] Xuewen Chen,G.Anantha,Xiaotong Lin.Improving Bayesian network structure learning with mutual information-based node ordering in the K2 algorithm[J].IEEE transactions on knowledge and data engineering,2008,20(5):1-13.[8] L Bouchaala,A Masmoudi,F Gargouri,A Rebai.Improving algorithms for structure learning in Bayesian networks using a new implicit score[J].Expert Systems with Applications,2010,37(7):5470-5475.[9] E Perrier,S Imoto,S Miyano.Finding optimal Bayesian network given a super-structure[J].Journal of Machine Learning Research,2008,9:2251-2286.[10] 冀俊忠,张鸿勋,胡仁兵,刘椿年.一种基于独立性测试和蚁群优化的贝叶斯网学习算法[J].自动化学报,2009,35(3):281-288.Junzhong Ji,Hongxun Zhang,Renbing Hu,Chunnian Liu.A Bayesian network learning algorithm based on independence test and ant colony optimization[J].Acta Automatica Sinica,2009,35(3):281-288.(in Chinese).[11] 贾海洋,陈娟,等.基于混合方式的贝叶斯网弧定向算法[J].电子学报,2009,37(8):1842-1847.Haiyang JIA,Juan CHEN,et al.A Hybrid method for orienting edges of Bayesian network[J].Acta Electronica Sinica,2009,37(8):1842-1847.(in Chinese).[12] I Tsamardinos,L F Brown,C F Aliferis.The max-min hillclimbing BN structure learning algorithm[J].Machine Learning,2006,65(1):31-78.[13] K Olesen,A Madsen.Maximal prime subgraph decomposition of Bayesian networks[J].IEEE Trans Syst Man Cybern B,2002,32:21-31.[14] R W Robinson.Counting unlabeled acyclic digraphs[J],Combinational Mathematics,1977,622:28-43.[15] D Heckerman,D Geiger,D M Chickering.Learning BNs:The combination of knowledge and statistical data[J].Machine Learning,1995,20:197-243.[16] R E Neapolitan.Learning Bayesian Networks[M].Prentice-Hall,Englewood Cliffs,NJ,2004.[17] S Kullback.Information Theory and Statistics[M].Dover Publication,1968.[18] S L Lauritzen. Graphical Models[M].Clarendon Press,Oxford,1996.[19] S Lauritzen,D Spiegelhalter.Local computations with probabilities on graphical structures and their application on expert systems[J].J Royal Statistical Soc,1988,50:157-224.[20] I Beinlich,G Suermondt,R Chavez,G Cooper.The ALARM monitoring mystem:a case study with two probabilistic inference techniques for belief networks[A].Proc Second European Conf Artificial Intelligence in Medicine[C].NK USA,1989.247-256. |