메뉴 건너뛰기




Volumn 62, Issue 3, 2001, Pages 413-441

Synthesizing learners tolerating computable noisy data

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; LEARNING SYSTEMS; PROCEDURE ORIENTED LANGUAGES; RECURSIVE FUNCTIONS; SET THEORY; SPURIOUS SIGNAL NOISE; THEOREM PROVING;

EID: 0035340021     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1736     Document Type: Article
Times cited : (2)

References (63)
  • 1
    • 0000106131 scopus 로고
    • Inductive inference of formal languages from positive data
    • Ang80
    • [Ang80] D. Angluin, Inductive inference of formal languages from positive data, Inform, and Control 45 (1980), 117-135.
    • (1980) Inform, and Control , vol.45 , pp. 117-135
    • Angluin, D.1
  • 2
    • 0020815483 scopus 로고
    • Inductive inference: Theory and methods
    • AS83
    • [AS83] D. Angluin and C. Smith, Inductive inference: Theory and methods, Comput. Surveys 15 (1983), 237-289.
    • (1983) Comput. Surveys , vol.15 , pp. 237-289
    • Angluin, D.1    Smith, C.2
  • 3
    • 0001083923 scopus 로고
    • Inductive inference of Prolog programs with linear data dependency from positive data
    • AS94 (H. Jaakkola, H. Kangassalo, T. Kitahashi, and A. Markus, Eds.), IOS Press
    • [AS94] H. Arimura and T. Shinohara, Inductive inference of Prolog programs with linear data dependency from positive data, in "Proc. Information Modelling and Knowledge Bases V" (H. Jaakkola, H. Kangassalo, T. Kitahashi, and A. Markus, Eds.), pp. 365-375, IOS Press, 1994.
    • (1994) Proc. Information Modelling and Knowledge Bases V , pp. 365-375
    • Arimura, H.1    Shinohara, T.2
  • 5
    • 0002463183 scopus 로고
    • Two theorems on the limiting synthesis of functions
    • Bār74 Latvian State University, In Russian
    • [Bār74] J. Bārzdiņš, Two theorems on the limiting synthesis of functions, in "Theory of Algorithms and Programs," Vol. 1, pp. 82-88, Latvian State University, 1974. [In Russian]
    • (1974) Theory of Algorithms and Programs , vol.1 , pp. 82-88
    • Barzdiņš, J.1
  • 6
    • 0016521417 scopus 로고
    • Toward a mathematical theory of inductive inference
    • BB75
    • [BB75] L. Blum and M. Blum, Toward a mathematical theory of inductive inference, Inform, and Control 28 (1975), 125-155.
    • (1975) Inform, and Control , vol.28 , pp. 125-155
    • Blum, L.1    Blum, M.2
  • 7
    • 0345867476 scopus 로고    scopus 로고
    • The synthesis of language learners
    • BCJ99
    • [BCJ99] G. Baliga, J. Case, and S. Jain, The synthesis of language learners, Inform, and Comput. 152 (1999), 16-43.
    • (1999) Inform, and Comput. , vol.152 , pp. 16-43
    • Baliga, G.1    Case, J.2    Jain, S.3
  • 9
    • 84926396434 scopus 로고
    • A machine-independent theory of the complexity of recursive functions
    • Blu67
    • [Blu67] M. Blum, A machine-independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach. 14 (1967), 322-336.
    • (1967) J. Assoc. Comput. Mach. , vol.14 , pp. 322-336
    • Blum, M.1
  • 10
    • 0002610575 scopus 로고
    • The theory of inductive inference
    • BP73 J Math. Inst. of the Slovak Academy of Sciences
    • [BP73] J. Bārzdiņš K. Podnieks, The theory of inductive inference, in "Second Symposium on Mathematical Foundations of Computer Science," pp. 9-15, Math. Inst. of the Slovak Academy of Sciences, 1973.
    • (1973) Second Symposium on Mathematical Foundations of Computer Science , pp. 9-15
    • Podnieks, B.K.1
  • 11
    • 30244515355 scopus 로고
    • Periodicity in generations of automata
    • Cas74
    • [Cas74] J. Case, Periodicity in generations of automata, Math. Systems Theory 8 (1974), 15-32.
    • (1974) Math. Systems Theory , vol.8 , pp. 15-32
    • Case, J.1
  • 12
    • 0010869417 scopus 로고
    • Learning machines
    • Cas86 (W. Demopoulos and A. Marras, Eds.), Ablex
    • [Cas86] J. Case, Learning machines, in "Language Learning and Concept Acquisition" (W. Demopoulos and A. Marras, Eds.), Ablex, 1986.
    • (1986) Language Learning and Concept Acquisition
    • Case, J.1
  • 13
    • 33646304597 scopus 로고
    • Turing machine
    • Cas92 (S. Shapiro, Ed.), second edition, Wiley, New York
    • [Cas92] J. Case, Turing machine, in "Encyclopedia of Artificial Intelligence" (S. Shapiro, Ed.), second edition, Wiley, New York, 1992.
    • (1992) Encyclopedia of Artificial Intelligence
    • Case, J.1
  • 14
    • 0033145449 scopus 로고    scopus 로고
    • The power of vacillation in language learning
    • Cas99
    • [Cas99] J. Case, The power of vacillation in language learning, SIAM J. Comput. 28 (1999), 1941-1969.
    • (1999) SIAM J. Comput. , vol.28 , pp. 1941-1969
    • Case, J.1
  • 15
    • 0002633967 scopus 로고    scopus 로고
    • Incremental concept learning for bounded data mining
    • CJLZ99
    • [CJLZ99] J. Case, S. Jain, S. Lange, and T. Zeugmann, Incremental concept learning for bounded data mining, Inform, and Comput. 152 (1999), 74-110.
    • (1999) Inform, and Comput. , vol.152 , pp. 74-110
    • Case, J.1    Jain, S.2    Lange, S.3    Zeugmann, T.4
  • 16
    • 85031515882 scopus 로고    scopus 로고
    • Synthesizing noise-tolerant language learners, T
    • CJS99 Special Issue for ALT'97, to appear.
    • [CJS99] J. Case, S. Jain, and A. Sharma, Synthesizing noise-tolerant language learners, in "Theoretical Computer Science A," 1999. [Special Issue for ALT'97, to appear.]
    • (1999) Heoretical Computer Science a
    • Case, J.1    Jain, S.2    Sharma, A.3
  • 17
    • 0010540295 scopus 로고    scopus 로고
    • Vacillatory and BC learning on noisy data
    • CJS00 Special Issue for ALT'96.
    • [CJS00] J. Case, S. Jain, and F. Stephan, Vacillatory and BC learning on noisy data, Theoret. Comput. Sci. A 241 (2000), 115-141. [Special Issue for ALT'96.]
    • (2000) Theoret. Comput. Sci. A , vol.241 , pp. 115-141
    • Case, J.1    Jain, S.2    Stephan, F.3
  • 18
    • 85037033731 scopus 로고
    • Machine inductive inference and language identification
    • CL82 Proceedings of the 9th International Colloquium on Automata, Languages and Programming" (M. Nielsen and E. M. Schmidt, Eds.), Springer-Verlag, Berlin/New York
    • [CL82] J. Case and C. Lynes, Machine inductive inference and language identification, in "Proceedings of the 9th International Colloquium on Automata, Languages and Programming" (M. Nielsen and E. M. Schmidt, Eds.), Lecture Notes in Computer Science, Vol. 140, pp. 107-115, Springer-Verlag, Berlin/New York, 1982.
    • (1982) Lecture Notes in Computer Science , vol.140 , pp. 107-115
    • Case, J.1    Lynes, C.2
  • 20
    • 0000210140 scopus 로고
    • Comparison of identification criteria for machine inductive inference
    • CS83
    • [CS83] J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoret. Comput. Sci. 25 (1983), 193-220.
    • (1983) Theoret. Comput. Sci. , vol.25 , pp. 193-220
    • Case, J.1    Smith, C.2
  • 23
    • 51249180339 scopus 로고
    • Simulating physics with computers
    • Fey82
    • [Fey82] R. Feynman, Simulating physics with computers, Internat. J. Theoret. Physics 21 (6/7) (1982).
    • (1982) Internat. J. Theoret. Physics , vol.21 , Issue.6-7
    • Feynman, R.1
  • 24
    • 0030182790 scopus 로고    scopus 로고
    • Learning in the presence of inaccurate information
    • FJ96
    • [FJ96] M. Fulk and S. Jain, Learning in the presence of inaccurate information, Theoret. Comput. Sci. A 161 (1996), 235-261.
    • (1996) Theoret. Comput. Sci. a , vol.161 , pp. 235-261
    • Fulk, M.1    Jain, S.2
  • 25
    • 0347909325 scopus 로고
    • Recursiveness of the enumerating functions increases the inferrability of recursively enumerable sets
    • Fre85
    • [Fre85] R. Freivalds, Recursiveness of the enumerating functions increases the inferrability of recursively enumerable sets, Bull. European Assoc. Theoret. Comput. Sci. 27 (1985), 35-40.
    • (1985) Bull. European Assoc. Theoret. Comput. Sci. , vol.27 , pp. 35-40
    • Freivalds, R.1
  • 26
    • 0025720914 scopus 로고
    • Robust separations in inductive inference
    • Ful90 IEEE Comput. Soc. Press, New York
    • [Ful90] M. Fulk, Robust separations in inductive inference, in "31st Annual IEEE Symposium on Foundations of Computer Science," pp. 405-410, IEEE Comput. Soc. Press, New York, 1990.
    • (1990) 31st Annual IEEE Symposium on Foundations of Computer Science , pp. 405-410
    • Fulk, M.1
  • 28
    • 0000595574 scopus 로고
    • Computational complexity of probabilistic Turing machines
    • Gil77
    • [Gil77] J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6 (1977), 675-695.
    • (1977) SIAM J. Comput. , vol.6 , pp. 675-695
    • Gill, J.1
  • 29
    • 49949150022 scopus 로고
    • Language identification in the limit
    • Gol67
    • [Gol67] E. M. Gold, Language identification in the limit, Inform, and Control 10 (1967), 447-474.
    • (1967) Inform, and Control , vol.10 , pp. 447-474
    • Gold, E.M.1
  • 30
    • 0030388061 scopus 로고    scopus 로고
    • Program synthesis in the presence of infinite number of inaccuracies
    • Jai96
    • [Jai96] S. Jain, Program synthesis in the presence of infinite number of inaccuracies, J. Comput. System Sci. 53 (1996), 583-591.
    • (1996) J. Comput. System Sci. , vol.53 , pp. 583-591
    • Jain, S.1
  • 31
    • 0002089167 scopus 로고
    • Automatic synthesis of programs and inductive inference of functions
    • Jan79a Akademie-Verlag, Berlin
    • [Jan79a] K. Jantke, Automatic synthesis of programs and inductive inference of functions, in "Int. Conf. Fundamentals of Computations Theory," pp. 219-225, Akademie-Verlag, Berlin, 1979.
    • (1979) Int. Conf. Fundamentals of Computations Theory , pp. 219-225
    • Jantke, K.1
  • 32
    • 0004474842 scopus 로고
    • Natural properties of strategies identifying recursive functions
    • Jan79b
    • [Jan79b] K. Jantke, Natural properties of strategies identifying recursive functions, J. Inform. Process. Cybernetics (EIK) 15 (1979), 487-496.
    • (1979) J. Inform. Process. Cybernetics (EIK) , vol.15 , pp. 487-496
    • Jantke, K.1
  • 35
    • 0004505626 scopus 로고
    • Language learning without overgeneralization
    • KB92 "Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science" (A. Finkel and M. Jantzen, Eds.), Springer-Verlag, Berlin/New York
    • [KB92] S. Kapur and G. Bilardi, Language learning without overgeneralization, in "Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science" (A. Finkel and M. Jantzen, Eds.), Lecture Notes in Computer Science, Vol. 577, pp. 245-256, Springer-Verlag, Berlin/New York, 1992.
    • (1992) Lecture Notes in Computer Science , vol.577 , pp. 245-256
    • Kapur, S.1    Bilardi, G.2
  • 36
    • 84955576747 scopus 로고
    • MDL learning of unions of simple pattern languages from positive examples
    • KMU95 "Second European Conference on Computational Learning Theory" (P. Vitányi, Ed.), Springer-Verlag, Berlin/New York
    • [KMU95] P. Kilpeläinen, H. Mannila, and E. Ukkonen, MDL learning of unions of simple pattern languages from positive examples, in "Second European Conference on Computational Learning Theory" (P. Vitányi, Ed.), Lecture Notes in Artificial Intelligences, Vol. 904, pp. 252-260, Springer-Verlag, Berlin/New York, 1995.
    • (1995) Lecture Notes in Artificial Intelligences , vol.904 , pp. 252-260
    • Kilpeläinen, P.1    Mannila, H.2    Ukkonen, E.3
  • 37
    • 85060573004 scopus 로고
    • Prudence in language learning
    • KR88 (D. Haussler and L. Pitt, Eds.), Morgan Kaufmann, San Mateo, CA
    • [KR88] S. Kurtz and J. Royer, Prudence in language learning, in "Proceedings of the Workshop on Computational Learning Theory" (D. Haussler and L. Pitt, Eds.), pp. 143-156, Morgan Kaufmann, San Mateo, CA, 1988.
    • (1988) Proceedings of the Workshop on Computational Learning Theory , pp. 143-156
    • Kurtz, S.1    Royer, J.2
  • 38
    • 0000997470 scopus 로고
    • Research in the theory of inductive inference by GDR mathematiciancs - A survey
    • KW80
    • [KW80] R. Klette and R. Wiehagen, Research in the theory of inductive inference by GDR mathematiciancs - A survey, Inform. Sci. 22 (1980), 149-169.
    • (1980) Inform. Sci. , vol.22 , pp. 149-169
    • Klette, R.1    Wiehagen, R.2
  • 40
    • 0030108047 scopus 로고    scopus 로고
    • Monotonic and dual monotonic language learning
    • LZK96
    • [LZK96] S. Lange, T. Zeugmann, and S. Kapur, Monotonic and dual monotonic language learning, Theoret. Comput. Sci. A 155 (1996), 365-410.
    • (1996) Theoret. Comput. Sci. a , vol.155 , pp. 365-410
    • Lange, S.1    Zeugmann, T.2    Kapur, S.3
  • 41
    • 0028429573 scopus 로고
    • Inductive logic programming: Theory and methods
    • MR94
    • [MR94] S. Muggleton and L. De Raedt, Inductive logic programming: Theory and methods, J. Logic Programming 19/20 (1994), 669-679.
    • (1994) J. Logic Programming , vol.19-20 , pp. 669-679
    • Muggleton, S.1    De Raedt, L.2
  • 43
    • 85031515905 scopus 로고
    • Nix83 Department of Computer Science, Yale University, New Haven, CT
    • [Nix83] R. Nix, "Editing by Examples," Technical Report 280, Department of Computer Science, Yale University, New Haven, CT, 1983.
    • (1983) "Editing by Examples," Technical Report , vol.280
    • Nix, R.1
  • 48
    • 0002801265 scopus 로고
    • Pattern inference
    • SA95 Algorithmic Learning for Knowledge-Based Systems" (K. P. Jantke and S. Lange, Eds.), Springer-Verlag, Berlin/New York
    • [SA95] T. Shinohara and A. Arikawa, Pattern inference, in "Algorithmic Learning for Knowledge-Based Systems" (K. P. Jantke and S. Lange, Eds.), Lecture Notes in Artificial Intelligence, Vol. 961, pp. 259-291, Springer-Verlag, Berlin/New York, 1995.
    • (1995) Lecture Notes in Artificial Intelligence , vol.961 , pp. 259-291
    • Shinohara, T.1    Arikawa, A.2
  • 49
    • 0347909318 scopus 로고
    • Review of "Limiting recursion" by E. M. Gold and "Trial and error predicates and the solution to a problem of Mostowski" by H. Putnam
    • Sha71
    • [Sha71] N. Shapiro, Review of "Limiting recursion" by E. M. Gold and "Trial and error predicates and the solution to a problem of Mostowski" by H. Putnam, J. Symbolic Logic 36 (1971), 342.
    • (1971) J. Symbolic Logic , vol.36 , pp. 342
    • Shapiro, N.1
  • 50
    • 0004526124 scopus 로고
    • Inferring unions of two pattern languages
    • Shi83
    • [Shi83] T. Shinohara, Inferring unions of two pattern languages, Bull. Inform. Cybernetics 20 (1983), 83-88.
    • (1983) Bull. Inform. Cybernetics , vol.20 , pp. 83-88
    • Shinohara, T.1
  • 51
    • 0002296778 scopus 로고
    • Inductive inference of monotonic formal systems from positive data
    • Shi91
    • [Shi91] T. Shinohara, Inductive inference of monotonic formal systems from positive data, New Generation Comput. 8 (1991), 371-384.
    • (1991) New Generation Comput. , vol.8 , pp. 371-384
    • Shinohara, T.1
  • 54
    • 0346333576 scopus 로고
    • Some results in the theory of effective program synthesis - Learning by defective information
    • SR85 Mathematical Methods of Specification and Synthesis of Software Systems, Wendisch-Rietz, GDR (W. Bibel and K. Jantke, Eds.), Springer-Verlag, Berlin/New York
    • [SR85] G. Schäfer-Richter, Some results in the theory of effective program synthesis - learning by defective information, in "Mathematical Methods of Specification and Synthesis of Software Systems, Wendisch-Rietz, GDR" (W. Bibel and K. Jantke, Eds.), Lecture Notes in Computer Science, Vol. 215, pp. 219-225, Springer-Verlag, Berlin/New York, 1985.
    • (1985) Lecture Notes in Computer Science , vol.215 , pp. 219-225
    • Schäfer-Richter, G.1
  • 56
    • 84947917851 scopus 로고
    • Noisy inference and oracles
    • Ste95 "Algorithmic Learning Theory: Sixth International Workshop (ALT'95)" (K. Jantke, T. Shinohara, and T. Zeugmann, Eds.), Springer-Verlag, Berlin/New York
    • [Ste95] F. Stephan, Noisy inference and oracles, in "Algorithmic Learning Theory: Sixth International Workshop (ALT'95)" (K. Jantke, T. Shinohara, and T. Zeugmann, Eds.), Lecture Notes in Artificial Intelligence, Vol. 997, pp. 185-200, Springer-Verlag, Berlin/New York, 1995.
    • (1995) Lecture Notes in Artificial Intelligence , vol.997 , pp. 185-200
    • Stephan, F.1
  • 58
    • 0003415313 scopus 로고
    • Cellular Automata Machines
    • Tof77 Comp. Comm. Sci. Dept., University of Michigan
    • [Tof77] T. Toffoli, "Cellular Automata Machines," Technical Report 208, Comp. Comm. Sci. Dept., University of Michigan, 1977.
    • (1977) Technical Report , vol.208
    • Toffoli, T.1
  • 59
    • 85027610797 scopus 로고    scopus 로고
    • Identification of formal languages
    • Wie77 "Mathematical Foundations of Computer Science Springer-
    • [Wie77] R. Wiehagen, Identification of formal languages, in "Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, Vol. 53, pp. 571-579, Springer-
    • Lecture Notes in Computer Science , vol.53 , pp. 571-579
    • Wiehagen, R.1
  • 60
    • 84961346632 scopus 로고
    • Identification of unions of languages drawn from an identifiable class
    • Wri89 (R. Rivest, D. Haussler, and M. K. Warmuth, Eds.), Morgan Kaufmann, San Mateo, CA
    • [Wri89] K. Wright, Identification of unions of languages drawn from an identifiable class, in "Proceedings of the Second Annual Workshop on Computational Learning Theory" (R. Rivest, D. Haussler, and M. K. Warmuth, Eds.), pp. 328-333, Morgan Kaufmann, San Mateo, CA, 1989.
    • (1989) Proceedings of the Second Annual Workshop on Computational Learning Theory , pp. 328-333
    • Wright, K.1
  • 61
    • 0000741196 scopus 로고
    • A guided tour across the boundaries of learning recursive languages
    • ZL95 Algorithmic Learning for Knowledge-Based Systems (K. Jantke and S. Lange, Eds.), Springer-Verlag, Berlin/New York
    • [ZL95] T. Zeugmann and S. Lange, A guided tour across the boundaries of learning recursive languages, in "Algorithmic Learning for Knowledge-Based Systems" (K. Jantke and S. Lange, Eds.), Lecture Notes in Artificial Intelligence, Vol. 961, pp. 190-258, Springer-Verlag, Berlin/New York, 1995.
    • (1995) Lecture Notes in Artificial Intelligence , vol.961 , pp. 190-258
    • Zeugmann, T.1    Lange, S.2
  • 62
    • 33745499383 scopus 로고
    • Characterizations of monotonic and dual monotonic language learning
    • ZLK95
    • [ZLK95] T. Zeugmann, S. Lange, and S. Kapur, Characterizations of monotonic and dual monotonic language learning, Inform, and Comput. 120 (1995), 155-173.
    • (1995) Inform, and Comput. , vol.120 , pp. 155-173
    • Zeugmann, T.1    Lange, S.2    Kapur, S.3
  • 63
    • 85031514106 scopus 로고
    • Rechnender Raum," Vieweg, Braunshweig, 1969. Translated as "Calculating Space,"
    • Zus69 MIT Project MAC
    • [Zus69] K. Zuse, "Rechnender Raum," Vieweg, Braunshweig, 1969. [Translated as "Calculating Space," Tech. Transl. AZT-70-164-GEMIT, MIT Project MAC, 1970.]
    • (1970) Tech. Transl. AZT-70-164-GEMIT
    • Zuse, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.