
ParlayANN with Magdalen Dobson Manohar
Weaviate Podcast
Hierarchical Clustering and Minimum Spanning Trees Integration
The algorithm HC and NG combines hierarchical clustering with minimum spanning trees by initially performing hierarchical clustering on a dataset until the leaf size reaches 1000, then creating a low degree minimum spanning tree at each leaf. Subsequently, the algorithm clusters the data 30 to 50 times with different random seeds and merges the edges from all MSTs into a single connected graph, ensuring the connectivity of the final graph.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.