search trees tend not to scale well to higher dimensions though, right? from wha... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		xavxav 43 days ago \| parent \| context \| favorite \| on: Flash-KMeans: Fast and Memory-Efficient Exact K-Me... search trees tend not to scale well to higher dimensions though, right? from what I've seen I had the impression that Yinyang k-means was the best way to take advantage of the sparsity.

snovv_crash 43 days ago [–]

Most data I've used is for geospatial with D<=4 (xyzt) so for me search trees worked great. But for things like descriptor or embedding clustering yes, trees wouldn't be useful.

Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact