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.8-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d8b1c5eb4a80cc58434973d654a1b732b18f630a671aea9471a7f9a9b1f75834 |
|
MD5 | 1f11c089e8d85ab2befc97450c963ba0 |
|
BLAKE2b-256 | ac15a812b62a8b86d52907bc9ffca6aabb81afb6f1315b07cce0b12ce0ec9741 |