Method for operating modified k nearest neighbor graph generation device and modified k nearest neighbor graph generation device

摘要

To achieve high retrieval accuracy, nearest neighbor retrieval using a k-nearest neighbor graph can realize high retrieval accuracy, but since nodes are connected only at a limited number of directed edges, they can not be traced in a separated graph, namely, a search A path is generated. This may result in omission of searches and an increase in calculation processing amount.SOLUTION: In a k-nearest neighbor graph, a modification which alters by adding a directed edge already connected between nodes connected by only one directed edge and a reverse edge which is a directed edge in the opposite direction A k-nearest neighbor graph generation device which generates a k-nearest neighbor graph and searches using the modified k nearest neighbor graph is provided.(FIG.