Closed afender closed 3 years ago
Ref: #1783
This issue has been marked rotten due to no recent activity in the past 90d. Please close this issue if no further response or action is needed. Otherwise, please respond with a comment indicating any updates or changes to the original issue and/or confirm this issue still needs to be addressed.
This issue has been marked stale due to no recent activity in the past 30d. Please close this issue if no further response or action is needed. Otherwise, please respond with a comment indicating any updates or changes to the original issue and/or confirm this issue still needs to be addressed. This issue will be marked rotten if there is no activity in the next 60d.
This issue has been labeled inactive-90d
due to no recent activity in the past 90 days. Please close this issue if no further response or action is needed. Otherwise, please respond with a comment indicating any updates or changes to the original issue and/or confirm this issue still needs to be addressed.
Minimum spanning trees come up in hierarchical clustering is to enable a single-linkage clustering and the ability to draw dendrograms like Scipy's hierarchy package, which also enables HDBSCAN.
The kernels are being implemented in RAFT since it could also be used un cuGraph in the long run : https://github.com/rapidsai/raft/issues/52
Solution
Parallel Baruvka algorithm supporting disconnected components. It is similar to Louvain in the sense it starts from all vertices as seeds and aggregate vertices into super vertices based on edge weights.
relevant papers :
Alternatives considered Specific solutions for KNN-graphs. While this allows some optimizations, a more generic solution would have more benefits for the whole RAPIDS platform