Class NNDescent<O>

  • Type Parameters:
    O - Object type
    All Implemented Interfaces:
    Index, KNNIndex<O>

    @Reference(authors="W. Dong, C. Moses, K. Li",
               title="Efficient k-nearest neighbor graph construction for generic similarity measures",
               booktitle="Proc. 20th Int. Conf. on World Wide Web (WWW\'11)",
               url="https://doi.org/10.1145/1963405.1963487",
               bibkey="DBLP:conf/www/DongCL11")
    public class NNDescent<O>
    extends AbstractMaterializeKNNPreprocessor<O>
    NN-descent (also known as KNNGraph) is an approximate nearest neighbor search algorithm beginning with a random sample, then iteratively refining this sample until.

    Reference:

    W. Dong and C. Moses and K. Li
    Efficient k-nearest neighbor graph construction for generic similarity measures
    Proc. 20th Int. Conf. on World Wide Web (WWW'11)

    TODO: collect and log some query statistics.

    Since:
    0.7.5
    Author:
    Evelyn Kirner