Approximate Knn Classification For Biomedical Data

Abstract

We are in the era where the Big Data analytics has changed the way of interpreting the various biomedical phenomena, and as the generated data increase, the need for new machine learning methods to handle this evolution grows. An indicative example is the single-cell RNA-seq (scRNA-seq), an emerging DNA sequencing technology with promising capabilities but significant computational challenges due to the large-scaled generated data. Regarding the classification process for scRNA-seq data, an appropriate method is the k Nearest Neighbor (kNN) classifier since it is usually utilized for large-scale prediction tasks due to its simplicity, minimal parameterization, and model-free nature. However, the ultra-high dimensionality that characterizes scRNA-seq impose a computational bottleneck, while prediction power can be affected by the "Curse of Dimensionality". In this work, we proposed the utilization of approximate nearest neighbor search algorithms for the task of kNN classification in sc

Stats

• citations12
• S2 citations—
• github stars0
• HF likes0
• heat score8.35
• arxiv keyanagnostou2020approximate

Related papers

• A New Hashing Based Nearest Neighbors Selection Technique For Big Datasets (2020)3.58
• Minimax Rate Optimal Adaptive Nearest Neighbor Classification And Regression (2019)8.35
• Let Them Have CAKES: A Cutting-edge Algorithm For Scalable, Efficient, And Exact Search On Big Data (2023)2.68
• KNN Classification With One-step Computation (2020)13.34
• Knet: A Deep Knn Network To Handle Label Noise (2021)0.00
• Fast Nearest-neighbor Classification Using RNN In Domains With Large Number Of Classes (2017)0.00
• Approximate K-nn Graph Construction: A Generic Online Approach (2018)11.08
• On Convergence Of Nearest Neighbor Classifiers Over Feature Transformations (2020)0.00