计算机应用与软件2025，Vol.42Issue(10)：53-65,13.DOI:10.3969/j.issn.1000-386x.2025.10.008
基于切比雪夫距离的孪生子序列K近邻搜索
K-NEAREST NEIGHBOR SEARCH OF TWIN SEQUENCES BASED ON CHEBYSHEV DISTANCE
摘要
Abstract
In order to improve the search accuracy of twin sequences and reduce the computational cost,a new K nearest neighbor search method based on Chebyshev distance is proposed.A tree-based index TI was introduced,which pruned the search space by using the appropriate boundaries in its nodes.An optimization method was introduced to improve the memory of the index by batch loading,so as to prevent the performance from deteriorating and reduce its search cost.Based on Chebyshev distance,the twin sequence K nearest neighbor search algorithm was implemented on the index.The experimental results show that the proposed method can achieve efficient and high-precision search.关键词
孪生序列/切比雪夫距离/K近邻搜索/优化Key words
Twin sequence/Chebyshev distance/K nearest neighbor search/Optimization分类
计算机与自动化引用本文复制引用
李宝海,田芙蓉,段振华..基于切比雪夫距离的孪生子序列K近邻搜索[J].计算机应用与软件,2025,42(10):53-65,13.基金项目
国网青海信通公司数据智能盘点系统建设与应用实施项目(0710293030). （0710293030）
