A package to quickly identify unbiased graph-based clusterings via parameter optimization in Python
Project description
This Scanpy-compatible package provides the ability to iterative compute clusterings using graph-based on combinations of resolution and KNN. At each point in this search space, a metric, such as silhouette score, is computed. The solution from this search space that maximizes the metric results in an optimal unbiased clustering solution. This process is sped up by our subsampling and diffusion feature that provides a near-identical solution in a much shorter time.
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
acdc_py-1.0.0.tar.gz
(29.5 kB
view hashes)
Built Distribution
acdc_py-1.0.0-py3-none-any.whl
(36.8 kB
view hashes)