CSCE 478/878 (Fall 2003) lecture slides

• Lectures 0 and 1: Administrivia and Introduction, Aug 25-27, Chapter 1 (ps1up, pdf1up, ps4up, pdf4up)

• Homework 0 due Aug 29

• Labor Day, Sep 1, no class

• Prerequisite test due Sep 5

• Lecture 2: Concept Learning and the General-to-Specific Ordering, Sep 3-8, Chapter 2 (ps1up, pdf1up, ps4up, pdf4up) Topic summary 1 due Monday, Sept 15

• Lecture 3: Computational Learning Theory, Sep 8-17, Sections 7.1-7.4.3, 7.5-7.5.3, 7.6 (ps1up, pdf1up, ps4up, pdf4up) Topic summary 2 due Wednesday, Sept 24

• Lecture 4: Decision Trees, overfitting, Occam's razor, Sep 17-24, Chapter 3 (ps1up, pdf1up, ps4up, pdf4up) Topic summary 3 due Wednesday, Oct 8 Also see:
  • C4.5: Programs for Machine Learning
  • Complete source for C4.5 (old version)
  • Manuals/tutorials for C4.5

• Lecture 5: Artificial Neural Networks and Support Vector Machines Sep 29-Oct 29, Chapter 4, Section 7.4.4, Littlestone paper, handout from Christianini and Shawe-Taylor's book (ps1up, pdf1up, ps4up, pdf4up) Topic summary 4 due Wednesday, Nov 5
  Also see:
  • Manfred K. Warmuth, who has done much work on EG and Winnow. Many papers available on-line, including his GD/EG paper:
    • Jyrki Kivinen and Manfred K. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation 132(1):1-64, January 1997.
  • Nick Littlestone (creator of Winnow) and some of his papers:
    • Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning 2:285-318, 1988. [The linked paper is not the final version, but a similar technical report.]
    • Nick Littlestone. Redundant noisy attributes, attribute errors, and linear threshold learning using Winnow. In Proc. 4th Annu. Workshop on Comput. Learning Theory, 147-156, 1991. Morgan Kaufmann.
  • Avrim Blum and his survey paper ``On-Line Algorithms in Machine Learning''
  • ANN growing and pruning:
    • Christopher M. Bishop. Neural Networks for Pattern Recognition. Oxford University Press, 1995. (Section 9.5)
  • SVMs:
    • Muller, K.-R., Mika, S., Ratsch, G., Tsuda, K., and Scholkopf, B. An introduction to kernel-based learning algorithms. IEEE Transactions on Neural Networks, 12(2):181-201, 2001.
    • Christopher Burges. A tutorial on support vector machines for pattern recognition
    • Nello Cristianini and John Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge University Press, 2000.
    • Richard Duda, Peter Hart, and David Stork. Pattern Classification, 2nd Edition. [also see software supplements] John Wiley, 2001. (Section 5.11)
    • SVM tutorial
    • KernelMachines.org
    • Sebastian Thrun's links

• Fall break, Oct 20, no class

• Lecture 6: Evaluating Hypotheses Nov 3-5, Chapter 5 (ps1up, pdf1up, ps4up, pdf4up) Topic summary 5 due Wednesday, Nov 12
  Also see:
  • Thomas G. Dietterich. Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation 10(7):1895-1924.

• Lecture 7: Combining Classifiers: Weighted Majority, Bagging and Boosting, Nov 10-12, Section 7.5.4, Breiman paper, Freund & Schapire paper (ps1up, pdf1up, ps4up, pdf4up) Topic summary 6 due Wednesday, Nov 19
  Also see:
  • Leo Breiman. Bagging predictors. Technical Report 421. Dept. of Statistics, University of California-Berkeley. September 1994.
  • Yoav Freund and Robert Schapire. A short introduction to boosting. Journal of Japanese Society for Artificial Intelligence 14(5):771-780, September, 1999. [Other introductory and advanced papers are available at Freund's and Schapire's pages.]
  • Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation 108(2):212-261. February 1994.

• Lecture 8: Bayesian learning, Nov 17-24, Chapter 6 (ps1up, pdf1up, ps4up, pdf4up) Also see:
  • Pedro Domingos and Michael Pazzani. Beyond independence: Conditions for the optimality of the simple bayesian classifier. In Proceedings of the 13th International Conference on Machine Learning, 1996.
  • Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, Second Edition. Prentice Hall, 2003.
  • Richard E. Neapolitan. Learning Bayesian Networks. Prentice Hall, 2004.

• Thanksgiving holiday, Nov 26, no class

• Lecture 8.5: How to give a good research talk, Dec 1, Goldman slides (ps4up, pdf4up, pdf1up)
  Also see:
  • Tips on Presenting Technical Material

• Chris Hammack's thesis defense on LASSO, Wednesday, Dec 3, 11:30a.m. in Ferguson 114

• Lecture 9: Instance-based learning, Dec 3, Chapter 8 (ps1up, pdf1up, ps4up, pdf4up) Also see:
  • David Aha, ed. Lazy Learning. Kluwer Academic Publishers, 1997.
  • Christopher M. Bishop. Neural Networks for Pattern Recognition. Oxford University Press, 1995. [RBF networks]
  • Sergios Theodoridis and Konstantinos Koutroumbas. Pattern Recognition. [distance measures between instances]

• Lecture 10: Reinforcement learning, Dec 3, Chapter 13 (ps1up, pdf1up, ps4up, pdf4up) Also see:
  • Gerald Tesauro. Temporal Difference Learning and TD-Gammon. Communcations of the ACM 38(3):58-68, March 1995.
  • Richard Sutton and Andrew Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.

• Course evaluations (ps, pdf), Dec 3

• Project presentations, Dec 8-10 (dead week)

• Project reports due Dec 12

Last modified 16 August 2011; please report problems to sscott AT cse.