Pages that link to "Item:Q2575820"
From MaRDI portal
The following pages link to Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820):
Displaying 8 items.
- Refinements to nearest-neighbor searching in k-dimensional trees (Q802864) (← links)
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree (Q854189) (← links)
- A memetic algorithm for evolutionary prototype selection: A scaling up approach (Q931710) (← links)
- Random projection-based auxiliary information can improve tree-based nearest neighbor search (Q2055550) (← links)
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions (Q2459569) (← links)
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (Q2654256) (← links)
- (Q3403220) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)