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.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “kNN graph”
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges …
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.
Many interactive image segmentation techniques are based on semi-supervised learning. The user may label some pixels from each object and the SSL algorithm will propagate the labels from the labeled to the unlabeled pixels, finding object boundaries. This paper proposes a new SSL graph-based interactive image segmentat…
While deep learning has achieved great success in computer vision and many other fields, currently it does not work very well on patient genomic data with the "big p, small N" problem (i.e., a relatively small number of samples with high-dimensional features). In order to make deep learning work with a small amount of …
Improved convergence rate for kNN graph Laplacians with adaptive bandwidth.
problem Enhancing the efficiency of graph-based data analysis methods.
method Introducing a new class of kNN graph with adaptive bandwidth and proving operator convergence rate.
result Operator convergence rate of for the kNN graph Laplacian, up to a log factor.
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.
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.
Among the extensions of twin support vector machine (TSVM), some scholars have utilized K-nearest neighbor (KNN) graph to enhance TSVM's classification accuracy. However, these KNN-based TSVM classifiers have two major issues such as high computational cost and overfitting. In order to address these issues, this paper …
k-nearest neighbour (kNN) is one of the most prominent, simple and basic algorithm used in machine learning and data mining. However, kNN has limited prediction ability, i.e., kNN cannot predict any instance correctly if it does not belong to any of the predefined classes in the training data set. The purpose of this p…
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include previously unstudied graphs including kNN graphs. We also introduce a kernel-fr…
DW-KNN: A Transparent Local Classifier Integrating Distance Consistency and Neighbor Reliabilitycs.LG
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.
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.
Study uniform convergence of random walk Laplacians to diffusion Laplacian on smooth manifolds.
problem Uniform convergence of random walk Laplacians to diffusion Laplacian on smooth manifolds.
method Analysis of random walks on geometric and directed kNN graphs, using concentration tools and differential geometry.
result Uniform convergence of NN Laplacians to diffusion Laplacian, without continuity of transition kernel.
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…
The paper introduces algorithms for uncertainty quantification in metric spaces.
problem Uncertainty quantification in regression models defined on metric spaces.
method Proposes conformal and kNN prediction algorithms for metric spaces.
result Both algorithms provide finite-sample guarantees and improve local coverage calibration.
Real-world networks such as social and communication networks are too large to be observed entirely. Such networks are often partially observed such that network size, network topology, and nodes of the original network are unknown. In this paper we formalize the Adaptive Graph Exploring problem. We assume that we are …
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
New method builds complex networks from attribute interactions without normalization.
problem Improving high-level classification algorithms by capturing hidden attribute interactions.
method Proposes a new complex network building methodology based on attribute-attribute interactions, avoiding normalization.
result Demonstrates improved performance in high-level classification techniques.
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.
Very few K-nearest-neighbor (KNN) ensembles exist, despite the efficacy of this approach in regression, classification, and outlier detection. Those that do exist focus on bagging features, rather than varying k or bagging observations; it is unknown whether varying k or bagging observations can improve prediction. Giv…
Despite a large amount of attention on adversarial examples, very few works have demonstrated an effective defense against this threat. We examine Deep k-Nearest Neighbor (DkNN), a proposed defense that combines k-Nearest Neighbor (kNN) and deep learning to improve the model's robustness to adversarial examples. It is …
A Random Projection k Nearest Neighbours Ensemble for Classification via Extended Neighbourhood Rulestat.ML
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.
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.
K-nearest neighbor (kNN) search has wide applications in many areas, including data mining, machine learning, statistics and many applied domains. Inspired by the success of ensemble methods and the flexibility of tree-based methodology, we propose random projection forests (rpForests), for kNN search. rpForests finds …
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.
A Monte Carlo k-nearest neighbours (KNN) and a multi-resolution convolutional neural network (CNN) were developed to detect the presences of multiple gasses in near infrared (IR) spectrums. High Resolution Transmission database was used to synthesize the near IR spectrums. Monte Carlo KNN determined the optimal kernel …
Stock price movement reveals complex interdependencies that are simplified through linear correlation.
problem Exploring the spectral dynamics of the Indonesian capital market using structural network representations.
method Combining three dependency estimators (Pearson, MI adaptive binning, and MI-kNN) with two graph filtering schemes (MST and PMFG) and four community decoders.
result MI adaptive binning is shown to be more proportional than kNN for detecting residual information.
Imputation of missing data is a common application in various classification problems where the feature training matrix has missingness. A widely used solution to this imputation problem is based on the lazy learning technique, -nearest neighbor (kNN) approach. However, most of the previous work on missing data does…
Machine learning models have become more and more complex in order to better approximate complex functions. Although fruitful in many domains, the added complexity has come at the cost of model interpretability. The once popular k-nearest neighbors (kNN) approach, which finds and uses the most similar data for reasonin…
k Nearest Neighbor (kNN) method is a simple and popular statistical method for classification and regression. For both classification and regression problems, existing works have shown that, if the distribution of the feature vector has bounded support and the probability density function is bounded away from zero in i…
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.
We consider classification in the presence of class-dependent asymmetric label noise with unknown noise probabilities. In this setting, identifiability conditions are known, but additional assumptions were shown to be required for finite sample rates, and so far only the parametric rate has been obtained. Assuming thes…
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.
TRAKNN: Efficient Trajectory Aware Spatiotemporal kNN for Rare Meteorological Trajectory Detectionstat.ML
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.
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.
This paper presents a recognition system for handwritten Pashto letters. However, handwritten character recognition is a challenging task. These letters not only differ in shape and style but also vary among individuals. The recognition becomes further daunting due to the lack of standard datasets for inscribed Pashto …
Data-driven neighborhood definitions and graph constructions are often used in machine learning and signal processing applications. k-nearest neighbor~(kNN) and -neighborhood methods are among the most common methods used for neighborhood selection, due to their computational simplicity. However, the choice of param…
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.
S&P 500 Trend Predictionq-fin.CP
Predicts S&P 500 trends using machine learning models.
problem Market trend prediction for S&P 500 index.
method Feature engineering, machine learning models (Logistic Regression, Decision Trees, Random Forests, Neural Networks, KNN, XGBoost), data preprocessing, hyperparameter tuning, SMOTE.
result KNN for short-term predictions, XGBoost for long-term forecasts.
We propose a non-parametric anomaly detection algorithm for high dimensional data. We first rank scores derived from nearest neighbor graphs on -point nominal training data. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as…
Paper develops methods for semi-supervised Fréchet regression.
problem High costs of obtaining non-Euclidean labels.
method Proposes semi-supervised NW Fréchet regression and semi-supervised kNN Fréchet regression.
result Demonstrates superior performance over supervised methods.
Aspect based Sentiment Analysis is a major subarea of sentiment analysis. Many supervised and unsupervised approaches have been proposed in the past for detecting and analyzing the sentiment of aspect terms. In this paper, a graph-based semi-supervised learning approach for aspect term extraction is proposed. In this a…
We consider the problem of embedding unweighted, directed k-nearest neighbor graphs in low-dimensional Euclidean space. The k-nearest neighbors of each vertex provides ordinal information on the distances between points, but not the distances themselves. We use this ordinal information along with the low-dimensionality…
When using the K-nearest neighbors method, one often ignores uncertainty in the choice of K. To account for such uncertainty, Holmes and Adams (2002) proposed a Bayesian framework for K-nearest neighbors (KNN). Their Bayesian KNN (BKNN) approach uses a pseudo-likelihood function, and standard Markov chain Monte Carlo (…