{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:36:43Z","timestamp":1767137803282,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319999593","type":"print"},{"value":"9783319999609","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99960-9_3","type":"book-chapter","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T04:57:34Z","timestamp":1535000254000},"page":"38-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["How Much Can Experimental Cost Be\u00a0Reduced in Active Learning of Agent Strategies?"],"prefix":"10.1007","author":[{"given":"C\u00e9line","family":"Hocquette","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,24]]},"reference":[{"issue":"4","key":"3_CR1","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. J. Autom. Reason. 2(4), 319\u201342 (1988)","journal-title":"J. Autom. Reason."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tcs.2003.11.004","volume":"313","author":"D Angluin","year":"2004","unstructured":"Angluin, D.: Queries revisited. Theor. Comput. Sci. 313(2), 175\u2013194 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","unstructured":"Bryant, C.H., Muggleton, S.H., Oliver, S.G., Kell, D.B., Reiser, P., King, R.D.: Combining inductive logic programming, active learning and robotics to discover the function of genes. Electron. Trans. Artif. Intell. 5\u2013B1(012), pp. 1\u201336 (2001)"},{"issue":"2","key":"3_CR4","first-page":"201","volume":"15","author":"D Cohn","year":"1994","unstructured":"Cohn, D., Atlas, L., Ladner, R.: Improving generalization with active learning. Mach. Learn. 15(2), 201\u2013221 (1994)","journal-title":"Mach. Learn."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Cover, M.T., Thomas, J.A.: Elements of Information Theory. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"3_CR6","unstructured":"Cropper, A., Muggleton, S.H.: Learning efficient logical robot strategies involving composable objects. In: IJCAI 2015, pp. 3423\u20133429 (2015)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-23708-4_5","volume-title":"Inductive Logic Programming","author":"A Cropper","year":"2015","unstructured":"Cropper, A., Muggleton, S.H.: Logical minimisation of meta-rules within meta-interpretive learning. In: Davis, J., Ramon, J. (eds.) ILP 2014. LNCS (LNAI), vol. 9046, pp. 62\u201375. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23708-4_5"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cropper, A., Muggleton, S.H.: Learning efficient logic programs. Mach. Learn. (2018)","DOI":"10.1007\/s10994-018-5712-6"},{"key":"3_CR9","unstructured":"Cropper, A., Muggleton, S.H.: Learning higher-order logic programs through abstraction and invention. In: IJCAI 2016, pp. 1418\u20131424 (2016)"},{"key":"3_CR10","first-page":"337","volume":"17","author":"S Dasgupta","year":"2005","unstructured":"Dasgupta, S.: Analysis of a greedy active learning strategy. Adv. Neural Inf. Process. Syst. 17, 337\u2013344 (2005)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"3_CR11","unstructured":"Dasgupta, S.: Coarse sample complexity bounds for active learning. In: Proceedings of the 18th International Conference on Neural Information Processing Systems, pp. 235\u2013242 (2005)"},{"key":"3_CR12","unstructured":"Freund, Y., Seung, H.S., Shamir, E., Tishby, N.: Selective samping using the query by committee algorithm. Mach. Learn., pp. 1551\u20131557 (1997)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Hanneke, S.: A bound on the label complexity of agnostic active learning. In: ICML (2007)","DOI":"10.1145\/1273496.1273541"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Hanneke, S.: Theory of disagreement-based active learning. Found. Trends Mach. Learn. 7 (2014)","DOI":"10.1561\/2200000037"},{"key":"3_CR15","first-page":"83","volume":"14","author":"D Haussler","year":"1994","unstructured":"Haussler, D., Kearns, M., Schapire, R.E.: Bounds on the sample complexity of bayesian learning using information theory and the VC dimension. Mach. Learn. 14, 83\u2013113 (1994)","journal-title":"Mach. Learn."},{"key":"3_CR16","unstructured":"von Frisch, K.: The dance language and orientation of bees. The Belknap Press of Harvard University Press, Cambridge, Massachussets (1967)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1038\/nature02236","volume":"427","author":"RD King","year":"2004","unstructured":"King, R.D., et al.: Functional genomic hypothesis generation and experimentation by a robot scientist. Nature 427, 247\u2013252 (2004)","journal-title":"Nature"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1022627018023","volume":"11","author":"SR Kulkarni","year":"1993","unstructured":"Kulkarni, S.R., Mitter, S.K., Tsitsiklis, J.N.: Active learning using arbitrary binary valued queries. Mach. Learn. 11, 23\u201335 (1993)","journal-title":"Mach. Learn."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-15883-4_12","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T Lang","year":"2010","unstructured":"Lang, T., Toussaint, M., Kersting, K.: Exploration in relational worlds. In: Balc\u00e1zar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010. LNCS (LNAI), vol. 6322, pp. 178\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15883-4_12"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Lewis, D., Gale, W.: A sequential algorithm for training text classifiers. In: Croft, B.W., van Rijsbergen, C.J. (eds.) SIGIR 1994, pp. 3\u201312. ACM\/Springer, London (1994). https:\/\/doi.org\/10.1007\/978-1-4471-2099-5_1","DOI":"10.1007\/978-1-4471-2099-5_1"},{"key":"3_CR21","unstructured":"Mitchell, T.M.: Version Spaces: An Approach to Concept Learning. PhD Thesis (1978)"},{"key":"3_CR22","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, pp. 1551\u20131557 (2013)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","first-page":"1","volume-title":"Inductive Logic Programming","author":"SH Muggleton","year":"2014","unstructured":"Muggleton, S.H., Lin, D., Chen, J., Tamaddoni-Nezhad, A.: MetaBayes: bayesian meta-interpretative learning using higher-order stochastic refinement. In: Zaverucha, G., Santos Costa, V., Paes, A. (eds.) ILP 2013. LNCS (LNAI), vol. 8812, pp. 1\u201317. Springer, Heidelberg (2014)"},{"key":"3_CR24","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."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-31951-8_26","volume-title":"Inductive Logic Programming","author":"C Rodrigues","year":"2012","unstructured":"Rodrigues, C., G\u00e9rard, P., Rouveirol, C., Soldano, H.: Active learning of relational action models. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS (LNAI), vol. 7207, pp. 302\u2013316. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31951-8_26"},{"key":"3_CR26","unstructured":"Roy, S., Namboodiri, V.P., Biswas, A.: Active learning with version spaces for object detection. ArXiv e-prints, November 2016"},{"key":"3_CR27","unstructured":"Settles, B.: Active learning literature survey. 52, July 2010"},{"key":"3_CR28","unstructured":"Thompson, C.A., Califf, M.E., Mooney, R.J.: Active learning for natural language parsing and information extraction. In: Proceedings of the 16th International Conference on Machine Learning, ICML 1999, pp. 406\u2013414. Morgan Kaufmann Publishers Inc. (1999)"},{"key":"3_CR29","unstructured":"Tosh, C., Dasgupta, S.: Diameter-based active learning. CoRR, abs\/1702.08553 (2017)"}],"updated-by":[{"DOI":"10.1007\/978-3-319-99960-9_11","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2018,11,18]],"date-time":"2018-11-18T00:00:00Z","timestamp":1542499200000}}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99960-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T16:26:56Z","timestamp":1571761616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99960-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319999593","9783319999609"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99960-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ferrara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ilp2018.unife.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.83","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"-","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}