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
Hello,
I am currently trying to combine HDBSCAN with BranchDetector and I am not sure if the current implementation supports my use case. I use HDBSCAN single_linkage_tree to find all lambda values and then I select a smaller subset of these values as possible thresholds for the clustering cut_distance parameter. It works great and I am able to get a list of labels for a given lambda value, but I would like to find the branching clusters that are available for the given cut_distance as well.
Both BranchDetector and detect_branches_in_clusters seem to work on the whole model of HDBSCAN which lack the described flexibility and I would like to avoid calculating HDBSCAN for each cut_distance from the start. Alternatively, I would like to find branches for a specific cluster in subtree rather than passing the whole model, but I guess it might not be possible due to the nature of the algorithm.
Please let me know how I can do it, because maybe I am missing some parameter in the documentation that is crucial. Thanks!
The text was updated successfully, but these errors were encountered:
What you want is certainly not available by default. I would suggest you reach out to @JelmerBot, the author of the BranchDetector, to see if you can work out how best to implement what you need.
Hello,
I am currently trying to combine HDBSCAN with BranchDetector and I am not sure if the current implementation supports my use case. I use HDBSCAN
single_linkage_tree
to find all lambda values and then I select a smaller subset of these values as possible thresholds for the clusteringcut_distance
parameter. It works great and I am able to get a list of labels for a given lambda value, but I would like to find the branching clusters that are available for the givencut_distance
as well.Both
BranchDetector
anddetect_branches_in_clusters
seem to work on the whole model of HDBSCAN which lack the described flexibility and I would like to avoid calculating HDBSCAN for eachcut_distance
from the start. Alternatively, I would like to find branches for a specific cluster in subtree rather than passing the whole model, but I guess it might not be possible due to the nature of the algorithm.Please let me know how I can do it, because maybe I am missing some parameter in the documentation that is crucial. Thanks!
The text was updated successfully, but these errors were encountered: