Improving the Ability of Mining for Multi-dimensional Data
In this paper, we present continuous research on data analysis based on our previous work on similarity search problems. PanKNN is a novel technique which explores the meaning of K nearest neighbors from a new perspective, redefines the distances between data points and a given query point Q, and efficiently and effectively selects data points which are closest to Q. It can be applied in various data mining fields. In this paper, we present our approach to improving the scalability of the PanKNN algorithm. This proposed approach can assist to improve the performance of existing data analysis technologies, such as data mining approaches in Bioinformatics.