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...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Mayur Garg, Ashutosh Nayak, Rajasekhara Reddy Duvvuru Muni
Format:	Artigo
Sprog:	Inglês
Udgivet:	IEEE 2025-01-01
Serier:	IEEE Access
Fag:	Rank based methods nearest neighbor outlier detection unsupervised learning proximity search text similarity
Online adgang:	https://ieeexplore.ieee.org/document/10815932/
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!