Skip to content
#

agglomerative-clustering

Here are 249 public repositories matching this topic...

This project shows how to perform customers segmentation using Machine Learning algorithms. Three techniques will be presented and compared: KMeans, Agglomerative Clustering ,Affinity Propagation and DBSCAN.

  • Updated Oct 19, 2020
  • Jupyter Notebook

The project involves performing clustering analysis (K-Means, Hierarchical clustering, visualization post PCA) to segregate stocks based on similar characteristics or with minimum correlation. Having a diversified portfolio tends to yield higher returns and face lower risk by tempering potential losses when the market is down.

  • Updated Jan 20, 2022
  • Jupyter Notebook

Assignment-08-PCA-Data-Mining-Wine data. Perform Principal component analysis and perform clustering using first 3 principal component scores (both heirarchial and k mean clustering(scree plot or elbow curve) and obtain optimum number of clusters and check whether we have obtained same number of clusters with the original data (class column we h…

  • Updated Jul 3, 2021
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the agglomerative-clustering topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the agglomerative-clustering topic, visit your repo's landing page and select "manage topics."

Learn more