메뉴 건너뛰기




Volumn 60, Issue 2, 2000, Pages 302-335

Average-case optimal one-variable pattern language learner

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LEARNING ALGORITHMS; PROBABILITY;

EID: 0033876342     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1669     Document Type: Article
Times cited : (17)

References (24)
  • 1
    • 71049171650 scopus 로고
    • Finding patterns common to a set of strings
    • Angluin D. Finding patterns common to a set of strings. J. Comput. System Sci. 21:1980;46-62.
    • (1980) J. Comput. System Sci. , vol.21 , pp. 46-62
    • Angluin, D.1
  • 5
    • 0022693875 scopus 로고
    • On the complexity of inductive inference
    • Daley R., Smith C. H. On the complexity of inductive inference. Inform. Control. 69:1986;12-40.
    • (1986) Inform. Control , vol.69 , pp. 12-40
    • Daley, R.1    Smith, C.H.2
  • 6
    • 84958096244 scopus 로고    scopus 로고
    • Efficient Learning of One-Variable Pattern Languages from Positive Data
    • Fukuoka: Kyushu University
    • Erlebach T., Rossmanith P., Stadtherr H., Steger A., Zeugmann T. Efficient Learning of One-Variable Pattern Languages from Positive Data. DOI-TR-128. 1996;Kyushu University, Fukuoka.
    • (1996) DOI-TR-128
    • Erlebach, T.1    Rossmanith, P.2    Stadtherr, H.3    Steger, A.4    Zeugmann, T.5
  • 7
    • 84958039201 scopus 로고    scopus 로고
    • Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
    • M. Li, & A. Maruoka. Proc. 8th Int. Workshop on Algorithmic Learning Theory. Berlin: Springer-Verlag
    • Erlebach T., Rossmanith P., Stadtherr H., Steger A., Zeugmann T. Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Li M., Maruoka A. Proc. 8th Int. Workshop on Algorithmic Learning Theory. Lecture Notes in Artificial Intelligence. 1316:1997;260-276 Springer-Verlag, Berlin.
    • (1997) Lecture Notes in Artificial Intelligence , vol.1316 , pp. 260-276
    • Erlebach, T.1    Rossmanith, P.2    Stadtherr, H.3    Steger, A.4    Zeugmann, T.5
  • 10
    • 49949150022 scopus 로고
    • Language identification in the limit
    • Gold E. M. Language identification in the limit. Inform. Control. 10:1967;447-474.
    • (1967) Inform. Control , vol.10 , pp. 447-474
    • Gold, E.M.1
  • 11
    • 85037544614 scopus 로고
    • A polynomial-time algorithm for learning k-variable pattern languages from examples
    • R. Rivest, D. Haussler, & M. K. Warmuth. San Mateo: Morgan Kaufmann
    • Kearns M., Pitt L. A polynomial-time algorithm for learning k-variable pattern languages from examples. Rivest R., Haussler D., Warmuth M. K. Proc. 2nd. Annual ACM Workshop on Computational Learning Theory. 1989;57-71 Morgan Kaufmann, San Mateo.
    • (1989) Proc. 2nd. Annual ACM Workshop on Computational Learning Theory , pp. 57-71
    • Kearns, M.1    Pitt, L.2
  • 12
    • 0001305522 scopus 로고
    • Polynomial-time inference of arbitrary pattern languages
    • Lange S., Wiehagen R. Polynomial-time inference of arbitrary pattern languages. New Generation Comput. 8:1991;361-370.
    • (1991) New Generation Comput. , vol.8 , pp. 361-370
    • Lange, S.1    Wiehagen, R.2
  • 13
    • 0000625347 scopus 로고    scopus 로고
    • Set-driven and rearrangement-independent learning of recursive languages
    • Lange S., Zeugmann T. Set-driven and rearrangement-independent learning of recursive languages. Math. Systems Theory. 29:1996;599-634.
    • (1996) Math. Systems Theory , vol.29 , pp. 599-634
    • Lange, S.1    Zeugmann, T.2
  • 14
    • 0030219293 scopus 로고    scopus 로고
    • Incremental learning from positive data
    • Lange S., Zeugmann T. Incremental learning from positive data. J. Comput. System Sci. 53:1996;88-103.
    • (1996) J. Comput. System Sci. , vol.53 , pp. 88-103
    • Lange, S.1    Zeugmann, T.2
  • 15
    • 84957053481 scopus 로고    scopus 로고
    • The VC-dimension of subclasses of pattern languages
    • O. Watanabe, & T. Yokomori. Proceedings, 10th International Conference on Algorithmic Learning Theory. Berlin: Springer-Verlag
    • Mitchell A., Scheffer T., Sharma A., Stephan F. The VC-dimension of subclasses of pattern languages. Watanabe O., Yokomori T. Proceedings, 10th International Conference on Algorithmic Learning Theory. Lecture Notes in Computer Science. 1720:1999;Springer-Verlag, Berlin.
    • (1999) Lecture Notes in Computer Science , vol.1720
    • Mitchell, A.1    Scheffer, T.2    Sharma, A.3    Stephan, F.4
  • 17
    • 85037549689 scopus 로고
    • Inductive inference, DFAs and computational complexity
    • K. P. Jantke. Proc. 2nd Int. Workshop on Analogical and Inductive Inference. Berlin: Springer-Verlag
    • Pitt L. Inductive inference, DFAs and computational complexity. Jantke K. P. Proc. 2nd Int. Workshop on Analogical and Inductive Inference. Lecture Notes in Artificial Intelligence. 397:1989;18-44 Springer-Verlag, Berlin.
    • (1989) Lecture Notes in Artificial Intelligence , vol.397 , pp. 18-44
    • Pitt, L.1
  • 18
    • 0002692644 scopus 로고
    • Patterns (The Formal Language Theory Column)
    • Salomaa A. Patterns (The Formal Language Theory Column). EATCS Bulletin. 54:1994;46-62.
    • (1994) EATCS Bulletin , vol.54 , pp. 46-62
    • Salomaa, A.1
  • 19
    • 0001567527 scopus 로고
    • Return to patterns (The Formal Language Theory Column)
    • Salomaa A. Return to patterns (The Formal Language Theory Column). EATCS Bulletin. 55:1994;144-157.
    • (1994) EATCS Bulletin , vol.55 , pp. 144-157
    • Salomaa, A.1
  • 20
    • 0002801265 scopus 로고
    • Pattern inference
    • K. Jantke, & S. Lange. Algorithmic Learning for Knowledge-Based Systems. Berlin: Springer-Verlag
    • Shinohara T., Arikawa S. Pattern inference. Jantke K., Lange S. Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Artificial Intelligence. 961:1995;259-291 Springer-Verlag, Berlin.
    • (1995) Lecture Notes in Artificial Intelligence , vol.961 , pp. 259-291
    • Shinohara, T.1    Arikawa, S.2
  • 23
    • 0348224261 scopus 로고
    • Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-case Analysis with Respect to its Total Learning Time
    • Fukuoka: Kyushu University
    • Zeugmann T. Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-case Analysis with Respect to its Total Learning Time. RIFIS-TR 111. 1995;Kyushu University, Fukuoka.
    • (1995) RIFIS-TR 111
    • Zeugmann, T.1
  • 24
    • 0032329871 scopus 로고    scopus 로고
    • Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
    • Zeugmann T. Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time. Annals of Math. and Artificial Intell. 23:1998;117-145.
    • (1998) Annals of Math. and Artificial Intell. , vol.23 , pp. 117-145
    • Zeugmann, T.1


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