Revision as of 09:42, 8 January 2004 edit APH (talk \| contribs) Extended confirmed users 1,500 edits No edit summary ← Previous edit		Revision as of 09:56, 8 January 2004 edit undo APH (talk \| contribs) Extended confirmed users 1,500 edits No edit summary Next edit →
Line 22: Feature selection * [DH,94] A. Dhagat and L. Hellerstein. PAC learning with irrelevant attributes. In Proceedings of the IEEE Symp. on Foundation of Computer Science, 1994. To appear. Inductive inference * [Gold, 67] E. M. Gold. Language identification in the limit. Information and Control, 10:447--474, 1967. Optimal O notation learning * [GG96] O. Goldreich, D. Ron. On universal learning algorithms. Negative results * [KV,89] M. Kearns and L. G. Valiant. 1989. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433--444, New York. ACM. Boosting * [Sch, 90] Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197--227, 1990 The definition of the PAC framework * [Valiant, 84] L. Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134--1142, 1984.

Computational learning theory: Difference between revisions