New answers tagged

0 votes

scaling before hierarchical clustering by single and complete linkage

thanks for answering my question. I have some additional questions that hopefully you can answer. Thx in adv There is correlation based calculation which is another dissimilarity measure. If we did ...
user154721's user avatar
1 vote

scaling before hierarchical clustering by single and complete linkage

Brief Summary Yes, a wider-range-variable would dominate the single linkage clustering without scaling. Explanation The tendency of wider-range-variables to dominate the clustering does not only apply ...
Broele's user avatar
  • 1,147
2 votes

Solve tough clustering problem with overlapping clusters

The Problem is that many clustering algorithms focus on distances (between points, clusters and so on). Especially at the connection between the two desired clusters, distances between points are ...
Broele's user avatar
  • 1,147
0 votes

Is there a way to automatically split large clusters that are greater than some maximum number of points?

There isn't a max cluster size parameter for HDBSCAN. What I would suggest is trying to work with the other parameters. For example tweaking min_samples or ...
Nedyalko Yordanov's user avatar
1 vote

How to run AgglomerativeClustering on a big data in python?

Counterintuitively, using a precomputed distance matrix (metric="precomputed") reduces runtime.
Chris Coffee's user avatar
0 votes

Text Classification Taking too long

If you have a GPU you can use cuml.DBSCAN which will be 100x faster than running on CPU and has the same API/ parameters as sklearns DBSCAN https://docs.rapids.ai/api/cuml/nightly/api/#clustering
Christof Henkel's user avatar
1 vote
Accepted

Text Classification Taking too long

KMeans and MiniBatch K-Means are generally faster than DBSCAN for large datasets. The fact ...
Harshad Patil's user avatar

Top 50 recent answers are included