### Table 3 Mean query time (in ms.) for k-nearest neighbor search k

"... In PAGE 22: ...xtent e = 0.005 were used. However, instead of searching for only the single nearest neighbor, we searched for the k-nearest neighbors of each query point. Table3 illustrates the mean query time for the k-nearest neighbor search, k = 2, 4, .... ..."

### Table 5 Missclassi cation Rates for Nearest Neighbor

1996

"... In PAGE 17: ... A Euclidean metric was used with each coordinate standardized by dividing by its standard deviation over the learning set. See Table5 for the results: Table 5 Missclassi cation Rates for Nearest Neighbor... ..."

Cited by 1581

### Table 8: Nearest Neighbors Method

"... In PAGE 11: ...Table 8: Nearest Neighbors Method for every two objects x; y 2 U the Euclidean distance is de ned as: E (x; y) = qPa2A (a (x) ? a (y))2: For di erent number of nearest neighbors k we obtain the leave-one-out results presented in Table8 and on the Figure 1. Nearest Neighbors Method 0 20 40 60 80 100 1 2 3 4 5 6 Classification accuracy Figure 1: Nearest Neighbors Method 7 Conclusions The diabetes mellitus data set has been drawn from a real life medical problem.... ..."

### Table 5: Respective Nearest Neighbors Rank Respective Nearest Neighbors Similarity

1998

"... In PAGE 6: ... Our program found 622 pairs of RNNs among 5230 nouns that occurred at least 50 times in the parsed corpus. Table5 shows one in every 10 RNNs. The list of RNNs looks strikingly good.... ..."

Cited by 32

### Table 2: Sample pro#0Cles of nearest-neighbors search algorithm.

"... In PAGE 6: ... Figure 6 illustrates the graceful computation degradation capability of the nearest-neighbors search algorithm for the sequence foreman at QCIF and CIF resolutions. The #0Cgure shows the rate-distortion performance of the full search algorithm and the nearest-neighbors search algorithm, for the basic, low-computation, and high-quality pro#0Cles outlined in Table2 . Clearly, even for di#0Ecult sequences, the high-quality pro#0Cle can achieve a performance level that is close to that of the full search algorithm.... ..."

### Table 5: Respective Nearest Neighbors Rank Respective Nearest Neighbors Similarity

"... In PAGE 6: ... Our program found 622 pairs of RNNs among 5230 nouns that occurred at least 50 times in the parsed corpus. Table5 shows one in every 10 RNNs. The list of RNNs looks strikingly good.... ..."

### Table 2: Respective Nearest Neighbors Rank Respective Nearest Neighbors Similarity

### Table 3: Edge reciprocity in the different sampling strategies.

"... In PAGE 4: ...on average 12% of the out-neighbors of a node have a link back to it. As shown in Table3 , all the strategies perform reasonably well except for the small sub-sample (10%) of the OPIC strategy. This overestimates the edge reciprocity by a factor of 50%, while breadth-first search underestimated the edge reciprocity by a factor of 20% when sub-sampling half of the... ..."