It's the HAC algorithm that Im using to sort newspaper articles by news. You can adapt it to pretty much any type of text.
-
Updated
Jul 22, 2020 - Python
It's the HAC algorithm that Im using to sort newspaper articles by news. You can adapt it to pretty much any type of text.
A customer profiling project based on RFM (Recency, Frequency, Monetary) analysis using a dataset from an online retail company in the United Kingdom. The aim is to identify customer habits and create personalized marketing strategies for targeted advertising.
OptimalCluster is the Python implementation of various algorithms to find the optimal number of clusters. The algorithms include elbow, elbow-k_factor, silhouette, gap statistics, gap statistics with standard error, and gap statistics without log. Various types of visualizations are also supported.
Implemented an auto-clustering tool with seed and number of clusters finder. Optimizing algorithms: Silhouette, Elbow. Clustering algorithms: k-Means, Bisecting k-Means, Gaussian Mixture. Module includes micro-macro pivoting, and dashboards displaying radius, centroids, and inertia of clusters. Used: Python, Pyspark, Matplotlib, Spark MLlib.
This repository contains all program files and datasets used in implementation of Masters Thesis Research Work for the topic - "Efficient Clustering via Kernel Principal Component Analysis and Optimal One Dimensional Clustering".
Pytorch implementation of standard metrics for clustering
A customer profiling project based on RFM (Recency, Frequency, Monetary) analysis using a dataset from an online retail company in the United Kingdom. The aim is to identify customer habits and create personalized marketing strategies for targeted advertising.
Clustering K-Means with Streamlit App Deployment
Add a description, image, and links to the silhouette-score topic page so that developers can more easily learn about it.
To associate your repository with the silhouette-score topic, visit your repo's landing page and select "manage topics."