3 ms·
This could make for an interesting UI for exploring clusters in data. I only wish K-d trees could handle higher dimensions
by lukeplato 2y ago
This could make for an interesting UI for exploring clusters in data. I only wish K-d trees could handle higher dimensions
- enizor2 2y agoWhat do you mean ? A K-d tree handles k dimensions. Generating a useful 2-D representation (=projection) of more dimensions is the hard part.
- lukeplato 2y agoI remember reading that for k-d trees to be able to split on k dimensions the dataset needs to be > 2^k, which becomes unwieldy pretty quickly
- russfink 2y ago… yes to the 2^k only because if not met, the performance devolves to a linear search. By themselves, k-d trees can handle any number of records.
- vrtnis 2y agoyep, also i think while they could have issues with dataset sizes less than 2^k, it's interesting to note their use in accelerating clustering algos like dbscan. they do make neat visualizations though https://marimo.app/?slug=x5fa0x https://marimo.app/?slug=x5fa0x
- azeirah 2y agoYou'll love this site :) https://treevis.net/ https://treevis.net/
- jhurliman 2y agoFor low dimensional (such as 2D) projections of high dimensional data, especially useful for visualization, take a look at UMAP - https://umap-learn.readthedocs.io/en/latest/ https://umap-learn.readthedocs.io/en/latest/