KNN ensembles improve Tweedie regression performance.
problem Improving regression models for Tweedie distribution.
method Combining bagged features, bagged observations, and varied k in KNN ensembles.
result Varying k provides significant improvements in model fit and robustness.
A new ensemble method using random projections for kNN classification.
problem Improving kNN classification accuracy through ensemble methods.
method Random projection of bootstrap samples into lower dimensions, using extended neighbourhood rule for base learners.
result Enhanced classification accuracy compared to traditional kNN and other ensembles.
rpForests uses random projections to speed up kNN search.
problem Efficient kNN search in high-dimensional data.
method Random projection forests aggregating results from multiple random projection trees.
result rpForests achieves fast decay in missing rate and kNN distance discrepancy.
A new ensemble method improves kNN performance by extending the neighborhood rule.
problem Traditional kNN's limitations when test points are outside the spherical region and ensemble's high errors.
method Determines neighbors in k steps, using bootstrap samples and optimal models selection.
result The proposed ensemble method outperforms state-of-the-art methods on 17 benchmark datasets.
DW-KNN improves KNN by integrating distance and neighbor reliability for better prediction accuracy.
problem Standard KNN assumes all neighbors are equally reliable, leading to unreliable predictions in heterogeneous feature spaces.
method DW-KNN integrates exponential distance with neighbor validity, providing instance-level interpretability and reducing hyperparameter sensitivity.
result DW-KNN achieves 0.8988 average accuracy, ranks 2nd among six methods, and has the lowest cross-validation variance.
Study develops and improves risk models using machine learning methods.
problem Classifying business delinquency using machine learning.
method Exploring several machine learning methods including regularization, hyper-parameter optimization, and model ensembling.
result Bagging on KNN with K=9 is the optimal model for risk classification.
A hybrid ML model detects fraudulent transactions with high accuracy.
problem Detecting and preventing fraudulent credit card transactions.
method Intelligent combination of multiple algorithms with Grid search and IHT-LR.
result Achieves impressive accuracy rates of 99.66% for ENS model.
Paper uses VAEs to detect genuine signatures.
problem Signature recognition performance plateaued at 2% error rate.
method Uses VAEs to learn latent space, then classifies unlabelled signatures.
result Method performs less well than existing alternatives but shows potential.
A-kNN improves kNN's ability to classify unknown instances.
problem kNN's inability to predict unknown instances.
method Developed Advanced kNN (A-kNN) algorithm.
result A-kNN significantly improves accuracy in classifying unknown instances.
We propose an efficient gradient-based attack on kNN and kNN-based models.
problem Finding optimal adversarial examples for kNN is intractable.
method Gradient-based attack inspired by previous work.
result Our attack outperforms state-of-the-art methods on kNN and kNN-based models.
Proposes a sample-efficient method for uncertainty estimation in deep learning.
problem Inaccurate uncertainty estimation in deep learning models, especially with limited data.
method Probabilistic Neighbourhood Component Analysis (PCA) for sample-efficient uncertainty estimation.
result Demonstrates superior uncertainty quantification compared to state-of-the-art methods.
Paper improves KNN-Shapley for privacy-friendly data valuation.
problem Privacy challenges in data valuation methods.
method Introduces TKNN-Shapley, a privacy-friendly variant of KNN-Shapley.
result TKNN-Shapley offers superior privacy-utility tradeoff compared to naively privatized KNN-Shapley.
New sEMG dataset for ADL activities recognized with high accuracy.
problem Developing a robust dataset for sEMG-based ADL activity recognition.
method Acquired sEMG data from 25 subjects performing 22 ADL activities. Used 4 classifiers with various feature sets.
result SVM classifier achieved 83.21% accuracy on 5 FAABOS categories.
A new algorithm improves credit scoring accuracy for imbalanced data.
problem Poor classification of minority class in credit scoring data sets.
method Weighted-Hybrid-Sampling-Boost (WHSBoost) algorithm with balanced data sampling.
result WHSBoost outperforms other methods in credit scoring accuracy.
Improved KNN data valuation method with reduced computation time.
problem Efficiently valuing individual data points in KNN models.
method Proposed a new utility function and derived its calculation for KNN classifiers/regressors, achieving similar time complexity as the original method.
result Soft-label KNN-SV outperforms the original method in mislabeled data detection.
K-nearest neighbors (KNN) method is used in many supervised learning classification problems. Potential Energy (PE) method is also developed for classification problems based on its physical metaphor. The energy potential used in the experiments are Yukawa potential and Gaussian Potential. In this paper, I use both app…
This paper analyzes kNN convergence over feature transformations.
problem The curse of dimensionality affects kNN performance in transformed feature spaces.
method Developed a novel analysis on kNN convergence rates over transformed features, linking properties of the transformed space to raw feature space.
result Theoretical analysis explains why some feature transformations are better for kNN.
Near-Exponential Convergence Rates for kNN Classification
problem Convergence rates for kNN classification
method Introducing Boltzmann margin
result First near-exponential convergence rates for kNN classification
Research proposes an ensemble learning model for efficient software defect prediction.
problem Efficient and cost-effective software testing to minimize project resources.
method Machine learning analysis on different datasets using KNN, Decision Tree, SVM, and Naïve Bayes.
result Ensemble learning model outperforms other techniques in accuracy, precision, recall, and F1-score.
This paper proposes a new hashing-based KNN technique for faster nearest neighbor selection.
problem Slowness of KNN in big datasets due to searching entire dataset.
method Divide data space into subcells, use hashing to map data points, and select nearest neighbors layer by layer.
result The proposed technique offers competitive performance with KNN and KDtree while significantly improving time efficiency.
Improved kNN models for better machine learning interpretability.
problem Complex machine learning models reduce interpretability.
method Synthesis of kNN and information theory.
result Overcame historical kNN problems for various applications.
Adaptive kNN method closes the gap for unbounded support distributions.
problem Inability of standard kNN to achieve minimax optimal rate for unbounded support distributions.
method Adaptive kNN method with varying k for different samples.
result The adaptive kNN method matches the minimax lower bound.
A new kNN imputation method improves classification performance on datasets with missing data.
problem Missing data in classification problems.
method Class weighted grey distance with MI weighting for kNN imputation.
result Improved classification performance compared to existing methods.
DADC algorithm improves clustering for data with varying density.
problem Sparse cluster loss and cluster fragmentation in density peak clustering.
method Domain-adaptive density measurement, cluster center self-identification, and cluster self-ensemble.
result DADC achieves more reasonable clustering results on data with varying density.
Robust kNN classifier achieves optimal rates in noisy classification.
problem Classification with unknown asymmetric label noise.
method Robust kNN classifier with additional assumptions.
result Achieves minimax optimal rates in noisy classification.
The paper develops a student performance prediction model using ensemble methods.
problem Improving student performance prediction in high school courses.
method Developed a multilabel classification model using SVM, RF, KNN, and MLP. Improved performance with LP transformation and partitioning schemes.
result The model achieved better performance than binary relevance and classifier chains.
The paper presents a recognition system for Pashto letters using KNN and ANN.
problem Challenging handwritten character recognition, especially for Pashto letters.
method Designed a database of 4488 images, used zoning feature extractor, KNN, and ANN classifiers.
result Achieved overall classification accuracy of 70.05% using KNN and 72% using ANN.
Developed AI models for multi-gas detection in near IR spectrums.
problem Detecting multiple gases in near IR spectrums.
method Used Monte Carlo KNN and multi-resolution CNN, synthesized near IR spectrums, optimized kernel sizes and channels.
result Multi-resolution CNN outperforms other models.
Enhanced KNN-TSVM reduces noise and overfitting with stable learning rules.
problem High computational cost and overfitting in KNN-based TSVM classifiers.
method Weighted KNN with stabilizer term and LDMDBA for efficient computation.
result Effective in both classification accuracy and computational time, with up to 14x speedup.
Simplified interactive image segmentation using kNN graphs.
problem Interactive image segmentation with user-provided labels.
method Undirected kNN graphs for label propagation.
result Effective interactive segmentation with significant accuracy.
The paper analyzes kNN density estimation's convergence rates under different conditions.
problem Analyzing convergence rates of kNN density estimation under bounded and unbounded support conditions.
method Examined two cases: bounded support with known and unknown support sets, and unbounded support with smooth density function.
result kNN density estimation is minimax optimal under certain conditions and better than kernel density estimation in some cases.
Data mining techniques on the biological analysis are spreading for most of the areas including the health care and medical information. We have applied the data mining techniques, such as KNN, SVM, MLP or decision trees over a unique dataset, which is collected from 16,380 analysis results for a year. Furthermore we h…
kNN-MTS improves MTS forecasting by using nearest neighbor retrieval over a large dataset.
problem Limited ability of current MTS forecasting methods to identify similar patterns and handle sparsely distributed correlations.
method kNN-MTS framework using nearest neighbor retrieval over a large datastore of cached series, with representations from MTS model for similarity search.
result Significant improvement in forecasting performance on real-world datasets.
Simplifies machine learning validation using kNN and conditional probability algorithms.
problem Validating machine learning models in practical applications.
method Reformulated regression and classification problems using kNN and conditional probability algorithms.
result Online capability and reduced memory usage compared to kNN.
Paper analyzes kNN estimator for KL divergence, proving its optimality.
problem Estimating KL divergence from identical samples.
method kNN estimator based on nearest neighbor distances.
result kNN method is asymptotically rate optimal for KL divergence estimation.
This study observes accuracy variations of KNN, SVM, LMNN, and ENN on 11 UCI datasets.
problem To observe the variation of accuracies of KNN, SVM, LMNN, and ENN algorithms on different datasets.
method Implemented KNN, SVM, LMNN, and ENN on 11 UCI datasets and analyzed their accuracy.
result Comparison of algorithm performances on each dataset.
A defense against adversarial examples using k-Nearest Neighbor and deep learning.
problem Evaluating robustness of k-Nearest Neighbor and its deep learning combination.
method Proposed heuristic attack to find adversarial examples for kNN and DkNN.
result Our attack significantly outperforms other attacks on DkNN.
Paper proposes a method to model health outcomes using varying-coefficients and KNN-based LASSO.
problem Modeling health outcomes like BMI and cholesterol levels with varying age effects.
method Varying-coefficients regional quantile regression via KNN fused LASSO, with ADMM algorithm.
result Efficacy in capturing complex age-dependent associations between health outcomes and risk factors.
C-kNN-LSH identifies similar patient histories for causal inference in longitudinal data.
problem Estimating causal effects from longitudinal trajectories with high-dimensional confounding.
method C-kNN-LSH uses locality-sensitive hashing to find clinical twins and estimate treatment effects.
result C-kNN-LSH outperforms existing methods in capturing recovery heterogeneity and estimating policy values.
Optimal regression with reject option using conditional variance thresholding.
problem Regression with reject option to handle uncertain predictions.
method Derive optimal rule based on thresholding conditional variance, semi-supervised estimation using labeled and unlabeled data.
result The predictor with reject option is almost as good as the optimal predictor in terms of risk and rejection rate.
A new adaptive kNN classifier outperforms Random Forests.
problem Improving classification accuracy using nearest neighbors.
method Finding discriminant subspaces for efficient nearest neighbor classification, leveraging bagging for diversity.
result The proposed method outperforms Random Forests and other nearest neighbors ensembles.
TRAKNN detects rare atmospheric trajectories efficiently.
problem Detecting rare atmospheric anomalies over long periods.
method Unsupervised, recurrence-based kNN algorithm.
result Rare trajectories correspond to physical anomalies.
Adaptive, sparse graphs improve learning performance.
problem Inappropriate kNN for varying sampling density or noise.
method Quadratically regularised optimal transport.
result Graphs outperform kNN in learning applications.
Faster kNN mode seeking for clustering and active learning.
problem Finding large sets of small clusters in high-dimensional data.
method Improved kNN mode seeking algorithm with multi-scale hierarchy.
result Significantly faster computing times for clustering.
The paper proves convergence of graph Laplacian with kNN self-tuned kernels.
problem Theoretical and practical challenges in choosing kernel bandwidth for graph-based analysis.
method Develops and analyzes a new family of kNN self-tuned kernels for graph Laplacian convergence.
result Proves convergence of graph Laplacian to manifold Laplacian for new kNN self-tuned kernels.
kNNSampler imputes missing values from their distributions using kNN.
problem Impute missing values from their distributions.
method Randomly samples from the observed responses of the k most similar units.
result Estimates the conditional distribution of missing values.
The multilabel learning problem with large number of labels, features, and data-points has generated a tremendous interest recently. A recurring theme of these problems is that only a few labels are active in any given datapoint as compared to the total number of labels. However, only a small number of existing work ta…
This paper evaluates t-SNE and MDS for reducing dimensions in datasets and classifying them with KNN, ENN, and SVM.
problem Reducing dimensions in datasets for better classification performance.
method t-SNE and MDS applied to nine datasets, followed by KNN, ENN, and SVM classification.
result Performance comparison of t-SNE and MDS with KNN, ENN, and SVM.