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.6-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | cd0c5fd1f6589a7d8583e5c8d57cb8a0a3f8275b49d5dc168d118085a1c22cbf |
|
MD5 | ffa84c31aca3f4d96d4c6ffd8418ef3a |
|
BLAKE2b-256 | 1f6a0d4ec89495caf637e25f8da44aaf80059b0850ef4c2d30f8e1236330168c |