{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:37:35Z","timestamp":1743143855157,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662449226"},{"type":"electronic","value":"9783662449233"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44923-3_1","type":"book-chapter","created":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T00:04:17Z","timestamp":1411517057000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement"],"prefix":"10.1007","author":[{"given":"Stephen H.","family":"Muggleton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianhuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Tamaddoni-Nezhad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,24]]},"reference":[{"key":"1_CR1","unstructured":"Abramson, H.: Definite clause translation grammars. Technical report, Vancouver, BC, Canada, Canada (1984)"},{"key":"1_CR2","unstructured":"Angelopoulos, N., Cussens, J.: Markov chain Monte Carlo using tree-based priors on model structure. In: UAI-2001. Kaufmann, Los Altos (2001)"},{"key":"1_CR3","unstructured":"Arvanitis, A., Muggleton, S.H., Chen, J., Watanabe, H.: Abduction with stochastic logic programs based on a possible worlds semantics. In: Short Paper Proceedings of the 16th International Conference on Inductive Logic Programming. University of Corunna (2006)"},{"key":"1_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316870","volume-title":"Bayesian Theory","author":"JM Bernardo","year":"1994","unstructured":"Bernardo, J.M., Smith, A.F.M.: Bayesian Theory. Wiley, New York (1994)"},{"issue":"12","key":"1_CR5","doi-asserted-by":"publisher","first-page":"e29028","DOI":"10.1371\/journal.pone.0029028","volume":"6","author":"DA Bohan","year":"2011","unstructured":"Bohan, D.A., Caron-Lormier, G., Muggleton, S.H., Raybould, A., Tamaddoni-Nezhad, A.: Automated discovery of food webs from ecological data using logic-based machine learning. PloS ONE 6(12), e29028 (2011)","journal-title":"PloS ONE"},{"issue":"2","key":"1_CR6","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123\u2013140 (1996)","journal-title":"Mach. Learn."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Buntine, W.: A theory of learning classification rules. Ph.D. thesis. School of Computing Science, University of Technology, Sydney (1990)","DOI":"10.1016\/B978-1-55860-036-2.50033-3"},{"key":"1_CR8","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog and its applications in link discovery. In: de Mantaras, R.L., Veloso, M.M. (eds.) Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 804\u2013809 (2007)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Shapire, R.: A decision theoretic generalisation of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55, 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/11536314_26","volume-title":"Inductive Logic Programming","author":"L Getoor","year":"2005","unstructured":"Getoor, L.: Tutorial on statistical relational learning. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 415\u2013415. Springer, Heidelberg (2005)"},{"issue":"1","key":"1_CR11","first-page":"83","volume":"14","author":"D Haussler","year":"1994","unstructured":"Haussler, D., Kearns, M., Shapire, R.: Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension. Mach. Learn. J. 14(1), 83\u2013113 (1994)","journal-title":"Mach. Learn. J."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-44797-0_10","volume-title":"Inductive Logic Programming","author":"K Kersting","year":"2001","unstructured":"Kersting, K., De Raedt, L.: Towards combining inductive logic programming with Bayesian networks. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 118\u2013131. Springer, Heidelberg (2001)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-25974-9_10","volume-title":"Computational Methods in Systems Biology","author":"H Lodhi","year":"2005","unstructured":"Lodhi, H., Muggleton, S.H.: Modelling metabolic pathways using stochastic logic programs-based ensemble methods. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 119\u2013133. Springer, Heidelberg (2005)"},{"key":"1_CR14","unstructured":"Mantadelis, T., Janssens, G.: Nesting probabilistic inference. In: Proceedings of the International Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS), pp. 1\u201316, Lexington, Kentucky. Springer-Verlag (2011)"},{"key":"1_CR15","first-page":"254","volume-title":"Advances in Inductive Logic Programming","author":"SH Muggleton","year":"1996","unstructured":"Muggleton, S.H.: Stochastic logic programs. In: de Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 254\u2013264. IOS Press, Amsterdam (1996)"},{"key":"1_CR16","unstructured":"Muggleton, S.H.: Stochastic logic programs. J. Logic Program. (2001). Accepted subject to revision"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Muggleton, S.H.: Learning structure and parameters of stochastic logic programs. Electron. Trans. Artif.Intell. 6 (2002)","DOI":"10.1007\/3-540-36468-4_13"},{"key":"1_CR18","unstructured":"Muggleton, S.H., Lin, D.: Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited. In: Proceedings of the 23rd International Joint Conference Artificial Intelligence (IJCAI 2013), pp. 1551\u20131557 (2013)"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10994-013-5358-3","volume":"94","author":"SH Muggleton","year":"2014","unstructured":"Muggleton, S.H., Lin, D., Pahlavi, N., Tamaddoni-Nezhad, A.: Meta-interpretive learning: application to grammatical inference. Mach. Learn. 94, 25\u201349 (2014)","journal-title":"Mach. Learn."},{"issue":"2\u20133","key":"1_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10994-007-5029-3","volume":"70","author":"SH Muggleton","year":"2007","unstructured":"Muggleton, S.H., Tamaddoni-Nezhad, A.: QG\/GA: a stochastic search for Progol. Mach. Learn. 70(2\u20133), 123\u2013133 (2007). doi:10.1007\/s10994-007-5029-3","journal-title":"Mach. Learn."},{"key":"1_CR21","unstructured":"Pahlavi, N., Muggleton, S.H.: Towards efficient higher-order logic learning in a first-order datalog framework. In: Latest Advances in Inductive Logic Programming. Imperial College Press (2012) (in Press)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78652-8_1","volume-title":"Probabilistic Inductive Logic Programming","author":"L De Raedt","year":"2008","unstructured":"De Raedt, L., Kersting, K.: Probabilistic inductive logic programming. In: De Raedt, L., Frasconi, P., Kersting, K., Muggleton, S.H. (eds.) Probabilistic Inductive Logic Programming. LNCS (LNAI), vol. 4911, pp. 1\u201327. Springer, Heidelberg (2008)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-21295-6_26","volume-title":"Inductive Logic Programming","author":"A Tamaddoni-Nezhad","year":"2011","unstructured":"Tamaddoni-Nezhad, A., Muggleton, S.: Stochastic refinement. In: Frasconi, P., Lisi, F.A. (eds.) ILP 2010. LNCS, vol. 6489, pp. 222\u2013237. Springer, Heidelberg (2011)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-36468-4_22","volume-title":"Inductive Logic Programming","author":"F \u017delezn\u00fd","year":"2003","unstructured":"\u017delezn\u00fd, F., Srinivasan, A., Page, D.L.: Lattice-search runtime distributions may be heavy-tailed. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 333\u2013345. Springer, Heidelberg (2003)"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.4310\/SII.2009.v2.n3.a8","volume":"2","author":"J Zhu","year":"2009","unstructured":"Zhu, J., Zou, H., Rosset, S., Hastie, T.: Multi-class adaboost. Stat. Interface 2, 349\u2013360 (2009)","journal-title":"Stat. Interface"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44923-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T11:06:46Z","timestamp":1674817606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44923-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662449226","9783662449233"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44923-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"24 September 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}