Location difference of multiple distances based k-nearest neighbors algorithm

Shuyin Xia, Zhongyang Xiong, Yueguo Luo, Limei Dong, Guanghua Zhang

Abstract: Highlights•The “location difference of multiple distances” and a method LDMDBA are proposed.•LDMDBA has a time complexity of O(logdnlogn) and does not rely on tree structures.•Only LDMDBA can be efficiently applied to high dimensional data.•LDMDBA has a time complexity of (logdlogn) for predicting a new data point.•LDMDBA has very good stability and can be applied to large databases.