On-line learning of linear functions
暂无分享,去创建一个
[1] S. Kullback,et al. A lower bound for discrimination information in terms of variation (Corresp.) , 1967, IEEE Trans. Inf. Theory.
[2] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[3] Gene H. Golub,et al. Matrix computations , 1983 .
[4] Victor Y. Pan,et al. Efficient parallel solution of linear systems , 1985, STOC '85.
[5] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.
[6] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[7] J. Mycielski. A learning theorem for linear operators , 1988 .
[8] David Haussler. Learning Conjunctive Concepts in Structural Domains , 1989, Mach. Learn..
[9] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[10] W. Joubert,et al. Iterative methods for nonsymmetric linear systems , 1990 .
[11] N. Littlestone. Mistake bounds and logarithmic linear-threshold learning algorithms , 1990 .
[12] Leonard Pitt,et al. Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..
[13] N. Littlestone,et al. Learning in the presence of finitely or infinitely many irrelevant attributes , 1991, COLT '91.