Direct and indirect algorithms for on-line learning of disjunctions
暂无分享,去创建一个
[1] Peter Auer,et al. Tracking the Best Disjunction , 1998, Machine Learning.
[2] Nick Littlestone,et al. Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous Attributes , 1995, ICML.
[3] Claudio Gentile,et al. Linear Hinge Loss and Average Margin , 1998, NIPS.
[4] Pedro M. Domingos,et al. Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier , 1996, ICML.
[5] N. Littlestone. Mistake bounds and logarithmic linear-threshold learning algorithms , 1990 .
[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] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[8] Tom Bylander,et al. The binary exponentiated gradient algorithm for learning linear functions , 1997, COLT '97.
[9] Dale Schuurmans,et al. General Convergence Results for Linear Discriminant Updates , 1997, COLT '97.
[10] Chris Mesterharm,et al. An Apobayesian Relative of Winnow , 1996, NIPS.
[11] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.