Programming Throwdown cover image

Machine Learning Embeddings with Edo Liberty

Programming Throwdown

00:00

Is There a Tree in High Dimensional Data?

Because the clustering is centred around dense areas, the chance that you're not in one of those dense areas is impossibly small. That's why vectoindixs are hard to build because they are themselves like a model of data. And whether we like it or not, its some data is sometimes like that. How does clustering not that same problem? It does. I mean, i think thee asked about caty trees and like bulls and si ant just may me to explain to the audience. If you to cover your data with bowls of radius one half, every bone will contain one data point, there would be no tree. Righ, what i'm saying

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app