Empirical support for winnow and weighted-majority algorithms: Results on a calendar scheduling domain

Machine Learning

Volumn 26, Issue 1, 1997, Pages 5-23

  Blum, Avrim ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Multiplicative algorithms; Weighted majority; Winnow

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; LEARNING SYSTEMS; PERFORMANCE; SCHEDULING; SIMULATION;

MULTIPLICATIVE ALGORITHMS; WEIGHTED MAJORITY; WINNOW;

ALGORITHMS;

EID: 0030819669     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007335615132     Document Type: Article

References (14)

1. Armstrong, R., Freitag, D., Joachims, T., & Mitchell, T. (1995). Webwatcher: A learning apprentice for the world wide web. In 1995 AAAI Spring Symposium on Information Gathering from Heterogeneous Distributed Environments.
2. Blum, A. (1992). Learning boolean functions in an infinite attribute space. Machine Learning, 9:373-386.
3. Blum, A., Hellerstein, L., & Littlestone, N. (1991). Learning in the presence of finitely or infinitely many irrelevant attributes. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 157-166, Santa Cruz, California. Morgan Kaufmann.
4. Caruana, R. & Freitag, D. (1994). Greedy attribute selection. In Proceedings of the Eleventh International Conference on Machine Learning.
5. Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., & Warmuth, M. (1993). How to use expert advice. In Proceedings of the Annual ACM Symp. on the Theory of Computing, pages 382-391.
6. Dent, L., Boticario, J., McDermott, J., Mitchell, T., & Zabowski, D. (1992). A personal learning apprentice. In Proceedings of the 1992 National Conference on Artificial Intelligence.
7. DeSantis, A., Markowsky, G., & Wegman, M. (1988). Learning probabilistic prediction functions. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 110-119.
8. Feller, W. (1968). An Introduction to Probability and its Applications, volume 1. John Wiley and Sons, third edition.
9. Jourdan, J., Dent, L., McDermott, J., & Zabowski, D. (1991). Interfaces that learn: A learning apprentice for calendar management. Technical Report CMU-CS-91-135, Carnegie Mellon University.
10. Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318.
11. Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. PhD thesis, U. C. Santa Cruz.
12. Littlestone, N. (1991). Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 147-156, Santa Cruz, California. Morgan Kaufmann.
13. Littlestone, N. & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108(2):212-261.
14. Mitchell, T., Caruana, R., Freitag, D., McDermott, J., & Zabowski, D. (1994). Experience with a personal learning assistant. CACM, 37(7):81-91.