FAST INDEXING WITH GRAPHS AND COMPACT REGRESSION CODES ON ONLINE SOCIAL NETWORKS

摘要

In one embodiment, a method Includes receiving a query comprising a query content object and constraints, generating a feature vector representing the query content object accessing a sparse graph comprising nodes corresponding to candidate content objects represented by compact codes and links connecting the nodes, selecting an entry node, selecting similar content objects iteratively by identifying linked nodes of the entry node, decompressing the compact codes representing candidate content objects to generate feature vectors, selecting zero or more similar content objects based on a comparison between the feature vector representing the query content object and the feature vectors representing the candidate content objects, returning the selected similar content objects if a completion condition is satisfied, else repeating the iterative selection by rising a linked node corresponding to a most similar content object as the entry node, and sending instructions for presenting one or more of the selected similar content objects.