{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:17:55Z","timestamp":1743020275995,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":102,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307688"},{"type":"electronic","value":"9780387301648"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-387-30164-8_160","type":"book-chapter","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T17:42:10Z","timestamp":1293644530000},"page":"210-219","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":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"160_CR1_160","doi-asserted-by":"crossref","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. Journal of Symbolic Logic, 69, 287\u2013328.","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"160_CR2_160","doi-asserted-by":"crossref","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. Theoretical Computer Science, 66(3), 255\u2013272.","journal-title":"Theoretical Computer Science"},{"key":"160_CR3_160","doi-asserted-by":"crossref","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. Journal of Computer and System Sciences, 21, 46\u201362.","journal-title":"Journal of Computer and System Sciences"},{"key":"160_CR4_160","doi-asserted-by":"crossref","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. Theoretical Computer Science, 95, 97\u2013113.","journal-title":"Theoretical Computer Science"},{"key":"160_CR5_160","volume-title":"Machine intelligence 15","author":"M Bain","year":"1999","unstructured":"Bain, M., & Sammut, C. (1999). A framework for behavioural cloning. In K.\u00a0Furakawa, S.\u00a0Muggleton, & D.\u00a0Michie (Eds.), Machine intelligence 15. Oxford: Oxford University Press."},{"key":"160_CR6_160","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":"160_CR7_160","doi-asserted-by":"crossref","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, Italy. New York: ACM Press.","DOI":"10.1145\/238061.238080"},{"key":"160_CR8_160","doi-asserted-by":"crossref","unstructured":"Bartlmae, K., Gutjahr, S., & Nakhaeizadeh, G. (1997). Incorporating prior knowledge about financial markets through neural multitask learning. In Proceedings of the fifth international conference on neural networks in the capital markets.","DOI":"10.1007\/978-1-4615-5625-1_34"},{"key":"160_CR9_160","unstructured":"B\u0101rzdi\u0146\u0161, J. (1974a). Inductive inference of automata, functions and programs. In Proceedings of the international congress of mathematicians, Vancouver (pp. 771\u2013776)."},{"key":"160_CR10_160","unstructured":"B\u0101rzdi\u0146\u0161, J. (1974b). Two theorems on the limiting synthesis of functions. In Theory of algorithms and programs (Vol. 210, pp.\u00a082\u201388). Latvian State University, Riga."},{"key":"160_CR11_160","doi-asserted-by":"crossref","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. Information and Control, 28, 125\u2013155.","journal-title":"Information and Control"},{"key":"160_CR12_160","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, Pennsylvania, (pp. 231\u2013242). New York: ACM Press."},{"issue":"11","key":"160_CR13_160","doi-asserted-by":"crossref","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. Communications of the ACM, 38(11), 65\u201370.","journal-title":"Communications of the ACM"},{"key":"160_CR14_160","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 R. S. Michalski, I.\u00a0Bratko, & M.\u00a0Kubat (Eds.), Machine learning and data mining: Methods and applications, (pp. 335\u2013351). New York: Wiley."},{"key":"160_CR15_160","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. 1178, pp. 95\u2013104), Berlin: Springer-Verlag.","DOI":"10.1007\/BFb0009485"},{"issue":"2","key":"160_CR16_160","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123\u2013140.","journal-title":"Machine Learning"},{"issue":"1","key":"160_CR17_160","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5\u201332.","journal-title":"Machine Learning"},{"key":"160_CR18_160","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 (pp. 372\u2013379). NJ: Lawrence Erlbaum."},{"key":"160_CR19_160","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 (pp. 87\u201395). San Francisco, CA: Morgan Kaufmann."},{"key":"160_CR20_160","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/09528139408953778","volume":"6","author":"J Case","year":"1994","unstructured":"Case, J. (1994). Infinitary self-reference in learning theory. Journal of Experimental and Theoretical Artificial Intelligence, 6, 3\u201316.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"issue":"6","key":"160_CR21_160","doi-asserted-by":"crossref","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 Journal on Computing, 28(6), 1941\u20131969.","journal-title":"SIAM Journal on Computing"},{"key":"160_CR22_160","unstructured":"Case, J. (2007). Directions for computability theory beyond pure mathematical. In D.\u00a0Gabbay, S.\u00a0Goncharov, & M.\u00a0Zakharyaschev (Eds.), Mathematical problems from applied logic II. New logics for the XXIst century, International Mathematical Series, (Vol.\u00a05). New York: Springer."},{"key":"160_CR23_160","first-page":"107","volume-title":"Proceedings of the 9th International Colloquium on Automata, Languages and Programming, Lecture notes in computer science","author":"J Case","year":"1982","unstructured":"Case, J., & Lynes, C. (1982). Machine inductive inference and language identification. In M.\u00a0Nielsen & E.\u00a0Schmidt, (Eds.), Proceedings of the 9th International Colloquium on Automata, Languages and Programming, Lecture notes in computer science, (Vol. 140, pp. 107\u2013115). Berlin: Springer-Verlag."},{"key":"160_CR24_160","doi-asserted-by":"crossref","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. Theoretical Computer Science, 25, 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"160_CR25_160","unstructured":"Case, J., & Suraj, M. (2010). Weakened refutability for machine learning of higher order definitions, 2010. (Working paper for eventual journal submission)."},{"key":"160_CR26_160","doi-asserted-by":"crossref","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). Theoretical Computer Science, 268, 323\u2013349.","journal-title":"Theoretical Computer Science"},{"key":"160_CR27_160","doi-asserted-by":"crossref","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. Information and Computation, 152, 74\u2013110.","journal-title":"Information and Computation"},{"issue":"3","key":"160_CR28_160","doi-asserted-by":"crossref","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). Journal of Computer and System Sciences, 71(3), 308\u2013332.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"160_CR29_160","doi-asserted-by":"crossref","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 Journal on Computing, 36(1), 28\u201355.","journal-title":"SIAM Journal on Computing"},{"key":"160_CR30_160","doi-asserted-by":"crossref","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). Journal of Computer and System Sciences, 60, 234\u2013257.","journal-title":"Journal of Computer and System Sciences"},{"key":"160_CR31_160","doi-asserted-by":"crossref","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. Information and Computation, 128, 73\u201386.","journal-title":"Information and Computation"},{"issue":"2","key":"160_CR32_160","doi-asserted-by":"crossref","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\u00a0\u2013 rich and poor. Journal of Computer and System Sciences, 69(2), 123\u2013165.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"160_CR33_160","doi-asserted-by":"crossref","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. Information and Computation, 174(1), 1\u201319.","journal-title":"Information and Computation"},{"key":"160_CR34_160","doi-asserted-by":"crossref","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. Mathematical Social Sciences, 24, 117\u2013139.","journal-title":"Mathematical Social Sciences"},{"key":"160_CR35_160","doi-asserted-by":"crossref","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. Information and Control, 52, 68\u201386.","journal-title":"Information and Control"},{"key":"160_CR36_160","doi-asserted-by":"crossref","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, pp. 511\u2013516). Piscataway, NJ: IEEE Service Center.","DOI":"10.1109\/IJCNN.1990.137891"},{"key":"160_CR37_160","unstructured":"deGaris,H.(1990b).Geneticprogramming:ModularneuralevolutionforDarwin machines. In M. Caudill (Ed.), IJCNN-90-WASH DC; International joint conferenceonneuralnetworks(Vol.\u00a01,pp.194\u2013197).Hillsdale,NJ:Lawrence Erlbaum Associates."},{"key":"160_CR38_160","unstructured":"de\u00a0Garis, H. (1991). Genetic programming: Building artificial nervous systems with genetically programmed neural network modules. In B. Sou\u0161ek, & The\u00a0IRIS group (Eds.), Neural and intelligenct systems integeration: Fifth and sixth generation integerated reasoning information systems (Chap.\u00a08, pp. 207\u2013234). New York: Wiley."},{"key":"160_CR39_160","volume-title":"Proceedings of the ICML-96 Pre-conference workshop on learning in context-sensitive domains","author":"M Devaney","year":"1994","unstructured":"Devaney, M., & Ram, A. (1994). Dynamically adjusting concepts to accommodate changing contexts. In M.\u00a0Kubat, G.\u00a0Widmer (Eds.), Proceedings of the ICML-96 Pre-conference workshop on learning in context-sensitive domains, Bari, Italy (Journal submission)."},{"issue":"1","key":"160_CR40_160","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. Machine Learning, 18(1), 51\u201380.","journal-title":"Machine Learning"},{"key":"160_CR41_160","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 R.\u00a0Lippmann, J.\u00a0Moody, and D.\u00a0Touretzky (Eds.), Advances in neural information processing systems (Vol.\u00a03, pp. 190\u2013196). San Mateo, CA: Morgan Kaufmann Publishers."},{"key":"160_CR42_160","doi-asserted-by":"crossref","unstructured":"Freivalds, R. (1975). Minimal G\u00f6del numbers and their identification in the limit. In Lecture notes in computer science (Vol. 32, pp. 219\u2013225). Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-07389-2_199"},{"key":"160_CR43_160","first-page":"94","volume-title":"Proceedings of the third European conference on computational learning theory (EuroCOLT\u201997), Lecture notes in artificial intelligence","author":"Y Freund","year":"1997","unstructured":"Freund, Y., & Mansour, Y. (1997). Learning under persistent drift. In S.\u00a0Ben-David, (Ed.), Proceedings of the third European conference on computational learning theory (EuroCOLT\u201997), Lecture notes in artificial intelligence, (Vol. 1208, pp. 94\u2013108). Berlin: Springer-Verlag."},{"key":"160_CR44_160","unstructured":"Fulk, M. (1990). Robust separations in inductive inference. In Proceedings of the 31st annual symposium on foundations of computer science (pp. 405\u2013410). St. Louis, Missouri. Washington, DC: IEEE Computer Society."},{"volume-title":"Can theories be refuted? Essays on the Duhem-Quine thesis","year":"1976","key":"160_CR45_160","unstructured":"Harding, S. (Ed.). (1976). Can theories be refuted? Essays on the Duhem-Quine thesis. Dordrecht: Kluwer Academic Publishers."},{"key":"160_CR46_160","first-page":"27","volume":"14","author":"D Helmbold","year":"1994","unstructured":"Helmbold, D., & Long, P. (1994). Tracking drifting concepts by minimizing disagreements. Machine Learning, 14, 27\u201346.","journal-title":"Machine Learning"},{"key":"160_CR47_160","volume-title":"Introduction to numerical analysis","author":"F Hildebrand","year":"1956","unstructured":"Hildebrand, F. (1956). Introduction to numerical analysis. New York: McGraw-Hill."},{"issue":"2","key":"160_CR48_160","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/inco.1999.2805","volume":"153","author":"S Jain","year":"1999","unstructured":"Jain, S. (1999). Robust behaviorally correct learning. Information and Computation, 153(2), 238\u2013248.","journal-title":"Information and Computation"},{"key":"160_CR49_160","doi-asserted-by":"crossref","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. Information and Computation, 132, 65\u201384.","journal-title":"Information and Computation"},{"issue":"1","key":"160_CR50_160","doi-asserted-by":"crossref","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. Theoretical Computer Science, 284(1), 143\u2013160.","journal-title":"Theoretical Computer Science"},{"key":"160_CR51_160","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 ed.). Cambridge, MA: MIT Press.","edition":"2"},{"issue":"1","key":"160_CR52_160","doi-asserted-by":"crossref","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. Journal of Computer and System Sciences, 62(1), 178\u2013212.","journal-title":"Journal of Computer and System Sciences"},{"key":"160_CR53_160","first-page":"252","volume-title":"Computational learning theory, second European conference, EuroCOLT\u201995, Lecture notes in artificial intelligence","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 P. Vit\u00e1nyi (Ed.), Computational learning theory, second European conference, EuroCOLT\u201995, Lecture notes in artificial intelligence, (Vol. 904, pp. 252\u2013260). Berlin: Springer-Verlag."},{"key":"160_CR54_160","doi-asserted-by":"crossref","unstructured":"Kinber, E. (1977). On a theory of inductive inference. In Lecture notes in computer science (Vol. 56, pp. 435\u2013440). Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-08442-8_112"},{"key":"160_CR55_160","doi-asserted-by":"crossref","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. Journal of Computer and System Sciences, 50, 41\u201352.","journal-title":"Journal of Computer and System Sciences"},{"key":"160_CR56_160","first-page":"272","volume-title":"Seventh international conference on algorithmic learning theory (ALT\u2019 96), Lecture notes in artificial intelligence","author":"M Krishna Rao","year":"1996","unstructured":"Krishna\u00a0Rao, M. (1996). A class of prolog programs inferable from positive data. In A.\u00a0Arikawa & A.\u00a0Sharma (Eds.), Seventh international conference on algorithmic learning theory (ALT\u2019 96), Lecture notes in artificial intelligence (Vol. 1160, pp. 272\u2013284). Berlin: Springer-Verlag."},{"key":"160_CR57_160","doi-asserted-by":"crossref","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). Theoretical Computer Science A, 241, 211\u2013234.","journal-title":"Theoretical Computer Science A"},{"key":"160_CR58_160","first-page":"69","volume-title":"Algorithmic learning theory: Fifteenth international conference (ALT\u2019 2004), Lecture notes in artificial intelligence","author":"M Krishna Rao","year":"2004","unstructured":"Krishna\u00a0Rao, M. (2004). Inductive inference of term rewriting systems from positive data. In S.\u00a0Ben-David, J.\u00a0Case, & A.\u00a0Maruoka (Eds.), Algorithmic learning theory: Fifteenth international conference (ALT\u2019 2004), Lecture notes in artificial intelligence (Vol. 3244, pp. 69\u201382). Berlin: Springer-Verlag."},{"key":"160_CR59_160","first-page":"312","volume-title":"Algorithmiclearningtheory:Sixteenthinternationalconference(ALT\u20192005), Lecture notes in artificial intelligence","author":"M Krishna Rao","year":"2005","unstructured":"Krishna\u00a0Rao, M. (2005). A class of prolog programs with non-linear outputs inferable from positive data. In S.\u00a0Jain, H.\u00a0U. Simon, & E.\u00a0Tomita (Eds.), Algorithmiclearningtheory:Sixteenthinternationalconference(ALT\u20192005), Lecture notes in artificial intelligence, (Vol. 3734, pp. 312\u2013326). Berlin: Springer-Verlag."},{"key":"160_CR60_160","first-page":"143","volume-title":"Ninth international conference on algorithmic learning theory (ALT\u2019 98), Lecture notes in artificial intelligence","author":"M Krishna Rao","year":"1998","unstructured":"Krishna\u00a0Rao, M., & Sattar, A. (1998). Learning from entailment of logic programs with local variables. In M.\u00a0Richter, C.\u00a0Smith, R.\u00a0Wiehagen, & T.\u00a0Zeugmann (Eds.), Ninth international conference on algorithmic learning theory (ALT\u2019 98), Lecture notes in artificial intelligence (Vol. 1501, pp. 143\u2013157). Berlin: Springer-Verlag."},{"key":"160_CR61_160","doi-asserted-by":"crossref","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. Cybernetics and Systems, 23, 389\u2013400.","journal-title":"Cybernetics and Systems"},{"key":"160_CR62_160","doi-asserted-by":"crossref","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, Italy. New York: ACM Press.","DOI":"10.1145\/238061.238119"},{"key":"160_CR63_160","doi-asserted-by":"crossref","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 Generation Computing, 8, 361\u2013370.","journal-title":"New Generation Computing"},{"key":"160_CR64_160","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. New York: Ellis Horwood."},{"key":"160_CR65_160","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. 900, pp. 229\u2013242). Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-59042-0_76"},{"key":"160_CR66_160","first-page":"1","volume-title":"Proceedings of the ICML-96 pre-conference workshop on learning in context-sensitive domains","author":"S Matwin","year":"1996","unstructured":"Matwin, S., & Kubat, M. (1996). The role of context in concept learning. In M.\u00a0Kubat & G.\u00a0Widmer (Eds.), Proceedings of the ICML-96 pre-conference workshop on learning in context-sensitive domains, Bari, Italy, (pp. 1\u20135)."},{"key":"160_CR67_160","doi-asserted-by":"crossref","unstructured":"Maye, A., Hsieh, C., Sugihara, G., & Brembs, B. (2007). Order in spontaneous behavior. PLoS One, May, 2007. See: http:\/\/brembs.net\/spontaneous\/","DOI":"10.4016\/726.01"},{"issue":"1\u20133","key":"160_CR68_160","doi-asserted-by":"crossref","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. Machine Learning, 56(1\u20133), 115\u2013151.","journal-title":"Machine Learning"},{"key":"160_CR69_160","volume-title":"Machine learning","author":"T Mitchell","year":"1997","unstructured":"Mitchell, T. (1997). Machine learning. New York: McGraw Hill."},{"key":"160_CR70_160","doi-asserted-by":"crossref","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. Communications of the ACM, 37, 80\u201391.","journal-title":"Communications of the ACM"},{"key":"160_CR71_160","doi-asserted-by":"crossref","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"},{"key":"160_CR72_160","doi-asserted-by":"crossref","unstructured":"Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 19\/20, 669\u2013679.","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"160_CR73_160","unstructured":"Odifreddi, P. (1999). Classical recursion theory (Vol.\u00a0II). Amsterdam: Elsivier."},{"key":"160_CR74_160","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. Cambridge, MA: MIT Press."},{"issue":"1","key":"160_CR75_160","doi-asserted-by":"crossref","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. Theoretical Computer Science, 284(1), 161\u2013180.","journal-title":"Theoretical Computer Science"},{"key":"160_CR76_160","first-page":"371","volume":"2","author":"L Pitt","year":"1988","unstructured":"Pitt, L., & Reinke, R. (1988). Criteria for polynomial-time (conceptual) clustering. Machine Learning, 2, 371\u2013396.","journal-title":"Machine Learning"},{"key":"160_CR77_160","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. New York: Basic Books."},{"key":"160_CR78_160","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, California. Menlo Park, CA: AAAI press."},{"key":"160_CR79_160","unstructured":"Rogers, H. (1987). Theory of recursive functions and effective computability. New York: McGraw Hill (Reprinted, MIT Press, 1987)."},{"key":"160_CR80_160","first-page":"46","volume":"54","author":"A Salomaa","year":"1994","unstructured":"Salomaa, A. (1994a). Patterns (The formal language theory column). EATCS Bulletin, 54, 46\u201362.","journal-title":"EATCS Bulletin"},{"key":"160_CR81_160","first-page":"144","volume":"55","author":"A Salomaa","year":"1994","unstructured":"Salomaa, A. (1994b). Return to patterns (The formal language theory column). EATCS Bulletin, 55, 144\u2013157.","journal-title":"EATCS Bulletin"},{"key":"160_CR82_160","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":"160_CR83_160","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. Transactions of Information Processing Society of Japan, 35, 2009\u20132018.","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"160_CR84_160","doi-asserted-by":"crossref","first-page":"83","DOI":"10.5109\/13347","volume":"20","author":"T Shinohara","year":"1983","unstructured":"Shinohara, T. (1983). Inferring unions of two pattern languages. Bulletin of Informatics and Cybernetics, 20, 83\u201388.","journal-title":"Bulletin of Informatics and Cybernetics"},{"key":"160_CR85_160","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","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 K.\u00a0P. Jantke & S. Lange (Eds.), Algorithmic learning for knowledge-based systems, Lecture notes in artificial intelligence (Vol. 961, pp. 259\u2013291). Berlin: Springer-Verlag."},{"key":"160_CR86_160","doi-asserted-by":"crossref","unstructured":"Smullyan, R. (1961). Theory of formal systems. In Annals of Mathematics Studies (Vol. 47). Princeton, NJ: Princeton University Press.","DOI":"10.1515\/9781400882007"},{"key":"160_CR87_160","unstructured":"\u0160uc, D. (2003). Machine reconstruction of human control strategies. Frontiers in artificial intelligence and applications (Vol. 99). Amsterdam: IOS Press."},{"key":"160_CR88_160","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. 900, pp. 1\u201313). Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-59042-0_57"},{"key":"160_CR89_160","volume-title":"Is learning the n-th thing any easier than learning the first? In Advances in neural information processing systems, 8","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, 8. San Mateo, CA: Morgan Kaufmann."},{"key":"160_CR90_160","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) (pp. 489\u2013497). San Francisco, CA: Morgan Kaufmann."},{"key":"160_CR91_160","doi-asserted-by":"crossref","unstructured":"Tsung, F., & Cottrell, G. (1989). A sequential adder using recurrent networks. In IJCNN-89-WASHINGTON DC: International joint conference on neural networks June 18\u201322 (Vol. 2, pp. 133\u2013139). Piscataway, NJ: IEEE Service Center.","DOI":"10.1109\/IJCNN.1989.118690"},{"key":"160_CR92_160","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 D. Touretzky, G. Hinton, & T. Sejnowski (Eds.), Proceedings of the 1988 connectionist models summer school (pp. 417\u2013425). San Mateo, CA: Morgan Kaufmann."},{"key":"160_CR93_160","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 D.\u00a0S. Touretzky (Ed.), Advances in neural information processing systems I (pp. 215\u2013223). San Mateo, CA: Morgan Kaufmann."},{"key":"160_CR94_160","unstructured":"Wallace, C. (2005). Statistical and inductive inference by minimum message length. (Information Science and Statistics). New York: Springer (Posthumously published)."},{"key":"160_CR95_160","doi-asserted-by":"crossref","unstructured":"Wallace, C., & Dowe, D. (1999). Minimum message length and kolmogorov complexity (Special Issue on Kolmogorov Complexity). Computer Journal, 42(4), 123\u2013155. http:\/\/comjnl.oxfordjournals.org\/cgi\/reprint\/42\/4\/270.","DOI":"10.1093\/comjnl\/42.4.270"},{"key":"160_CR96_160","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. Machine Learning, 23, 69\u2013101.","journal-title":"Machine Learning"},{"key":"160_CR97_160","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":"160_CR98_160","doi-asserted-by":"crossref","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. Journal of Experimental and Theoretical Artificial Intelligence, 6, 131\u2013144.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"160_CR99_160","doi-asserted-by":"crossref","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, Santa Cruz, California","author":"K Wright","year":"1989","unstructured":"Wright, K. (1989). Identification of unions of languages drawn from an identifiable class. In R.\u00a0Rivest, D.\u00a0Haussler, & M.\u00a0Warmuth (Eds.), Proceedings of the second annual workshop on computational learning theory, Santa Cruz, California, (pp. 328\u2013333). San Mateo, CA: Morgan Kaufmann Publishers."},{"key":"160_CR100_160","doi-asserted-by":"crossref","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. Dordrecht: Kluwer Academic Publishers."},{"key":"160_CR101_160","first-page":"220","volume-title":"Analogical and inductive inference, Proceedings of the international workshop, Lecture notes in computer science","author":"T Zeugmann","year":"1986","unstructured":"Zeugmann, T. (1986). On B\u0101rzdi\u0146\u0161\u2019 conjecture. In K.\u00a0P. Jantke (Ed.), Analogical and inductive inference, Proceedings of the international workshop, Lecture notes in computer science, (Vol. 265, pp. 220\u2013227). Berlin: Springer-Verlag."},{"key":"160_CR102_160","doi-asserted-by":"crossref","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. Annals of Mathematics and Artificial Intelligence, 23, 117\u2013145.","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Encyclopedia of Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30164-8_160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T03:12:20Z","timestamp":1703214740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30164-8_160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387307688","9780387301648"],"references-count":102,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8_160","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}