This paper introduces an improved ANN (All Nearest Neighbor) algorithm using the SCL (Standard Clustered Loop) algorithm to reduce the consumption of computing resources that can occur when searching for the data object nearest to the query object in the process of executing the algorithm. Additionally, a method to improve ANN algorithm is proposed. When the algorithm is executed, it is a situation in which the user finds a data object adjacent to the user. In this case, our technique applies the criteria set provided by users.
ACKNOWLEDGMENT This research was supported by the MIST(Ministry of Science and ICT), Korea, under the National Program for Excellence in SW supervised by the IITP (Institute for Information & communications Technology Promotion) (20150009080031001).