Patent Document ID: 9552408
Application ID: 14163751
Patent Flag: 1

Claim One:
1. A computer-implemented method for estimating a nearest neighbor to a target data vector in a dataset, comprising: receiving, by a computer system, a request to determine the nearest neighbor to the target data vector; determining, by the computer system, a preliminary clustering of the dataset, the preliminary clustering comprising multiple preliminary clusters, the determining including: for an initial set of clusters of the dataset, computing a centroid for each cluster in the initial set of clusters, hashing, by the computer system, the centroids into a set of buckets, identifying a subset of the centroids that is hashed into the set of buckets into which a specified data vector from the dataset is hashed, determining a centroid from the subset of the centroids that is nearest to the specified data vector, and classifying the specified data vector into a first preliminary cluster, of the preliminary clusters, that corresponds to the centroid; redistributing, by the computer system, data vectors between at least two of the preliminary clusters to produce at least two redistributed clusters, the target data vector included in a first of the at least two redistributed clusters; transmitting, by the computer system, the first of the at least two redistributed clusters to a first computer system and a second of the at least two redistributed clusters to a second computer system; estimating, by the first computer system, a nearest neighbor of the target data vector within the first of the two redistributed clusters, wherein the nearest neighbor is one of multiple data vectors in the dataset that is most similar to the target data vector; and outputting, by the first computer system and in response to the request, information of the nearest neighbor to a user.