Pages that link to "Item:Q4419531"
From MaRDI portal
The following pages link to PCA-based branch and bound search algorithms for computing K nearest neighbors (Q4419531):
Displaying 3 items.
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions (Q2459569) (← links)
- Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820) (← links)
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (Q2654256) (← links)