{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:27:24Z","timestamp":1743125244963,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221514"},{"type":"electronic","value":"9783642221521"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22152-1_20","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T19:22:00Z","timestamp":1309029720000},"page":"229-238","source":"Crossref","is-referenced-by-count":0,"title":["Mixture of Markov Trees for Bayesian Network Structure Learning with Small Datasets in High Dimensional Space"],"prefix":"10.1007","author":[{"given":"Sourour","family":"Ammar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Leray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Ammar, S., Leray, P., Defourny, B., Wehenkel, L.: High-dimensional probability density estimation with randomized ensembles of tree structured bayesian networks. In: Proceedings of the Fourth European Workshop on Probabilistic Graphical Models (PGM 2008), pp. 9\u201316 (2008)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-02906-6_15","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"S. Ammar","year":"2009","unstructured":"Ammar, S., Leray, P., Defourny, B., Wehenkel, L.: Probability density estimation by perturbing and combining tree structured markov networks. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol.\u00a05590, pp. 156\u2013167. Springer, Heidelberg (2009)"},{"key":"20_CR3","unstructured":"Ammar, S., Leray, P., Schnitzler, F., Wehenkel, L.: Sub-quadratic markov tree mixture learning based on randomizations of the chow-liu algorithm. In: The Fifth European Workshop on Probabilistic Graphical Models (PGM 2010), Helsinki, Finland, pp. 17\u201325 (2010)"},{"key":"20_CR4","unstructured":"Ammar, S., Leray, P., Wehenkel, L.: Sub-quadratic markov tree mixture models for probability density estimation. In: 19th International Conference on Computational Statistics (COMPSTAT 2010), Paris, France, pp. 673\u2013680 (2010)"},{"key":"20_CR5","first-page":"26","volume-title":"Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI 2002)","author":"V. Auvray","year":"2002","unstructured":"Auvray, V., Wehenkel, L.: On the construction of the inclusion boundary neighbourhood for markov equivalence classes of bayesian network structures. In: Darwiche, A., Friedman, N. (eds.) Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI 2002), pp. 26\u201335. Morgan Kaufmann Publishers, S.F (2002)"},{"key":"20_CR6","unstructured":"Broom, B., Do, K., Subramanian, D.: Model averaging for structure learning in bayesian networks: an experimental study. Tech. rep., Computer Science Department, Rice University (2008)"},{"key":"20_CR7","unstructured":"Chickering, D., Geiger, D., Heckerman, D.: Learning bayesian networks is NP-hard. Tech. Rep. MSR-TR-94-17, Microsoft Research Technical Report (1994), \n                    \n                      http:\/\/citeseer.nj.nec.com\/140425.html"},{"key":"20_CR8","first-page":"507","volume":"3","author":"D. Chickering","year":"2003","unstructured":"Chickering, D.: Optimal structure identification with greedy search. Journal of Machine Learning Research\u00a03, 507\u2013554 (2003)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C. Chow","year":"1968","unstructured":"Chow, C., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory\u00a014(3), 462\u2013467 (1968)","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR10","first-page":"309","volume":"9","author":"G. Cooper","year":"1992","unstructured":"Cooper, G., Herskovits, E.: A bayesian method for the induction of probabilistic networks from data. Machine Learning\u00a09, 309\u2013347 (1992)","journal-title":"Machine Learning"},{"key":"20_CR11","unstructured":"Friedman, N., Nachman, I., Per, D.: Learning bayesian network structure from massive datasets: The \u201dsparse candidate\u201d algorithm. In: Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI), pp. 206\u2013215 (1999)"},{"key":"20_CR12","unstructured":"Ide, J., Cozman, F., Ramos, F.: Generating random bayesian networks with constraints on induced width. In: ECAI, pp. 323\u2013327 (2004)"},{"issue":"4-6","key":"20_CR13","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.neucom.2009.05.018","volume":"73","author":"S.R. Morais de","year":"2010","unstructured":"de Morais, S.R., Aussem, A.: A novel markov boundary based feature subset selection algorithm. Neurocomputing\u00a073(4-6), 578\u2013584 (2010)","journal-title":"Neurocomputing"},{"key":"20_CR14","unstructured":"Nguyen, H.T., Leray, P., Ramstein, G.: Summarizing and visualizing a set of bayesian networks with quasi essential graphs. Tech. rep., University of Nantes (2011)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","volume":"29","author":"J. Pearl","year":"1986","unstructured":"Pearl, J.: Fusion, propagation, and structuring in belief networks. Artificial Intelligence\u00a029, 241\u2013288 (1986)","journal-title":"Artificial Intelligence"},{"key":"20_CR16","first-page":"441","volume-title":"Principles of Knowledge Representation and Reasoning, KR 1991","author":"J. Pearl","year":"1991","unstructured":"Pearl, J., Verma, T.S.: A theory of inferred causation. In: Allen, J.F., Fikes, R., Sandewall, E. (eds.) Principles of Knowledge Representation and Reasoning, KR 1991, pp. 441\u2013452. Morgan Kaufmann, San Mateo (1991), \n                    \n                      http:\/\/citeseer.nj.nec.com\/pearl91theory.html"},{"key":"20_CR17","unstructured":"Scutari, M.: Measures of Variability for Graphical Models. Ph.D. thesis, University of Padova (2011)"},{"key":"20_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2748-9","volume-title":"Causation, prediction, and search","author":"P. Spirtes","year":"1993","unstructured":"Spirtes, P., Glymour, C., Scheines, R.: Causation, prediction, and search. Springer, Heidelberg (1993)"},{"key":"20_CR19","unstructured":"Tsamardinos, I., Aliferis, C., Statnikov, A.: Algorithms for large scale markov blanket discovery. In: The 16th International FLAIRS Conference, pp. 376\u2013380 (2003)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Tsamardinos, I., Aliferis, C., Statnikov, A.: Time and sample efficient discovery of markov blankets and direct causal relations. In: Proceedings of the 9th CAN SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 673\u2013678 (2003)","DOI":"10.1145\/956750.956838"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","volume":"65","author":"I. Tsamardinos","year":"2006","unstructured":"Tsamardinos, I., Brown, L., Aliferis, C.: The max-min hill-climbing bayesian network structure learning algorithm. Machine Learning\u00a065, 31\u201378 (2006)","journal-title":"Machine Learning"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-15939-8_21","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"I. Tsamardinos","year":"2010","unstructured":"Tsamardinos, I., Borboudakis, G.: Permutation testing improves bayesian network learning. In: Balc\u00e1zar, J., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010. LNCS, vol.\u00a06323, pp. 322\u2013337. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22152-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T06:05:55Z","timestamp":1553839555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22152-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221514","9783642221521"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22152-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}