Fig. 9From: OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchainComparison of algorithms in MNIST dataset. a k versus the find nearest time between different methods. b k versus the hashing time between different methods. c k versus the rate of candidates between different methods. d k versus the precision between different methods. e k versus the recall between different methods. f k versus the value of F1between different methods. g k versus the cost of memory between different methodsBack to article page