Skip to content
#

silhouette-score

Here are 9 public repositories matching this topic...

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.

  • Updated Nov 19, 2021
  • Python

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.

  • Updated Mar 26, 2022
  • Python

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".

  • Updated Mar 16, 2021
  • Python

Improve this page

Add a description, image, and links to the silhouette-score 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 silhouette-score topic, visit your repo's landing page and select "manage topics."

Learn more