The Concept of Unsupervised Learning
By Andrew Ng - Stanford
-
1,124
- Report An Inaccuracy In Lecture Information:
Lecture Description
The Concept of Unsupervised Learning, K-means Clustering Algorithm, K-means Algorithm, Mixtures of Gaussians and the EM Algorithm, Jensen's Inequality, The EM Algorithm, Summary
Course Description
Note: This course is offered by Stanford as an online course for credit. It can be taken individually, or as part of a master’s degree or graduate certificate earned online through the Stanford Center for Professional Development. This course provides a broad introduction to machine learning and statistical pattern recognition. Topics include: supervised learning (generative/discriminative learning, parametric/non-parametric learning, neural networks, support vector machines); unsupervised learning (clustering, dimensionality reduction, kernel methods); learning theory (bias/variance tradeoffs; VC theory; large margins); reinforcement learning and adaptive control. The course will also discuss recent applications of machine learning, such as robotic control, data mining, autonomous navigation, bioinformatics, speech recognition, and text and web data processing. Prerequisites: Knowledge of basic computer science principles and skills, at a level sufficient to write a reasonably non-trivial computer program; familiarity with basic probability theory; familiarity with basic linear algebra.
Course Index
Show:
