{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:09Z","timestamp":1725550449770},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119309"},{"type":"electronic","value":"9783642119316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11931-6_6","type":"book-chapter","created":{"date-parts":[[2010,3,25]],"date-time":"2010-03-25T10:42:44Z","timestamp":1269513764000},"page":"117-139","source":"Crossref","is-referenced-by-count":1,"title":["Generalisation Operators for Lists Embedded in a Metric Space"],"prefix":"10.1007","author":[{"given":"V.","family":"Estruch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Ferri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Hern\u00e1ndez-Orallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. J.","family":"Ram\u00edrez-Quintana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"81","volume-title":"Proc. of the 17th International Conference on Machine Learning (ICML 2000)","author":"A.F. Bowers","year":"2000","unstructured":"Bowers, A.F., Giraud-Carrier, C.G., Lloyd, J.W.: Classification of individuals with complex structure. In: Proc. of the 17th International Conference on Machine Learning (ICML 2000), pp. 81\u201388. Morgan Kaufmann, San Francisco (2000)"},{"key":"6_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4134-6","volume-title":"Measure, Topology and Fractal Geometry","author":"G.A. Edgar","year":"1990","unstructured":"Edgar, G.A.: Measure, Topology and Fractal Geometry. Springer, Heidelberg (1990)"},{"unstructured":"Estruch, V.: Bridging the gap between distance and generalisation: Symbolic learning in metric spaces. PhD Thesis, DSIC-UPV (2008), \n                    \n                      http:\/\/www.dsic.upv.es\/~vestruch\/thesis.pdf","key":"6_CR3"},{"key":"6_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/11536314_6","volume-title":"Inductive Logic Programming","author":"V. Estruch","year":"2005","unstructured":"Estruch, V., Ferri, C., Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: Distance based generalisation. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol.\u00a03625, pp. 87\u2013102. Springer, Heidelberg (2005)"},{"unstructured":"Estruch, V., Ferri, C., Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: Distance based generalisation for graphs. In: Proc. Work. of Machine and Learning with Graphs, pp. 133\u2013140 (2006)","key":"6_CR5"},{"key":"6_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-73847-3_21","volume-title":"Inductive Logic Programming","author":"V. Estruch","year":"2007","unstructured":"Estruch, V., Ferri, C., Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: Minimal distance-based generalisation operators for first-order objects. In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol.\u00a04455, pp. 169\u2013183. Springer, Heidelberg (2007)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-44716-4_15","volume-title":"Functional and Logic Programming","author":"C. Ferri","year":"2001","unstructured":"Ferri, C., Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: Incremental learning of functional logic programs. In: Kuchen, H., Ueda, K. (eds.) FLOPS 2001. LNCS, vol.\u00a02024, pp. 233\u2013247. Springer, Heidelberg (2001)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell System Technical Journal\u00a026(2), 147\u2013160 (1950)","journal-title":"Bell System Technical Journal"},{"unstructured":"Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: Inverse narrowing for the induction of functional logic programs. In: 1998 Joint Conference on Declarative Programming, APPIA-GULP-PRODE 1998, A Coru\u00f1a, Spain, July 20-23, pp. 379\u2013392 (1998)","key":"6_CR9"},{"key":"6_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-48751-4_12","volume-title":"Inductive Logic Programming","author":"J. Hern\u00e1ndez-Orallo","year":"1999","unstructured":"Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: A strong complete schema for inductive functional logic programming. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 116\u2013127. Springer, Heidelberg (1999)"},{"key":"6_CR11","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady\u00a010, 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady"},{"key":"6_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-36434-X_6","volume-title":"Advanced Lectures on Machine Learning","author":"J.W. Lloyd","year":"2003","unstructured":"Lloyd, J.W.: Learning comprehensible theories from structured data. In: Mendelson, S., Smola, A.J. (eds.) Advanced Lectures on Machine Learning. LNCS (LNAI), vol.\u00a02600, pp. 203\u2013225. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0004-3702(99)00067-3","volume":"114","author":"S.H. Muggleton","year":"1999","unstructured":"Muggleton, S.H.: Inductive logic programming: Issues, results, and the challenge of learning language in logic. Artificial Intelligence\u00a0114(1-2), 283\u2013296 (1999)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0004-3702(94)00042-Y","volume":"74","author":"R. Olsson","year":"1995","unstructured":"Olsson, R.: Inductive functional programming using incremental program transformation. Artifificial Intelligence\u00a074(1), 55\u201381 (1995)","journal-title":"Artifificial Intelligence"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1093\/comjnl\/42.4.260","volume":"42","author":"J. Rissanen","year":"1999","unstructured":"Rissanen, J.: Hypothesis selection and testing by the MDL principle. The Computer Journal\u00a042(4), 260\u2013269 (1999)","journal-title":"The Computer Journal"},{"key":"6_CR16","volume-title":"Inductive synthesis of Functional Programs-Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning","author":"U. Schmid","year":"2003","unstructured":"Schmid, U.: Inductive synthesis of Functional Programs-Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning. Springer, Heidelberg (2003)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1093\/bioinformatics\/bti1055","volume":"21","author":"S.H. Swamidass","year":"2005","unstructured":"Swamidass, S.H., Chen, J., Bruand, J., Phung, P., Ralaivola, L., Baldi, P.: Kernels for small molecules and the prediction of mutagenecity, toxicity and anti-cancer activity. Bioinformatics\u00a021, 359\u2013368 (2005)","journal-title":"Bioinformatics"},{"volume-title":"Introduction to Algorithms","year":"2000","unstructured":"Rivest, R., Cormen, T.H., Leiserson, C., Stein, C. (eds.): Introduction to Algorithms. MIT Press, Cambridge (2000)","key":"6_CR18"},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C.S. Wallace","year":"1999","unstructured":"Wallace, C.S., Dowe, D.L.: Minimum Message Length and Kolmogorov Complexity. Computer Journal\u00a042(4), 270\u2013283 (1999)","journal-title":"Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Approaches and Applications of Inductive Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11931-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:00:34Z","timestamp":1619784034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11931-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119309","9783642119316"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11931-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}