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.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | cab0bd39b426a8bba87f965b4ca3778e94ca401321ea32f7b94bf187d62e8fcf |
|
MD5 | fc4f42a43175462a84f2660969c21f6f |
|
BLAKE2b-256 | f8d8cb00c13359abff954630327deaeda5155a5e083b320c06ee03a65a39b11a |