You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+13-3Lines changed: 13 additions & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -17,6 +17,17 @@ Radius clustering is a Python package that implements clustering under radius co
17
17
- Compatible with scikit-learn's API for clustering algorithms
18
18
- Supports radius-constrained clustering
19
19
- Provides options for exact and approximate solutions
20
+
- Easy to use and integrate with existing Python data science workflows
21
+
- Includes comprehensive documentation and examples
22
+
- Full test coverage to ensure reliability and correctness
23
+
- Supports custom MDS solvers for flexibility in clustering approaches
24
+
- Provides a user-friendly interface for clustering tasks
25
+
26
+
> [!CAUTION]
27
+
> **Deprecation Notice**: The `threshold` parameter in the `RadiusClustering` class has been deprecated. Please use the `radius` parameter instead for specifying the radius for clustering. It is planned to be completely removed in version 2.0.0. The `radius` parameter is now the standard way to define the radius for clustering, aligning with our objective of making the parameters' name more intuitive and user-friendly.
28
+
29
+
> [!NOTE]
30
+
> **NEW VERSIONS**: The package is currently under active development for new features and improvements, including some refactoring and enhancements to the existing codebase. Backwards compatibility is not guaranteed, so please check the [CHANGELOG](CHANGELOG.md) for details on changes and updates.
20
31
21
32
## Roadmap
22
33
@@ -45,7 +56,7 @@ from radius_clustering import RadiusClustering
@@ -116,5 +127,4 @@ The Radius Clustering work has been funded by:
116
127
117
128
-[1][An iterated greedy algorithm for finding the minimum dominating set in graphs](https://www.sciencedirect.com/science/article/pii/S0378475422005055)
118
129
-[2][An exact algorithm for the minimum dominating set problem](https://dl.acm.org/doi/abs/10.24963/ijcai.2023/622)
119
-
120
-
130
+
-[3][Clustering under radius constraint using minimum dominating set](https://link.springer.com/chapter/10.1007/978-3-031-62700-2_2)
0 commit comments