메뉴 건너뛰기




Volumn 4264 LNAI, Issue , 2006, Pages 169-183

Towards a better understanding of incremental learning

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTER SUPPORTED COOPERATIVE WORK; MATHEMATICAL MODELS; NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 33750734695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11894841_16     Document Type: Conference Paper
Times cited : (16)

References (13)
  • 1
    • 0000106131 scopus 로고
    • Inductive inference of formal languages from positive data
    • Angluin, D., Inductive inference of formal languages from positive data, Information and Control 45, 117-135, 1980.
    • (1980) Information and Control , vol.45 , pp. 117-135
    • Angluin, D.1
  • 2
    • 0000710299 scopus 로고
    • Queries and concept learning
    • Angluin, D., Queries and concept learning, Machine Learning 2, 319-342, 1988.
    • (1988) Machine Learning , vol.2 , pp. 319-342
    • Angluin, D.1
  • 3
    • 84926396434 scopus 로고
    • A machine independent theory of the complexity of recursive functions
    • Blum, M., A machine independent theory of the complexity of recursive functions, Journal of the ACM 14, 322-336, 1967.
    • (1967) Journal of the ACM , vol.14 , pp. 322-336
    • Blum, M.1
  • 6
    • 49949150022 scopus 로고
    • Language identification in the limit
    • Gold, E.M., Language identification in the limit, Information and Control 10, 447-474, 1967.
    • (1967) Information and Control , vol.10 , pp. 447-474
    • Gold, E.M.1
  • 7
    • 0001427402 scopus 로고
    • Language learning from texts: Mind changes, limited memory and monotonicity
    • Kinber, E. and Stephan, F., Language learning from texts: Mind changes, limited memory and monotonicity, Information and Computation 123, 224-241, 1995.
    • (1995) Information and Computation , vol.123 , pp. 224-241
    • Kinber, E.1    Stephan, F.2
  • 8
  • 10
    • 0020916765 scopus 로고
    • Polynomial time inference of extended regular pattern languages
    • LNCS, Springer-Verlag
    • Shinohara, T., Polynomial time inference of extended regular pattern languages, in: Proc. RIMS Symposium on Software Science and Engineering, LNCS, Vol. 147, pp. 115-127, Springer-Verlag, 1983.
    • (1983) Proc. RIMS Symposium on Software Science and Engineering , vol.147 , pp. 115-127
    • Shinohara, T.1
  • 11
    • 0021518106 scopus 로고
    • A theory of the learnable
    • Valiant, L.G., A theory of the learnable, Communications of the ACM 27, 1134-1142, 1984.
    • (1984) Communications of the ACM , vol.27 , pp. 1134-1142
    • Valiant, L.G.1
  • 13
    • 0000741196 scopus 로고
    • A guided tour across the boundaries of learning recursive languages
    • LNAI, Springer-Verlag
    • Zeugmann, T. and Lange, S., A guided tour across the boundaries of learning recursive languages, in: Algorithmic Learning for Knowledge-Based Systems, LNAI, Vol. 961, pp. 190-258, Springer-Verlag, 1995.
    • (1995) Algorithmic Learning for Knowledge-based Systems , vol.961 , pp. 190-258
    • Zeugmann, T.1    Lange, S.2


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