A complete and tight average-case analysis of learning monomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 414-423

  Reischuk, Rüdiger ^a   Zeugmann, Thomas ^b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

STOCHASTIC SYSTEMS;

AVERAGE COMPLEXITY; AVERAGE-CASE ANALYSIS; AVERAGE-CASE BEHAVIOR; BINOMIAL DISTRIBUTION; COMPLEXITY MEASURES; NEGATIVE EXAMPLES; PREDICTION ERRORS; UNDERLYING DISTRIBUTION;

STOCHASTIC MODELS;

EID: 84957084048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_39     Document Type: Conference Paper

References (18)

1. J.M. Barzdin, R.V. Freivald, On the prediction of general recursive functions. Soviet Math. Doklady 13:1224-1228, 1972.
2. G. Benedek and A. Itai. Learnability by fixed distributions. \Proc. 1988 Workshop on Computational Learning Theory," 81-90, Morgan Kaufmann, 1988.
3. R. Daley and C.H. Smith. On the complexity of inductive inference. Inform. Control, 69:12-40, 1986.
4. F. Denis and R. Gilleron. PAC learning under helpful distributions. “Proc. 8th International Workshop on Algorithmic Learning Theory," LNAI Vol. 1316, 132-145, Springer-Verlag, 1997.
5. E.M. Gold, Language identification in the limit. Inform. Control 10:447-474, 1967.
6. D. Haussler. Bias, version spaces and Valiant's learning framework. “Proc. 8th National Conference on Artificial Intelligence, 564-569, Morgan Kaufmann, 1987.
7. M. Kearns, M. Li, L. Pitt and L.G. Valiant. On the learnability of Boolean formula. “Proc. 19th Annual ACM Symposium on Theory of Computing," 285-295, ACM Press 1987.
8. S. Lange and T. Zeugmann. Incremental learning from positive data. J. Comput. System Sci. 53(1):88-103, 1996.
9. M. Li and P. Vitanyi. Learning simple concepts under simple distributions. SIAM J. Comput., 20(5):911-935, 1991.
10. N. Littlestone. Learning quickly when irrelevant attributes are abound: A new linear threshold algorithm. Machine Learning 2:285-318, 1988.
11. B. Natarajan. On learning Boolean formula. “Proc. 19th Annual ACM Symposium on Theory of Computing," 295-304, ACM Press, 1987.
12. S. Okamoto and K. Satoh. An average-case analysis of k -nearest neighbor classifier. “Proc. 1st International Conference on Case-Based Reasoning Research and Development," LNCS Vol. 1010, 253-264, Springer-Verlag, 1995.
13. S. Okamoto and N. Yugami. Theoretical analysis of the nearest neighbor classifier in noisy domains. “Proc. 13th International Conference on Machine Learning, 355-363, Morgan Kaufmann 1996.
14. M.J. Pazzani and W. Sarrett, A framework for average case analysis of conjunctive learning algorithms. Machine Learning 9:349-372, 1992.
15. R. Reischuk and T. Zeugmann. Learning one-variable pattern languages in linear average time. “Proc. 11th Annual Conference on Computational Learning Theory," 198-208, ACM Press, 1998.
16. P. Rossmanith and T. Zeugmann. Learning k -variable pattern languages eficiently stochastically finite on average from positive data. “Proc. 4th International Colloquium on Grammatical Inference," LNAI Vol. 1433, 13-24, Springer-Verlag, 1998.
17. Y. Sakai, E. Takimoto and A. Maruoka. Proper learning algorithms for functions of k terms under smooth distributions. “Proc. 8th Annual ACM Conference on Computational Learning Theory," 206-213, ACM Press, 1995.
18. L.G. Valiant. A theory of the learnable. Commun. ACM 27:1134-1142, 1984.