Data Clusters

Clusters are collections of data based on similarity.

Data points clustered together in a graph can often be classified into clusters.

In the graph below we can distinguish 3 different clusters:

Clusters can hold a lot of valuable information, but clusters come in all sorts of shapes, so how can we recognize them?

Clustering is a type of Unsupervised Learning .

• Density Method
• Hierarchical Method
• Partitioning Method
• Grid-based Method

The Density Method considers points in a dense regions to have more similarities and differences than points in a lower dense region. The density method has a good accuracy. It also has the ability to merge clusters. Two common algorithms are DBSCAN and OPTICS.

The Hierarchical Method forms the clusters in a tree-type structure. New clusters are formed using previously formed clusters. Two common algorithms are CURE and BIRCH.

The Grid-based Method formulates the data into a finite number of cells that form a grid-like structure. Two common algorithms are CLIQUE and STING

The Partitioning Method partitions the objects into k clusters and each partition forms one cluster. One common algorithm is CLARANS.

The Correlation Coefficient (r) describes the strength and direction of a linear relationship and x/y variables on a scatterplot.

The value of r is always between -1 and +1:

Perfect Downhill -1.00 :