A Distribution Agnostic Rank-Based Measure for Proximity Search
Proximity search is extensively used in modern machine learning algorithms across various applications. Proximity search aims at finding data points which are close to the data point of interest. Extant algorithms depend on distance-based metrics to find the closest data points. However, these metri...
Saved in:
Main Authors: | Mayur Garg, Ashutosh Nayak, Rajasekhara Reddy Duvvuru Muni |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2025-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10815932/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Distributed nearneighbor search algorithm based on real-time traffic information in dynamic road network
by: Chen YE, et al.
Published: (2014-12-01) -
INRNet: Neighborhood Re-Ranking-Based Method for Pedestrian Text-Image Retrieval
by: Kehao Wang, et al.
Published: (2025-01-01) -
Outlier detection algorithm based on fast density peak clustering outlier factor
by: Zhongping ZHANG, et al.
Published: (2022-10-01) -
Nearest neighbor search algorithm for high dimensional data based on weighted self-taught hashing
by: Cong PENG, et al.
Published: (2017-06-01) -
Local outlier factor algorithm based on correction of bidirectional neighbor
by: Xiaohui YANG, et al.
Published: (2020-08-01)