- K-Means clustering: The function “k-means" partitions data into k mutually exclusive clusters and returns the index of the cluster to which it assigns each observation. Requires number of clusters. (https://www.mathworks.com/help/stats/k-means-clustering.html )
- K-medoids Clustering: “K-medoids” is like “K-means” but is more robust to noise and outliers. Requires number of clusters too. (https://www.mathworks.com/help/stats/kmedoids.html)
- DBSCAN (Density-Based Spatial Clustering of Applications with Noise): Unlike “k-means” clustering, the ”DBSCAN” algorithm does not require prior knowledge of the number of clusters. It works with distance metrics and can be applied to discrete data.(https://www.mathworks.com/help/stats/dbscan-clustering.html)
- Gaussian Mixture Models (GMM): “GMM” clustering can accommodate clusters that have different sizes and correlation structures within them.(https://www.mathworks.com/help/stats/clustering-using-gaussian-mixture-models.html)
