Unsupervised learning

There is no dependant or target variable. Hence no prediction. Can do only

segmentation and find the patterns in the data.

All data is unlabeled and the algorithms learn to inherent structure from the
input data.

Unsupervised learning is where you only have input data (X) and no
corresponding output variables.

The goal for unsupervised learning is to model the underlying structure or

distribution in the data in order to learn more about the data.

These are called unsupervised learning because unlike supervised learning

above there is no correct answers and there is no teacher. Algorithms are left to
their own devises to discover and present the interesting structure in the data.

Unsupervised learning problems can be further grouped into clustering and

association problems.

Clustering: A clustering problem is where you want to discover the inherent

groupings in the data, such as grouping customers by purchasing behaviour.

Association: An association rule learning problem is where you want to

discover rules that describe large portions of your data, such as people that buy
X also tend to buy Y.

Some popular examples of unsupervised learning algorithms are:

k-means for clustering problems.

Apriori algorithm for association rule learning problems.

Cluster analysis

MBA

Association Analysis
Unsupervised learning allows us to approach problems with little or no idea
what our results should look like. We can derive structure from data where we
don't necessarily know the effect of the variables.

We can derive this structure by clustering the data based on relationships among
the variables in the data.

With unsupervised learning there is no feedback based on the prediction results.

Example:

Clustering: Take a collection of 1,000,000 different genes, and find a way to

automatically group these genes into groups that are somehow similar or related
by different variables, such as lifespan, location, roles, and so on.

Non-clustering: The "Cocktail Party Algorithm", allows you to find structure in

a chaotic environment. (i.e. identifying individual voices and music from a
mesh of sounds at a cocktail party).