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
Release history Release notifications | RSS feed
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.10-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 8520013bb7c9a3d70d3013bc0eaa5aa58b4082664b680749a33a92953f7f735c |
|
MD5 | 28742634f2a8061beaf83d9b14b56260 |
|
BLAKE2b-256 | d6e1bbb426abd3bf32770bb65ba2b7b826d201bdff0642c23b8489738cb7eb5a |