{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:34:56Z","timestamp":1743114896576,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":103,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781489976857"},{"type":"electronic","value":"9781489976871"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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":[[2017]]},"DOI":"10.1007\/978-1-4899-7687-1_52","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T12:35:13Z","timestamp":1492086913000},"page":"261-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connections Between Inductive Inference and Machine Learning"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"52_CR3329","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2178\/jsl\/1080938842","volume":"69","author":"A Ambainis","year":"2004","unstructured":"Ambainis A, Case J, Jain S, Suraj M (2004) Parsimony hierarchies for inductive inference. J Symb Logic 69:287\u2013328","journal-title":"J Symb Logic"},{"issue":"3","key":"52_CR3330","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(89)90153-9","volume":"66","author":"D Angluin","year":"1989","unstructured":"Angluin D, Gasarch W, Smith C (1989) Training sequences. Theor Comput Sci 66(3):255\u2013272","journal-title":"Theor Comput Sci"},{"key":"52_CR3331","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D Angluin","year":"1980","unstructured":"Angluin D (1980) Finding patterns common to a set of strings. J Comput Syst Sci 21:46\u201362","journal-title":"J Comput Syst Sci"},{"key":"52_CR3332","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S Arikawa","year":"1992","unstructured":"Arikawa S, Shinohara T, Yamamoto A (1992) Learning elementary formal systems. Theor Comput Sci 95:97\u2013113","journal-title":"Theor Comput Sci"},{"key":"52_CR3333","volume-title":"Machine intelligence","author":"M Bain","year":"1999","unstructured":"Bain M, Sammut C (1999) A framework for behavioural cloning. In: Furakawa K, Muggleton S, Michie D (eds) Machine intelligence, vol\u00a015. Oxford University Press, Oxford"},{"key":"52_CR3334","doi-asserted-by":"crossref","unstructured":"Baluja S, Pomerleau D (1995) Using the representation in a neural network\u2019s hidden layer for task specific focus of attention. Technical report CMU-CS-95-143, School of Computer Science, CMU, May 1995. Appears in proceedings of the 1995 IJCAI","DOI":"10.21236\/ADA296386"},{"key":"52_CR3335","series-title":"Proceedings of the ninth annual conference on computational learning theory, Desenzano del Garda","doi-asserted-by":"publisher","DOI":"10.1145\/238061.238080","volume-title":"Learning changing concepts by exploiting the structure of change","author":"P Bartlett","year":"1996","unstructured":"Bartlett P, Ben-David S, Kulkarni S (1996) Learning changing concepts by exploiting the structure of change. In: Proceedings of the ninth annual conference on computational learning theory, Desenzano del Garda. ACM Press, New York"},{"key":"52_CR3336","first-page":"425","volume-title":"Refenes APN, Burgess AN, Moody JE (eds) Decision technologies for computational finance","author":"K Bartlmae","year":"1997","unstructured":"Bartlmae K, Gutjahr S, Nakhaeizadeh G (1997) Incorporating prior knowledge about financial markets through neural multitask learning. In: Refenes APN, Burgess AN, Moody JE (eds) Decision technologies for computational finance. Proceedings of the fifth international conference on computational finance. Kluwer Academic, pp 425\u2013432"},{"key":"52_CR3337","first-page":"771","volume-title":"Inductive inference of automata, functions and programs","author":"J B\u0101rzdi\u0146\u0161","year":"1974","unstructured":"B\u0101rzdi\u0146\u0161 J (1974a) Inductive inference of automata, functions and programs. In: Proceedings of the international congress of mathematicians, Vancouver, pp\u00a0771\u2013776"},{"key":"52_CR3338","first-page":"82","volume-title":"Theory of algorithms and programs","author":"J B\u0101rzdi\u0146\u0161","year":"1974","unstructured":"B\u0101rzdi\u0146\u0161 J (1974b) Two theorems on the limiting synthesis of functions. In: Theory of algorithms and programs, vol\u00a0210. Latvian State University, Riga, pp\u00a082\u201388"},{"key":"52_CR3339","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L Blum","year":"1975","unstructured":"Blum L, Blum M (1975) Toward a mathematical theory of inductive inference. Inf Control 28:125\u2013155","journal-title":"Inf Control"},{"key":"52_CR3340","first-page":"231","volume-title":"Learning switching concepts","author":"A Blum","year":"1992","unstructured":"Blum A, Chalasani P (1992) Learning switching concepts. In: Proceedings of the fifth annual conference on computational learning theory, Pittsburgh. ACM Press, New York, pp\u00a0231\u2013242"},{"issue":"11","key":"52_CR3341","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/219717.219771","volume":"38","author":"I Bratko","year":"1995","unstructured":"Bratko I, Muggleton S (1995) Applications of inductive logic programming. Commun ACM 38(11):65\u201370","journal-title":"Commun ACM"},{"key":"52_CR3342","first-page":"335","volume-title":"Machine learning and data mining: methods and applications","author":"I Bratko","year":"1998","unstructured":"Bratko I, Urban\u010di\u010d T, Sammut C (1998) Behavioural cloning of control skill. In: Michalski RS, Bratko I, Kubat M (eds) Machine learning and data mining: methods and applications. Wiley, New York, pp\u00a0335\u2013351"},{"key":"52_CR3343","doi-asserted-by":"crossref","unstructured":"Brazma A, Ukkonen E, Vilo J (1996) Discovering unbounded unions of regular pattern languages from positive examples. In: Proceedings of the seventh international symposium on algorithms and computation (ISAAC\u201996). Lecture notes in computer science, vol\u00a01178. Springer, Berlin, pp\u00a095\u2013104","DOI":"10.1007\/BFb0009485"},{"issue":"2","key":"52_CR3344","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24(2):123\u2013140","journal-title":"Mach Learn"},{"issue":"1","key":"52_CR3345","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"52_CR3346","first-page":"372","volume-title":"Proceedings of the 1993 connectionist models summer school","author":"R Caruana","year":"1993","unstructured":"Caruana R (1993) Multitask connectionist learning. In: Proceedings of the 1993 connectionist models summer school. Lawrence Erlbaum, Hillsdale, pp\u00a0372\u2013379"},{"key":"52_CR3347","first-page":"87","volume-title":"Proceedings 13th international conference on machine learning","author":"R Caruana","year":"1996","unstructured":"Caruana R (1996) Algorithms and applications for multitask learning. In: Proceedings 13th international conference on machine learning. Morgan Kaufmann, San Francisco, pp\u00a087\u201395"},{"key":"52_CR3348","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/09528139408953778","volume":"6","author":"J Case","year":"1994","unstructured":"Case J (1994) Infinitary self-reference in learning theory. J Exp Theor Artif Intell 6:3\u201316","journal-title":"J Exp Theor Artif Intell"},{"issue":"6","key":"52_CR3349","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/S0097539793249694","volume":"28","author":"J Case","year":"1999","unstructured":"Case J (1999) The power of vacillation in language learning. SIAM J Comput 28(6):1941\u20131969","journal-title":"SIAM J Comput"},{"key":"52_CR3350","unstructured":"Case J (2007) Directions for computability theory beyond pure mathematical. In: Gabbay D, Goncharov S, Zakharyaschev M (eds) Mathematical problems from applied logic II. New logics for the twenty-first century. International mathematical series, vol\u00a05. Springer, New York"},{"key":"52_CR3351","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-04414-4_23","volume-title":"20th international conference on algorithmic learning theory (ALT\u201909)","author":"J Case","year":"2009","unstructured":"Case J, K\u00f6tzing T (2009) Difficulties in forcing fairness of polynomial time inductive inference. In: Gavalda R, Lugosi G, Zeugmann T, Zilles S (eds) 20th international conference on algorithmic learning theory (ALT\u201909). LNAI, vol\u00a05809. Springer, Berlin, pp\u00a0263\u2013277"},{"key":"52_CR3352","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Proceedings of the 9th international colloquium on automata, languages and programming","author":"J Case","year":"1982","unstructured":"Case J, Lynes C (1982) Machine inductive inference and language identification. In: Nielsen M, Schmidt E (eds) Proceedings of the 9th international colloquium on automata, languages and programming. Lecture notes in computer science, vol\u00a0140. Springer, Berlin, pp\u00a0107\u2013115"},{"key":"52_CR3353","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J Case","year":"1983","unstructured":"Case J, Smith C (1983) Comparison of identification criteria for machine inductive inference. Theor Comput Sci 25:193\u2013220","journal-title":"Theor Comput Sci"},{"key":"52_CR3354","volume-title":"Weakened refutability for machine learning of higher order definitions 2007","author":"J Case","year":"2007","unstructured":"Case J, Suraj M (2007) Weakened refutability for machine learning of higher order definitions 2007. Working paper for eventual journal submission"},{"key":"52_CR3355","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(00)00274-7","volume":"268","author":"J Case","year":"2001","unstructured":"Case J, Jain S, Kaufmann S, Sharma A, Stephan F (2001) Predictive learning models for concept drift (special issue for ALT\u201998). Theor Comput Sci 268:323\u2013349","journal-title":"Theor Comput Sci"},{"key":"52_CR3356","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/inco.1998.2784","volume":"152","author":"J Case","year":"1999","unstructured":"Case J, Jain S, Lange S, Zeugmann T (1999) Incremental concept learning for bounded data mining. Inf Comput 152:74\u2013110","journal-title":"Inf Comput"},{"issue":"3","key":"52_CR3357","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jcss.2004.10.014","volume":"71","author":"J Case","year":"2005","unstructured":"Case J, Jain S, Montagna F, Simi G, Sorbi A (2005) On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms (special issue for selected learning theory papers from COLT\u201903, FOCS\u201903, and STOC\u201903). J Comput Syst Sci 71(3):308\u2013332","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"52_CR3358","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/050629112","volume":"36","author":"J Case","year":"2006","unstructured":"Case J, Jain S, Martin E, Sharma A, Stephan F (2006) Identifying clusters from positive data. SIAM J Comput 36(1):28\u201355","journal-title":"SIAM J Comput"},{"key":"52_CR3359","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/jcss.1999.1637","volume":"60","author":"J Case","year":"2000","unstructured":"Case J, Jain S, Ott M, Sharma A, Stephan F (2000) Robust learning aided by context (special issue for COLT\u201998). J Comput Syst Sci 60:234\u2013257","journal-title":"J Comput Syst Sci"},{"key":"52_CR3360","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/inco.1996.0064","volume":"128","author":"J Case","year":"1996","unstructured":"Case J, Jain S, Sharma A (1996) Machine induction without revolutionary changes in hypothesis size. Inf Comput 128:73\u201386","journal-title":"Inf Comput"},{"issue":"2","key":"52_CR3361","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jcss.2003.10.005","volume":"69","author":"J Case","year":"2004","unstructured":"Case J, Jain S, Stephan F, Wiehagen R (2004) Robust learning \u2013 rich and poor. J Comput Syst Sci 69(2):123\u2013165","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"52_CR3362","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2946","volume":"174","author":"J Case","year":"2002","unstructured":"Case J, Ott M, Sharma A, Stephan F (2002) Learning to win process-control games watching gamemasters. Inf Comput 174(1):1\u201319","journal-title":"Inf Comput"},{"key":"52_CR3363","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0165-4896(92)90059-E","volume":"24","author":"D Cenzer","year":"1992","unstructured":"Cenzer D, Remmel J (1992) Recursively presented games and strategies. Math Soc Sci 24:117\u2013139","journal-title":"Math Soc Sci"},{"key":"52_CR3364","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(82)80086-7","volume":"52","author":"K Chen","year":"1982","unstructured":"Chen K (1982) Tradeoffs in the inductive inference of nearly minimal size programs. Inf Control 52:68\u201386","journal-title":"Inf Control"},{"key":"52_CR3365","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/IJCNN.1990.137891","volume-title":"IJCNN: international joint conference on neural networks","author":"H de Garis","year":"1990","unstructured":"de Garis H (1990a) Genetic programming: building nanobrains with genetically programmed neural network modules. In: IJCNN: international joint conference on neural networks, vol\u00a03. IEEE Service Center, Piscataway, pp\u00a0511\u2013516"},{"key":"52_CR3366","unstructured":"deGarisH(1990b)Geneticprogramming:modularneuralevolutionforDarwin machines. In: Caudill M (ed) IJCNN-90-WASH DC; international joint conferenceonneuralnetworks,vol\u00a01.LawrenceErlbaumAssociates, Hillsdale, pp\u00a0194\u2013197"},{"key":"52_CR3367","unstructured":"de\u00a0Garis H (1991) Genetic programming: building artificial nervous systems with genetically programmed neural network modules. In: Sou\u0161ek B, The\u00a0IRIS group (eds) Neural and intelligenct systems integeration: fifth and sixth generation integerated reasoning information systems, Chap.\u00a08 Wiley, New York, pp\u00a0207\u2013234"},{"key":"52_CR3368","volume-title":"Proceedings of the ICML-96 pre-conference workshop on learning in context-sensitive domains, Bari","author":"M Devaney","year":"1994","unstructured":"Devaney M, Ram A (1994) Dynamically adjusting concepts to accommodate changing contexts. In: Kubat M, Widmer G (eds) Proceedings of the ICML-96 pre-conference workshop on learning in context-sensitive domains, Bari. Journal submission"},{"issue":"1","key":"52_CR3369","first-page":"51","volume":"18","author":"T Dietterich","year":"1995","unstructured":"Dietterich T, Hild H, Bakiri G (1995) A comparison of ID3 and backpropogation for English text-tospeech mapping. Mach Learn 18(1):51\u201380","journal-title":"Mach Learn"},{"key":"52_CR3370","first-page":"190","volume-title":"Advances in neural information processing systems","author":"S Fahlman","year":"1991","unstructured":"Fahlman S (1991) The recurrent cascade-correlation architecture. In: Lippmann R, Moody J, Touretzky D (eds) Advances in neural information processing systems, vol\u00a03. Morgan Kaufmann Publishers, San Mateo, pp\u00a0190\u2013196"},{"key":"52_CR3371","doi-asserted-by":"crossref","unstructured":"Freivalds R (1975) Minimal G\u00f6del numbers and their identification in the limit. Lecture notes in computer science, vol\u00a032. Springer, Berlin, pp\u00a0219\u2013225","DOI":"10.1007\/3-540-07389-2_199"},{"key":"52_CR3372","series-title":"Lecture notes in artificial intelligence","first-page":"94","volume-title":"Proceedings of the third European conference on computational learning theory (EuroCOLT\u201997)","author":"Y Freund","year":"1997","unstructured":"Freund Y, Mansour Y (1997) Learning under persistent drift. In: Ben-David S, (ed) Proceedings of the third European conference on computational learning theory (EuroCOLT\u201997). Lecture notes in artificial intelligence, vol\u00a01208. Springer, Berlin, pp\u00a094\u2013108"},{"key":"52_CR3373","first-page":"405","volume-title":"Proceedings of the 31st annual symposium on foundations of computer science","author":"M Fulk","year":"1990","unstructured":"Fulk M (1990) Robust separations in inductive inference. In: Proceedings of the 31st annual symposium on foundations of computer science. IEEE Computer Society, St. Louis, pp\u00a0405\u2013410"},{"volume-title":"Can theories be refuted? Essays on the Duhem-Quine thesis","year":"1976","key":"52_CR3374","unstructured":"Harding S (ed) (1976) Can theories be refuted? Essays on the Duhem-Quine thesis. Kluwer Academic Publishers, Dordrecht"},{"key":"52_CR3375","first-page":"27","volume":"14","author":"D Helmbold","year":"1994","unstructured":"Helmbold D, Long P (1994) Tracking drifting concepts by minimizing disagreements. Mach Learn 14:27\u201346","journal-title":"Mach Learn"},{"key":"52_CR3376","volume-title":"Introduction to numerical analysis","author":"F Hildebrand","year":"1956","unstructured":"Hildebrand F (1956) Introduction to numerical analysis. McGraw-Hill, New York"},{"issue":"2","key":"52_CR3377","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/inco.1999.2805","volume":"153","author":"S Jain","year":"1999","unstructured":"Jain S (1999) Robust behaviorally correct learning. Inf Comput 153(2):238\u2013248","journal-title":"Inf Comput"},{"key":"52_CR3378","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/inco.1996.2614","volume":"132","author":"S Jain","year":"1997","unstructured":"Jain S, Sharma A (1997) Elementary formal systems, intrinsic complexity, and procrastination. Inf Comput 132:65\u201384","journal-title":"Inf Comput"},{"issue":"1","key":"52_CR3379","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0304-3975(01)00084-6","volume":"284","author":"S Jain","year":"2002","unstructured":"Jain S, Sharma A (2002) Mind change complexity of learning logic programs. Theor Comput Sci 284(1):143\u2013160","journal-title":"Theor Comput Sci"},{"key":"52_CR3380","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that learn: an introduction to learning theory","author":"S Jain","year":"1999","unstructured":"Jain S, Osherson D, Royer J, Sharma A (1999) Systems that learn: an introduction to learning theory, 2nd edn. MIT Press, Cambridge, MA","edition":"2"},{"issue":"1","key":"52_CR3381","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1006\/jcss.2000.1700","volume":"62","author":"S Jain","year":"2001","unstructured":"Jain S, Smith C, Wiehagen R (2001) Robust learning is rich. J Comput Syst Sci 62(1):178\u2013212","journal-title":"J Comput Syst Sci"},{"key":"52_CR3382","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-59119-2_182","volume-title":"Computational learning theory, second European conference, EuroCOLT\u201995","author":"P Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen P, Mannila H, Ukkonen E (1995) MDL learning of unions of simple pattern languages from positive examples. In: Vit\u00e1nyi P (ed) Computational learning theory, second European conference, EuroCOLT\u201995. Lecture notes in artificial intelligence, vol\u00a0904. Springer, Berlin, pp\u00a0252\u2013260"},{"key":"52_CR3383","doi-asserted-by":"crossref","unstructured":"Kinber E (1977) On a theory of inductive inference. Lecture notes in computer science, vol\u00a056. Springer, Berlin, pp\u00a0435\u2013440","DOI":"10.1007\/3-540-08442-8_112"},{"key":"52_CR3384","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jcss.1995.1005","volume":"50","author":"E Kinber","year":"1995","unstructured":"Kinber E, Smith C, Velauthapillai M, Wiehagen R (1995) On learning multiple concepts in parallel. J Comput Syst Sci 50:41\u201352","journal-title":"J Comput Syst Sci"},{"key":"52_CR3385","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-61863-5_52","volume-title":"Seventh international conference on algorithmic learning theory (ALT\u2019 96)","author":"M Krishna Rao","year":"1996","unstructured":"Krishna Rao M (1996) A class of prolog programs inferable from positive data. In: Arikawa A, Sharma A (eds) Seventh international conference on algorithmic learning theory (ALT\u2019 96). Lecture notes in artificial intelligence, vol\u00a01160. Springer, Berlin, pp\u00a0272\u2013284"},{"key":"52_CR3386","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00271-6","volume":"241","author":"M Krishna Rao","year":"2000","unstructured":"Krishna Rao M (2000) Some classes of prolog programs inferable from positive data (Special Issue for ALT\u201996). Theor Comput Sci A 241:211\u2013234","journal-title":"Theor Comput Sci A"},{"key":"52_CR3387","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-30215-5_7","volume-title":"Algorithmic learning theory: fifteenth international conference (ALT\u20192004)","author":"M Krishna Rao","year":"2004","unstructured":"Krishna Rao M (2004) Inductive inference of term rewriting systems from positive data. In: Ben-David S, Case J, Maruoka A (eds) Algorithmic learning theory: fifteenth international conference (ALT\u20192004). Lecture notes in artificial intelligence, vol\u00a03244. Springer, Berlin, pp\u00a069\u201382"},{"key":"52_CR3388","unstructured":"Krishna\u00a0Rao M (2005) A class of prolog programs with non-linear outputs inferablefrompositivedata.In:JainS,SimonHU,TomitaE(eds)Algorithmic learningtheory:sixteenthinternationalconference(ALT\u20192005).Lecturenotes in artificial intelligence, vol\u00a03734. Springer, Berlin, pp\u00a0312\u2013326"},{"key":"52_CR3389","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-49730-7_11","volume-title":"Ninth international conference on algorithmic learning theory (ALT\u201998)","author":"M Krishna Rao","year":"1998","unstructured":"Krishna Rao M, Sattar A (1998) Learning from entailment of logic programs with local variables. In: Richter M, Smith C, Wiehagen R, Zeugmann T (eds) Ninth international conference on algorithmic learning theory (ALT\u201998). Lecture notes in artificial intelligence, vol\u00a01501. Springer, Berlin, pp\u00a0143\u2013157"},{"key":"52_CR3390","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1080\/01969729208927471","volume":"23","author":"M Kubat","year":"1992","unstructured":"Kubat M (1992) A machine learning based approach to load balancing in computer networks. Cybern Syst 23:389\u2013400","journal-title":"Cybern Syst"},{"key":"52_CR3391","series-title":"Proceedings of the ninth annual conference on computational learning theory, Desenzano del Garda","volume-title":"Learning branches and learning to win closed recursive games","author":"M Kummer","year":"1996","unstructured":"Kummer M, Ott M (1996) Learning branches and learning to win closed recursive games. In: Proceedings of the ninth annual conference on computational learning theory, Desenzano del Garda. ACM Press, New York"},{"key":"52_CR3392","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S Lange","year":"1991","unstructured":"Lange S, Wiehagen R (1991) Polynomial time inference of arbitrary pattern languages. New Gener Comput 8:361\u2013370","journal-title":"New Gener Comput"},{"key":"52_CR3393","volume-title":"Inductive logic programming: techniques and applications","author":"N Lavra\u010d","year":"1994","unstructured":"Lavra\u010d N, D\u017eeroski S (1994) Inductive logic programming: techniques and applications. Ellis Horwood, New York"},{"key":"52_CR3394","doi-asserted-by":"crossref","unstructured":"Maler O, Pnueli A, Sifakis J (1995) On the synthesis of discrete controllers for timed systems. In: Proceedings of the annual symposium on the theoretical aspects of computer science. LNCS, vol\u00a0900. Springer, Berlin, pp\u00a0229\u2013242","DOI":"10.1007\/3-540-59042-0_76"},{"key":"52_CR3395","unstructured":"Matwin S, Kubat M (1996) The role of context in concept learning. In: Kubat M, Widmer G (eds) Proceedings of the ICML-96 pre-conference workshop on learning in context-sensitive domains, Bari, pp\u00a01\u20135"},{"key":"52_CR3396","doi-asserted-by":"crossref","unstructured":"Maye A, Hsieh C, Sugihara G, Brembs B (2007) Order in spontaneous behavior. PLoS One, May 2007. http:\/\/brembs.net\/spontaneous\/","DOI":"10.4016\/726.01"},{"issue":"1\u20133","key":"52_CR3397","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/B:MACH.0000033117.77257.41","volume":"56","author":"N Mishra","year":"2004","unstructured":"Mishra N, Ron D, Swaminathan R (2004) A new conceptual clustering framework. Mach Learn 56(1\u20133):115\u2013151","journal-title":"Mach Learn"},{"key":"52_CR3398","volume-title":"Machine learning","author":"T Mitchell","year":"1997","unstructured":"Mitchell T (1997) Machine learning. McGraw Hill, New York"},{"key":"52_CR3399","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/176789.176798","volume":"37","author":"T Mitchell","year":"1994","unstructured":"Mitchell T, Caruana R, Freitag D, McDermott J, Zabowski D (1994) Experience with a learning, personal assistant. Commun ACM 37:80\u201391","journal-title":"Commun ACM"},{"key":"52_CR3400","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1005182121401","volume":"118","author":"F Montagna","year":"1999","unstructured":"Montagna F, Osherson D (1999) Learning to coordinate: a recursion theoretic perspective. Synthese 118:363\u2013382","journal-title":"Synthese"},{"issue":"20","key":"52_CR3401","first-page":"669","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton S, De Raedt L (1994) Inductive logic programming: theory and methods. J Logic Program 19\/20:669\u2013679","journal-title":"J Logic Program"},{"key":"52_CR3402","volume-title":"Classical recursion theory","author":"P Odifreddi","year":"1999","unstructured":"Odifreddi P (1999) Classical recursion theory, vol\u00a0II. Elsivier, Amsterdam"},{"key":"52_CR3403","volume-title":"Systems that learn: an introduction to learning theory for cognitive and computer scientists","author":"D Osherson","year":"1986","unstructured":"Osherson D, Stob M, Weinstein S (1986) Systems that learn: an introduction to learning theory for cognitive and computer scientists. MIT Press, Cambridge, MA"},{"issue":"1","key":"52_CR3404","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0304-3975(01)00086-X","volume":"284","author":"M Ott","year":"2002","unstructured":"Ott M, Stephan F (2002) Avoiding coding tricks by hyperrobust learning. Theor Comput Sci 284(1):161\u2013180","journal-title":"Theor Comput Sci"},{"key":"52_CR3405","first-page":"371","volume":"2","author":"L Pitt","year":"1988","unstructured":"Pitt L, Reinke R (1988) Criteria for polynomial-time (conceptual) clustering. Mach Learn 2:371\u2013396","journal-title":"Mach Learn"},{"key":"52_CR3406","volume-title":"Conjectures and refutations: the growth of scientific knowledge","author":"K Popper","year":"1992","unstructured":"Popper K (1992) Conjectures and refutations: the growth of scientific knowledge. Basic Books, New York"},{"key":"52_CR3407","unstructured":"Pratt L, Mostow J, Kamm C (1991) Direct transfer of learned information among neural networks. In: Proceedings of the 9th national conference on artificial intelligence (AAAI-91), Anaheim. AAAI press, Menlo Park"},{"key":"52_CR3408","unstructured":"Rogers H (1987) Theory of recursive functions and effective computability. McGraw Hill, New York. (Reprinted, MIT Press, 1987)"},{"key":"52_CR3409","first-page":"46","volume":"54","author":"A Salomaa","year":"1994","unstructured":"Salomaa A (1994a) Patterns (The formal language theory column). EATCS Bull 54:46\u201362","journal-title":"EATCS Bull"},{"key":"52_CR3410","first-page":"144","volume":"55","author":"A Salomaa","year":"1994","unstructured":"Salomaa A (1994b) Return to patterns (The formal language theory column). EATCS Bull 55:144\u2013157","journal-title":"EATCS Bull"},{"key":"52_CR3411","unstructured":"Sejnowski T, Rosenberg C (1986) NETtalk: a parallel network that learns to read aloud. Technical report JHU-EECS-86-01, Johns Hopkins University"},{"key":"52_CR3412","first-page":"2009","volume":"35","author":"S Shimozono","year":"1994","unstructured":"Shimozono S, Shinohara A, Shinohara T, Miyano S, Kuhara S, Arikawa S (1994) Knowledge acquisition from amino acid sequences by machine learning system BONSAI. Trans Inf Process Soc Jpn 35:2009\u20132018","journal-title":"Trans Inf Process Soc Jpn"},{"key":"52_CR3413","first-page":"83","volume":"20","author":"T Shinohara","year":"1983","unstructured":"Shinohara T (1983) Inferring unions of two pattern languages. Bull Inf Cybern 20:83\u201388","journal-title":"Bull Inf Cybern"},{"key":"52_CR3414","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-60217-8_13","volume-title":"Algorithmic learning for knowledge-based systems","author":"T Shinohara","year":"1995","unstructured":"Shinohara T, Arikawa A (1995) Pattern inference. In: Jantke KP, Lange S (eds) Algorithmic learning for knowledge-based systems. Lecture notes in artificial intelligence, vol\u00a0961. Springer, Berlin, pp\u00a0259\u2013291"},{"key":"52_CR3415","doi-asserted-by":"crossref","unstructured":"Smullyan R (1961) Theory of formal systems. Annals of mathematics studies, vol\u00a047). Princeton University Press, Princeton","DOI":"10.1515\/9781400882007"},{"key":"52_CR3416","volume-title":"Machine reconstruction of human control strategies. Frontiers in artificial intelligence and applications","author":"D \u0160uc","year":"2003","unstructured":"\u0160uc D (2003) Machine reconstruction of human control strategies. Frontiers in artificial intelligence and applications, vol\u00a099. IOS Press, Amsterdam"},{"key":"52_CR3417","doi-asserted-by":"crossref","unstructured":"Thomas W (1995) On the synthesis of strategies in infinite games. In: Proceedings of the annual symposium on the theoretical aspects of computer science. LNCS, vol\u00a0900. Springer, Berlin, pp\u00a01\u201313","DOI":"10.1007\/3-540-59042-0_57"},{"key":"52_CR3418","volume-title":"Is learning the n-th thing any easier than learning the first? In: Advances in neural information processing systems","author":"S Thrun","year":"1996","unstructured":"Thrun S (1996) Is learning the n-th thing any easier than learning the first? In: Advances in neural information processing systems, vol\u00a08. Morgan Kaufmann, San Mateo"},{"key":"52_CR3419","first-page":"489","volume-title":"Proceedings of the thirteenth international conference on machine learning (ICML-96)","author":"S Thrun","year":"1996","unstructured":"Thrun S, Sullivan J (1996) Discovering structure in multiple learning tasks: the TC algorithm. In: Proceedings of the thirteenth international conference on machine learning (ICML-96). Morgan Kaufmann, San Francisco, pp\u00a0489\u2013497"},{"key":"52_CR3420","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/IJCNN.1989.118690","volume-title":"IJCNN-89-WASHINGTON DC: international joint conference on neural networks, 18\u201322 June","author":"F Tsung","year":"1989","unstructured":"Tsung F, Cottrell G (1989) A sequential adder using recurrent networks. In: IJCNN-89-WASHINGTON DC: international joint conference on neural networks, 18\u201322 June, vol\u00a02. IEEE Service Center, Piscataway, pp\u00a0133\u2013139"},{"key":"52_CR3421","first-page":"417","volume-title":"Proceedings of the 1988 connectionist models summer school","author":"A Waibel","year":"1989","unstructured":"Waibel A (1989a) Connectionist glue: modular design of neural speech systems. In: Touretzky D, Hinton G, Sejnowski T (eds) Proceedings of the 1988 connectionist models summer school. Morgan Kaufmann, San Mateo, pp\u00a0417\u2013425"},{"key":"52_CR3422","first-page":"215","volume-title":"Advances in neural information processing systems I","author":"A Waibel","year":"1989","unstructured":"Waibel A (1989b) Consonant recognition by modular construction of large phonemic time-delay neural networks. In: Touretzky DS (ed) Advances in neural information processing systems I. Morgan Kaufmann, San Mateo, pp\u00a0215\u2013223"},{"key":"52_CR3423","unstructured":"Wallace C (2005) Statistical and inductive inference by minimum message length. Information science and statistics. Springer, New York. Posthumously published"},{"key":"52_CR3424","unstructured":"Wallace C, Dowe D (1999) Minimum message length and Kolmogorov complexity (special issue on Kolmogorov complexity). Comput J 42(4):123\u2013155. http:\/\/comjnl.oxfordjournals.org\/cgi\/reprint\/42\/4\/270"},{"key":"52_CR3425","first-page":"69","volume":"23","author":"G Widmer","year":"1996","unstructured":"Widmer G, Kubat M (1996) Learning in the presence of concept drift and hidden contexts. Mach Learn 23:69\u2013101","journal-title":"Mach Learn"},{"key":"52_CR3426","first-page":"93","volume":"12","author":"R Wiehagen","year":"1976","unstructured":"Wiehagen R (1976) Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Electronische Informationverarbeitung und Kybernetik 12: 93\u201399","journal-title":"Electronische Informationverarbeitung und Kybernetik"},{"key":"52_CR3427","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/09528139408953785","volume":"6","author":"R Wiehagen","year":"1994","unstructured":"Wiehagen R, Zeugmann T (1994) Ignoring data may be the only way to learn efficiently. J Exp Theor Artif Intell 6:131\u2013144","journal-title":"J Exp Theor Artif Intell"},{"key":"52_CR3428","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/B978-0-08-094829-4.50026-X","volume-title":"Proceedings of the second annual workshop on computational learning theory","author":"K Wright","year":"1989","unstructured":"Wright K (1989) Identification of unions of languages drawn from an identifiable class. In: Rivest R, Haussler D, Warmuth M (eds) Proceedings of the second annual workshop on computational learning theory, Santa Cruz. Morgan Kaufmann Publishers, San Mateo, pp\u00a0328\u2013333"},{"key":"52_CR3429","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2317-5","volume-title":"Concept formation and knowledge revision","author":"S Wrobel","year":"1994","unstructured":"Wrobel S (1994) Concept formation and knowledge revision. Kluwer Academic Publishers, Dordrecht"},{"key":"52_CR3430","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-18081-8_96","volume-title":"Proceedings of the international workshop on analogical and inductive inference","author":"T Zeugmann","year":"1986","unstructured":"Zeugmann T (1986) On B\u0101rzdi\u0146\u0161\u2019 conjecture. In: Jantke KP (ed) Proceedings of the international workshop on analogical and inductive inference. Lecture notes in computer science, vol\u00a0265. Springer, Berlin, pp\u00a0220\u2013227"},{"key":"52_CR3431","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1018964207937","volume":"23","author":"T Zeugmann","year":"1998","unstructured":"Zeugmann T (1998) Lange and Wiehagen\u2019s pattern language learning algorithm: an average case analysis with respect to its total learning time. Ann Math Artif Intell 23:117\u2013145","journal-title":"Ann Math Artif Intell"}],"container-title":["Encyclopedia of Machine Learning and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4899-7687-1_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T13:32:50Z","timestamp":1658928770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4899-7687-1_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9781489976857","9781489976871"],"references-count":103,"URL":"https:\/\/doi.org\/10.1007\/978-1-4899-7687-1_52","relation":{},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}