{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:34Z","timestamp":1725489154196},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001317"},{"type":"electronic","value":"9783540361312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36131-6_20","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T05:42:30Z","timestamp":1186897350000},"page":"193-203","source":"Crossref","is-referenced-by-count":1,"title":["A Quasi-Metric for Machine Learning"],"prefix":"10.1007","author":[{"given":"Miguel A.","family":"Guti\u00e9rrez-Naranjo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 A.","family":"Alonso-Jim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaqu\u00edn","family":"Borrego-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"key":"20_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"20_CR2","unstructured":"M. A. Guti\u00e9rrez-Naranjo, J. A. Alonso-Jim\u00e9nez and J. Borrego-D\u00edaz: A topological study of the upward refinement operators in ILP. In: Proceedings of the 10th International Conference on Inductive Logic Programming,Work in progress track, 2000."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"A. Hutchinson: Metrics on Terms and Clauses. Proceedings ECML-97, Prague, April 1997 (Springer). ftp:\/\/ftp.dcs.kcl.ac.uk\/pub\/ tech-reports\/ tr96-11.ps.gz","DOI":"10.1007\/3-540-62858-4_78"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"P. D. Laird: Learning from Good and Bad Data. Kluwer Academic Publishers, 1988","DOI":"10.1007\/978-1-4613-1685-5"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"R. Lowen: Approach Spaces, the Missing Link in the Topology-Uniformity-Metric Triad. Oxford Mathematical Monographs, Oxford University Press, 1997.","DOI":"10.1093\/oso\/9780198500308.001.0001"},{"key":"20_CR6","unstructured":"S-H. Nienhuys-Cheng: Distance between Herbrand interpretations: a measure for approximations to a target concept. Technical Report EUR-FEW-CS-97-05. Department of Computer Science, Erasmus University, the Netherlands, 1997. http:\/\/www.few.eur.nl\/few\/research\/pubs\/cs\/1997\/eur-few-cs-97-05.pdf"},{"key":"20_CR7","first-page":"153","volume-title":"Machine Intelligence","author":"G. D. Plotkin","year":"1970","unstructured":"G. D. Plotkin: A Note on Inductive Generalization. In Machine Intelligence 5, pp.: 153\u2013163. EdinburghUniv ersity Press, Edinburgh, 1970."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"J. Ramon and M. Bruynooghe: A framework for defining distances between first-order logic-objects. Report CW 263, Department of Computer Science, Katholieke Universiteit Leuven, May 1998. http:\/\/www.cs.kuleuven.ac.be\/publicaties\/rapporten\/cw\/CW263.ps.gz","DOI":"10.1007\/BFb0027331"},{"key":"20_CR9","unstructured":"E. Y. Shapiro: Inductive Inference of Theories from Facts. Technical Report 624, Department of Computer Science, Yale University, New Haven, CT, 1981"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"M. Schmidt-Schauss. Implication of clauses is undecidable. Theoretical Computer Science, 59\u20133, pp. 287\u2013296, 1988.","DOI":"10.1016\/0304-3975(88)90146-6"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"P. R. J. van der Laag, S.-H. Nienhuys-Cheng: Completeness and properness of refinement operators in Inductive Logic Programming. Journal of Logic Programming, Vol 34, n.3, pp.: 201\u2013225, March 1998","DOI":"10.1016\/S0743-1066(97)00077-0"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2014 IBERAMIA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36131-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T10:31:10Z","timestamp":1708165870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36131-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001317","9783540361312"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36131-6_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}