Random k conditional nearest neighbor for high-dimensional data
The k nearest neighbor (kNN) approach is a simple and effective algorithm for classification and a number of variants have been proposed based on the kNN algorithm. One of the limitations of kNN is that the method may be less effective when data contains many noisy features due to their non-informat...
Saved in:
Main Authors: | Jiaxuan Lu, Hyukjun Gweon |
---|---|
Format: | Article |
Language: | English |
Published: |
PeerJ Inc.
2025-01-01
|
Series: | PeerJ Computer Science |
Subjects: | |
Online Access: | https://peerj.com/articles/cs-2497.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
SLSB-forest:approximate k nearest neighbors searching on high dimensional data
by: Tu QIAN, et al.
Published: (2017-09-01) -
Nearest neighbor search algorithm for high dimensional data based on weighted self-taught hashing
by: Cong PENG, et al.
Published: (2017-06-01) -
K-nearest neighbor algorithm for imputing missing longitudinal prenatal alcohol data
by: Ayesha Sania, et al.
Published: (2025-01-01) -
A Classifier Based on K-Nearest Neighbors Using Weighted Summation of Reconstruction Errors
by: Rassoul Hajizadeh, et al.
Published: (2024-04-01) -
Infant Vulnerability Detection At 0-1 Years Old Affected By Stunting Using The K-Nearest Neighbor Algorithm
by: Moh Abdul Kholik, et al.
Published: (2024-06-01)