4min snip

Weaviate Podcast cover image

ParlayANN with Magdalen Dobson Manohar

Weaviate Podcast

NOTE

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

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode