An approach to reshaping clusters for nearest neighbor search

Abstract

In this paper, we present our research on similarity search and clustering problems. Similarity search problems define the distances between data points and a given query point Q, efficiently and effectively selecting data points which are closest to Q. Clustering algorithms separate data points into different groups, in a way that data points in the same group have high similarity and data points from different groups are different from each other. In this paper, we explore the meaning of clusters from a new perspective, and propose an approach to reshape the clusters based on K nearest neighbor search results. The reconstructed clusters can help improve the performance of the following K nearest search process. © 2012 Springer-Verlag.