view · edit · attach · print · history

Lecture 2

Supervised learning methods

Memory-based algorithms: K-nearest neighbors (K-NN)
Approaching supervised learning problems fairly and systematically
Training, testing, validation, and cross-validation
ROC curves and the c-index
Resampling: bootstrapping, boosting, bagging
Combining systems: mixing models and voting
Data preparation: component analysis
Brief introduction to statistical pattern recognition and Bayesian estimation

Memory-based algorithms

  • Duda, Richard O., Hart, Peter E., and Stork, David (2001) Pattern Classification. Second Edition. New York: Wiley.
    • Section 4.1-4.6: Nonparametric techniques, pp. 161-192
  • http://en.wikipedia.org/wiki/KNN

Training, testing, validation, and cross-validation

  • Duda, Richard O., Hart, Peter E., and Stork, David (2001) Pattern Classification. Second Edition. New York: Wiley.
    • Section 9.6.2: Cross-validation , pp. 483-485.

C-index and ROC curves

  • http://en.wikipedia.org/wiki/Roc_curve
  • Duda, Richard O., Hart, Peter E., and Stork, David (2001) Pattern Classification. Second Edition. New York: Wiley.
    • Section 2.8.3: Signal detection theory and operating characteristics, pp. 48-51.

Resampling: Bootstrapping, boosting, bagging

Mixing models and voting

Component analysis

Maximum-likelihood and Bayesian parameter estimation

view · edit · attach · print · history
Page last modified on February 02, 2009, at 08:27 PM