Technique | Description |
1. Partitioned Clustering | With the help of “n” data points maximum possible of “k” clusters is obtained by relocating objects to “k” clusters. |
2. Hierarchical Clustering | Data points are partitioned in tree form either top-down or bottom-up. |
3. Density-based Clustering | It can handle cluster of any arbitrary shape whereas above two can handle only spherical shape clusters. |