New methods of strong neighborhood pair query

doi:10.3778/j.issn.1002-8331.2009.27.037

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (27): 123-126.DOI: 10.3778/j.issn.1002-8331.2009.27.037

• 数据库、信号与信息处理 • Previous Articles Next Articles

New methods of strong neighborhood pair query

ZHANG Li-ping¹，LI Song²，LIU Wen-qiang³，WANG Hong¹

1.Department of Electronic and Information Engineering，Liaoning Technical University，Huludao，Liaoning 125105，China
2.Department of Computer Science and Technology，Harbin University of Science and Technology，Harbin 150080，China
3.College of Computer & Information Engineering，Heilongjiang Institute of Science and Technology，Harbin 150027，China

Received:2009-03-17 Revised:2009-06-01 Online:2009-09-21 Published:2009-09-21
Contact: ZHANG Li-ping

强邻近对查询的新方法

张丽平¹，李松²，刘文强³，王红¹

1.辽宁工程技术大学电子与信息工程学院，辽宁葫芦岛 125105
2.哈尔滨理工大学计算机科学与技术学院，哈尔滨 150080
3.黑龙江科技学院计算机与信息工程学院，哈尔滨 150027

通讯作者: 张丽平

Abstract

Abstract: The strong neighborhood pair query has important significance in spatial database and multimedia database etc.The double Voronoi diagrams method that deal with the strong neighborhood pair query in the datasets without barriers is presented.Furthermore，according to the features of the blocking about the data points pairs with barriers，the filtration regions are proposed and the data points pairs are handled.Thus，the decision range and the redundant computation are decreased.Theoretical analysis and the experiment show that the method has a wide applicability and significantly increases the query efficiency of the strong neighborhood pair.

Key words: strong neighborhood pair, barry line, nearest neighbor, Voronoi diagram

摘要： 数据集中有关数据点的强邻近对查询问题在空间数据库和多媒体数据库等领域具有着重要的意义。针对数据规模和数据点分布较为相似的两个数据集设计了双Voronoi图法处理无障碍物环境下的强邻近对查询问题。进而，在有障碍物环境下，根据数据点对被阻断的特点，提出了过滤区域的概念，分情况对数据点对进行处理，缩小了判定范围，减小了大量的冗余计算。理论分析和实验表明该方法具有更广的适用范围，显著提高了强邻近对的查询效率。

关键词: 强邻近对, 障碍线, 最近邻, Voronoi图

CLC Number:

TP311

ZHANG Li-ping¹，LI Song²，LIU Wen-qiang³，WANG Hong¹. New methods of strong neighborhood pair query[J]. Computer Engineering and Applications, 2009, 45(27): 123-126.

张丽平¹，李松²，刘文强³，王红¹. 强邻近对查询的新方法[J]. 计算机工程与应用, 2009, 45(27): 123-126.

[1]	LAN Hong, HUANG Min. Fusion of KNN Optimized Density Peaks and FCM Clustering Algorithm [J]. Computer Engineering and Applications, 2021, 57(9): 81-88.
[2]	LEI Henglin, Gulanbaier Tuerhong, Mairidan Wushouer, ZHANG Dongmei. Review of Novelty Detection [J]. Computer Engineering and Applications, 2021, 57(5): 47-55.
[3]	WANG Le, HAN Meng, LI Xiaojuan, ZHANG Ni, CHENG Haodong. Review of Classification Methods for Unbalanced Data Sets [J]. Computer Engineering and Applications, 2021, 57(22): 42-52.
[4]	CHEN Qianru, LI Yali, XU Kequan, LIU Yilong, WANG Shuqin. WKNN Feature Selection Method Based on Self-Tuning Adaptive Genetic Algorithm [J]. Computer Engineering and Applications, 2021, 57(20): 164-171.
[5]	MENG Dongxia，LI Yujian. Oversampling Method for Unbalanced Data by Natural Nearest Neighbor [J]. Computer Engineering and Applications, 2021, 57(2): 91-96.
[6]	CAI Ruiguang, ZHANG Desheng, ZHANG Xiao. Bidirectional Selection-Based Pseudo Nearest Neighbor Algorithm [J]. Computer Engineering and Applications, 2021, 57(13): 102-107.
[7]	WANG Caiwen, YANG Youlong. Improved Nearest Neighbor Classification Algorithm for Imbalanced Data [J]. Computer Engineering and Applications, 2020, 56(7): 30-38.
[8]	ZHENG Yi, MA Yingcang, YANG Xiaofei, XU Qiuxia. Sparse Subspace Clustering Based on [k]-Nearest Neighbors and Local Similarity [J]. Computer Engineering and Applications, 2020, 56(4): 99-108.
[9]	WANG Zhen, SUN Fuzhen, ZHANG Longbo, WANG Lei. Ambiguous Ranking Perceptual Hashing [J]. Computer Engineering and Applications, 2020, 56(21): 123-130.
[10]	HUANG Xin, MO Haimiao, ZHAO Zhigang, ZENG Min. Research on Discrete Enhanced Fireworks Algorithm and [kNN] in Feature Selection [J]. Computer Engineering and Applications, 2020, 56(16): 112-117.
[11]	TAN Qing, HUANG Zhangcan. Krill Herd with Nearest Neighbor Lasso Operator [J]. Computer Engineering and Applications, 2019, 55(9): 124-129.
[12]	LI Wenjie, YAN Shiqiang, JIANG Ying, ZHANG Songzhi, WANG Chengliang. Research on Method of Self-Adaptive Determination of DBSCAN Algorithm Parameters [J]. Computer Engineering and Applications, 2019, 55(5): 1-7.
[13]	LIU Yuxin, HE Guanghui. Sparse Subspace Clustering with [k] Nearest Neighbor Constraint [J]. Computer Engineering and Applications, 2019, 55(3): 39-45.
[14]	GONG Yanlu, LV Jia. Co-Training Method Combined with Semi-Supervised Clustering and Weighted [K]-Nearest Neighbor [J]. Computer Engineering and Applications, 2019, 55(22): 114-118.
[15]	GAO Yue, YANG Xiaofei, MA Yingcang, WANG Yirui. Density Peak Clustering Based on Shared [k]-Nearest Neighbors and Shared Reverse Nearest Neighbors [J]. Computer Engineering and Applications, 2019, 55(20): 43-51.

New methods of strong neighborhood pair query

强邻近对查询的新方法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics