A concurrency control algorithm for nearest neighbor query-Reference-Cited by-同舟云学术

A concurrency control algorithm for nearest neighbor query

Published:1999-03 Issue:1-4 Volume:114 Page:187-204
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Chen J.K.,Chin Y.H.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference15 articles.

1. The R*-tree: An efficient and robust access method for points and rectangles;Beckmann,1990

2. GENESYS: A system for efficient spatial query processing;Brinkhoff,1994

3. A study of concurrent operations on R-trees;Chen;Inform. Sci.,1987

4. Simulation model design and execution;Fishwick,1995

5. An algorithm for finding the best matches in logarithmic expected time;Friedman;ACM Trans. on Math. Software,1977

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sampling technique for noisy and borderline examples problem in imbalanced classification;Applied Soft Computing;2023-07

2. A novel synthetic minority oversampling technique based on relative and absolute densities for imbalanced classification;Applied Intelligence;2022-04-21

3. A novel oversampling technique for class-imbalanced learning based on SMOTE and natural neighbors;Information Sciences;2021-07

4. SMOTE-NaN-DE: Addressing the noisy and borderline examples problem in imbalanced classification by natural neighbors and differential evolution;Knowledge-Based Systems;2021-07

5. Reverse k -nearest neighbor search in the presence of obstacles;Information Sciences;2016-02