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
-
K-nearest neighbor algorithm for imputing missing longitudinal prenatal alcohol data
by: Ayesha Sania, et al.
Published: (2025-01-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) -
ELECTRONIC NOSE UNTUK SKRINING PENYAKIT DIABETES MELLITUS MENGGUNAKAN K-NEAREST NEIGHBOR DAN LARIK SENSOR
by: Pipit Puji Arti, et al.
Published: (2024-08-01) -
A novel oversampling method based on Wasserstein CGAN for imbalanced classification
by: Hongfang Zhou, et al.
Published: (2025-02-01) -
Geographical Origin Identification of <italic>Panax notoginseng</italic> Using a Modified K-Nearest Neighbors Model With Near-Infrared Spectroscopy
by: Xuefeng Cheng, et al.
Published: (2025-01-01)