This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure for each feature point in the lp metric space, this algorithm can save a large amount of computation at the expense of moderate preprocessing and twice the memory storage. Given a query point, the cost for computing the distances from this p...

A novel approach for k-nearest neighbor (k-NN) searching with Euclidean metric is described. It is well known that many sophisticated algorithms cannot beat the brute-force algorithm when the dimensionality is high. In this study, a probably correct approach, in which the correct set of k-nearest neighbors is obtained in high probability, is proposed for greatly reducing the searching time. We ...

In this paper, we present a fast and versatile algorithm which can rapidly perform a variety of nearest neighbor searches. Efficiency improvement is achieved by utilizing the distance lower bound to avoid the calculation of the distance itself if the lower bound is already larger than the global minimum distance. At the preprocessing stage, the proposed algorithm constructs a lower bound tree (...

Acanthopanacis cortex has been used in clinical applications for a long time. Considering some historical and geographical factors, Acanthopanacis cortex is easily confused with other herbs in medicine markets, thereby causing potential safety issues. In this study, we used the internal transcribed spacer 2 (ITS2) barcode to identify 69 samples belonging to six species, including Acanthopanacis...

the main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on tm and etm+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. in this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...