{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:30Z","timestamp":1725493110852},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540005674"},{"type":"electronic","value":"9783540364689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36468-4_15","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T06:14:46Z","timestamp":1192860886000},"page":"223-237","source":"Crossref","is-referenced-by-count":2,"title":["Revision of First-Order Bayesian Classifiers"],"prefix":"10.1007","author":[{"given":"Kate","family":"Revoredo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerson","family":"Zaverucha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"J. Binder, D. Koller, S. Russell and others. Adaptive probabilistic networks with hidden variables. Machine Learining. pp.213\u2013244, 1997.","DOI":"10.1023\/A:1007421730016"},{"key":"15_CR2","unstructured":"C.A. Brunk, 1996. An Investigation of knowledge Intensive Approaches to Concept Leaning and Theory Refinement. Ph.D. thesis, University of California, Irvine, CA."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"D.M. Chickering. Learnig Bayesian networks is NP-complete. In: Learning from Data: Artifial Intelligence and Statiscs V. D. Fisher and H.-J. Lenz. Spring Verlag, pp.121\u2013130, 1996.","DOI":"10.1007\/978-1-4612-2404-4_12"},{"key":"15_CR4","unstructured":"N. Friedman, I. Nachman and D. Pe\u00e9r. Learning Bayesian Network Structure from Massive Datasets: The Sparse Candidate Algorithm. In Proceedings of the Fifteenth Conference on Uncertainty in Articial Intelligence. pp.206\u2013215, 1999."},{"key":"15_CR5","unstructured":"I. Fabian and D. A. Lambert. First-Order Bayesian Reasoning. Proceedings Eleventh Australian Joint Conference on Artificial Intelligence. 1502, 131\u2013142, 1998."},{"key":"15_CR6","unstructured":"N. Friedman, L. Getoor, D. Koller and A. Pfeffer. Learning Probabilistic Relational Models. Proc. IJCAI-99, 1300\u20131309, 1999."},{"key":"15_CR7","unstructured":"P. Haddawy. An overview of some recent developments on Bayesian problem soving techniques. AI Magazine, Spring 1999-Special issue on Uncertainty in AI, 1999."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-94-011-5014-9_11","volume-title":"Learning in Graphical Models","author":"D. Heckerman","year":"1998","unstructured":"D. Heckerman. A tutorial on learning with Bayesian networks. In M.I. Jordan, editor, Learning in Graphical Models, pp 301\u2013354. MIT Press Cambridge, MA, 1998."},{"key":"15_CR9","unstructured":"M. Jaeger. Relational Bayesian Networks. Proc. 13th Conference on Uncertainty in AI. pp.266\u2013273. Morgan Kaufmann, 1997."},{"key":"15_CR10","unstructured":"K. Kersting, L. De Raedt and S. Kramer. Interpreting Bayesian Logic Programs. In Working Notes of the AAAI-2000 Workshop on Learning Statistical Models from Relational Data (SRL), Austin, Texas, 2000."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"K. Kersting and L. De Raedt. Bayesian Logic Programs. Proc. of the Work-in-Progress Track at the 10th International Conference on Inductive Logic Programming, 2000.","DOI":"10.1007\/3-540-44797-0_9"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"K. Kersting and L. De Raedt. Bayesian Logic Programs. Technical Report 151, University of Freiburg, Institute for COmputer Science, Abril 2001.","DOI":"10.1007\/3-540-44797-0_9"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"K. Kersting and L. De Raedt. Towards Combining Inductive Logic Programming with Bayesian Networks. In proceedings of the Eleventh International Conference of Inductive Logic Programming. Strasbourg, France, pp. 118\u2013131, 2001.","DOI":"10.1007\/3-540-44797-0_10"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"K. Kersting and L. De Raedt. Adaptive Bayesian Logic Programs. In proceedings of the Eleventh International Conference of Inductive Logic Programming. Strasbourg, France, pp. 104\u2013117, 2001.","DOI":"10.1007\/3-540-44797-0_9"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"D. Koller. Probabilistic Relational Models. In Proc. of the 9th Int. Workshop on ILP. LNAI 1634, 3\u201313, Springer Verlag, 1999.","DOI":"10.1007\/3-540-48751-4_1"},{"key":"15_CR16","unstructured":"D. Koller and A. Pfeffer. Learning probabilities for noisy first-order rules. In Proc. of the 15th International Joint Conference on Artficial Intelligence (IJCAI-97), 1316\u20131323, 1997."},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1111\/j.1467-8640.1994.tb00166.x","volume":"10","author":"W. Lam","year":"1994","unstructured":"W. Lam and F. Bacchus. Learning Bayesian belief networks: An approach based on the mdl principle. Computatinal Intelligence, 10(3),pp. 269\u201329, 1994.","journal-title":"Computatinal Intelligence"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0167-9473(93)E0056-A","volume":"19","author":"S.L. Lauritzen","year":"1995","unstructured":"S.L Lauritzen. The Em algorithm for graphical association models with missing data. Computational Statistics and Data Analysis, 19: 191\u2013201, 1995.","journal-title":"Computational Statistics and Data Analysis"},{"key":"15_CR19","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer Verlag, 2. edition, 1989."},{"key":"15_CR20","unstructured":"S. Muggleton. Stochastic logic programs. In L.De Raedt, editor, Advances in Inductive Logic Programming. IOS Press, 1996."},{"key":"15_CR21","unstructured":"G.J. McLachlan and T. Krishnan. The EM algorithm and Extensions. Wiley Interscience, 1997."},{"key":"15_CR22","volume-title":"Machine Learning","author":"T. Mitchell","year":"1997","unstructured":"T. Mitchell. Machine Learning. McGraw-Hill New York, NY, 1997."},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(96)00128-4","volume":"171","author":"L. Ngo","year":"1997","unstructured":"L. Ngo and P. Haddawy. Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science, 171:147\u2013177, 1997.","journal-title":"Theoretical Computer Science"},{"key":"15_CR24","unstructured":"J. Pearl. Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman, 2. edition, 1991."},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(93)90061-F","volume":"64","author":"D. Poole","year":"1993","unstructured":"D. Poole. Probabilistic horn abduction and bayesian networks. Artificial Intelligence, 64(1): 81\u2013129, 1993.","journal-title":"Artificial Intelligence"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0743-1066(99)00071-0","volume":"44","author":"D. Poole","year":"2000","unstructured":"D. Poole. Abducing Through Negation as Failure: Stable models within the independent choice logic. Journal of Logic Programming, 44: 5\u2013359, 2000.","journal-title":"Journal of Logic Programming"},{"key":"15_CR27","unstructured":"D. Poole. Learning, Bayesian Probability, Graphical Models, and Abduction. P. Flach and A. Kakas, editors, Abduction and Induction: essays on their relation and integration. Kluwer, 1998."},{"key":"15_CR28","unstructured":"S. Ramachandran and R. Mooney. Theory Refnement of Bayesian Networds with Hidden Variables. 15th International Conference on Machine Learning (ICML), pp.454\u2013462, Morgan Kaufman, 1998."},{"key":"15_CR29","unstructured":"K. Revoredo and G. Zaverucha. Theory Refinement of Bayesian Logic Programs. Proceedings of the Eigth International Conference on Neural Information Processing (ICONIP), Shanghai, China. pp. 1088\u20131092, 2001."},{"key":"15_CR30","first-page":"95","volume":"19","author":"B. Richards","year":"1995","unstructured":"B. Richards and R. Mooney. Automated Refinement of First-Order Horn-Clause Domain Theories. Machine Learning 19, pp. 95\u2013131, 1995.","journal-title":"Machine Learning"},{"key":"15_CR31","unstructured":"S. Wrobel. First-order Theory Refinement. Advances in Inductive Logic Programming, edited by Luc de Raedt, pp. 14\u201333, IOS Press, 1996."}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36468-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:57:59Z","timestamp":1556906279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36468-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005674","9783540364689"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-36468-4_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}