Unit 2

More Optimization and Clustering

« Previous | Next »

Session Overview

This lecture continues to discuss optimization in the context of the knapsack problem, and talks about the difference between greedy approaches and optimal approaches. It then moves on to discuss supervised and unsupervised machine learning optimization problems. Most of the time is spent on clustering.

Image courtesy of Squiggle on Flickr.

Session Activities

Lecture Videos

About this Video

Topics covered: Knapsack problem, local and global optima, supervised and unsupervised machine learning, training error, clustering, linkage, feature vectors.


Check Yourself

What is machine learning?

View/hide answer

“A scientific discipline that is concerned with the design and development of algorithms that allow computers to evolve behaviors based on empirical data.” From Wikipedia.

What is inductive inference?

View/hide answer

The observation of examples that represent incomplete information about some statistical phenomenon in order to recognize complex patterns and make intelligent decisions.

What is supervised learning?

View/hide answer

Learning in which a label is associated with each example in a training set.

What is unsupervised learning used for?

View/hide answer

Uncovering hidden regularities or detecting anomalies in data.

What is clustering?

View/hide answer

The process of organizing objects into groups whose members are similar in some way.

What is agglomerative clustering?

View/hide answer

Clustering that merges clusters iteratively.

« Previous | Next »

Course Info

Learning Resource Types

theaters Lecture Videos
theaters Recitation Videos
assignment_turned_in Problem Sets with Solutions
grading Exams with Solutions
menu_book Online Textbook
assignment_turned_in Programming Assignments with Examples