Fast exact \(k\) nearest neighbors search using an orthogonal search tree (Q962830): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improvement of the fast exact pairwise-nearest-neighbor algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image restoration of compressed image using classified vector quantization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest neighbor pattern classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Computing k-Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinements to nearest-neighbor searching in k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and versatile algorithm for nearest neighbor search based on a lower bound tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast \(k\)-nearest-neighbor search based on projection and triangular inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665986 / rank
 
Normal rank

Revision as of 16:36, 2 July 2024

scientific article
Language Label Description Also known as
English
Fast exact \(k\) nearest neighbors search using an orthogonal search tree
scientific article

    Statements

    Identifiers