Weight-based Subspace Clustering
Project description
PySubCMedians
Authors: Sergio Peignier, Christophe Rigotti, Anthony Rossi and Guillaume Beslon
Python implementation of the SubCMedians algorithm. SubCMedians is a Subspace Clustering algorithm that extends the K-medians paradigm. SubCMedians is a simple hill climbing algorithm based on stochastic weighted local exploration steps. This median based algorithm exhibits satisfactory quality clusters when compared to well-established paradigms, while medians have still their own interests depending on the user application (robustness to noise/outliers and location optimality). Detailled description available in the paper "Weight-based search to find clusters around medians in subspaces" presented in the ACM SAC conference 2018.
Installation
Dependencies :
- numpy
- pandas
- seaborn
- scikit-learn
- scipy
- tqdm
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for SubCMedians-0.0.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 6f25afe87d5d2764dd65d1fa888de45f25a78594d16ba9587f6cfcf54fbe2364 |
|
MD5 | 67e05c83377f1349e99750daf9513c98 |
|
BLAKE2b-256 | 56b2d14788fa3b0b87f8f3b04173c9075c947944a0d81dda736dec6b1d9c266c |