Mean Shift is very similar to the K-Means algorithm, except for one very important factor: you do not need to specify the number of groups prior to training. The Mean Shift algorithm finds clusters on its own. For this reason, it is even more of an "unsupervised" machine learning algorithm than K-Means.

The way Mean Shift works is to go through each featureset (a datapoint on a graph), and proceed to do a hill climb operation. Hill Climbing is just as it sounds: The idea is to continually increase, or go up, until you cannot anymore. We don't have for sure just one local maximal value. We might have only one, or we might have ten. Our "hill" in this case will be the number of featuresets/datapoints within a given radius. The radius is also called a bandwidth, and the entire window is your Kernel. The more data within the window, the better. Once we can no longer take another step without decreasing the number of featuresets/datapoints within the radius, we take the mean of all data in that region and we have located a cluster center. We do this starting from each data point. Many data points will lead to the same cluster center, which should be expected, but it is also possible that other data points will take you to a completely separate cluster center.

pythonprogramming.net
twitter.com/sentdex
www.facebook.com/pythonprogramming.net/
plus.google.com/+sentdex

1. Introduction to Machine Learning
2. Regression Intro
3. Regression Features and Labels
4. Regression Training and Testing
5. Regression forecasting and predicting
6. Pickling and Scaling
7. Regression How it Works
8. How to program the Best Fit Slope
9. How to program the Best Fit Line
10. R Squared Theory
11. Programming R Squared
12. Testing Assumptions
13. Classification w/ K Nearest Neighbors Intro
14. K Nearest Neighbors Application
15. Euclidean Distance
16. Creating Our K Nearest Neighbors A
17. Writing our own K Nearest Neighbors in Code
18. Applying our K Nearest Neighbors Algorithm
19. Final thoughts on K Nearest Neighbors
20. Support Vector Machine Intro and Application
21. Understanding Vectors
22. Support Vector Assertion
23. Support Vector Machine Fundamentals
24. Support Vector Machine Optimization
25. Creating an SVM from scratch
26. SVM Training
27. SVM Optimization
28. Completing SVM from Scratch
29. Kernels Introduction
30. Why Kernels
31. Soft Margin SVM
32. Soft Margin SVM and Kernels with CVXOPT
33. SVM Parameters
34. Clustering Introduction
35. Handling Non-Numeric Data
36. K Means with Titanic Dataset
37. Custom K Means
38. K Means from Scratch
39. Mean Shift Intro
40. Mean Shift with Titanic Dataset
41. Mean Shift from Scratch
42. Mean Shift Dynamic Bandwidth

The objective of this course is to give you a holistic understanding of machine learning, covering theory, application, and inner workings of supervised, unsupervised, and deep learning algorithms.

In this series, we'll be covering linear regression, K Nearest Neighbors, Support Vector Machines (SVM), flat clustering, hierarchical clustering, and neural networks.