jg-you/dyvider
Dynamic programming algorithms for exact linear clustering in networks.
This tool helps researchers and data scientists segment interconnected data points (networks) based on their one-dimensional positions. You provide a network where each point has a numerical position, and it outputs the optimal way to group these points into linear clusters. It's designed for anyone working with network data who needs to find precise, non-overlapping groupings.
No commits in the last 6 months. Available on PyPI.
Use this if you have a network where nodes are ordered along a single dimension and you need to find the best possible way to divide them into distinct, consecutive groups.
Not ideal if your network nodes don't have a natural one-dimensional ordering or if you need to find overlapping or non-linear clusters.
Stars
16
Forks
3
Language
Python
License
MIT
Category
Last pushed
Jul 04, 2023
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/jg-you/dyvider"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
scikit-learn-contrib/hdbscan
A high performance implementation of HDBSCAN clustering.
annoviko/pyclustering
pyclustering is a Python, C++ data mining library.
panagiotisanagnostou/HiPart
Hierarchical divisive clustering algorithm execution, visualization and Interactive visualization.
erdogant/clusteval
Clusteval provides methods for unsupervised cluster validation
mqcomplab/MDANCE
MDANCE: O(N) clustering for molecular dynamics. Process 1.5M frames in 40min. 8 specialized algorithms.