Proposes DNCM model for efficient incremental odor classification.
problem Dynamic growth of odor classes over time.
method Deep learning framework and nearest class mean method.
result Efficient for integrating new classes with limited examples.
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.
169,341 papers · 148 categories
Trend · papers per month
48 results for “nearest class mean”
The k-means++ algorithm is generalized by choosing the most distant point from the nearest center.
problem Improving the initialization of k-means clustering.
method Generalizing the center initialization process by selecting the most distant point from the nearest center.
result Choosing the most distant point from the nearest center achieves similar clustering quality to k-means++.
Paper compares two possibilistic segmentation methods for SAS imagery.
problem Segmenting synthetic aperture sonar images into different seafloor environments.
method Comparison of Possibilistic Fuzzy Local Information C-Means (PFLICM) and Possibilistic K-Nearest Neighbors (PKNN) algorithms.
result PKNN outperforms PFLICM in segmentation performance on SAS images.
New estimator uses k-nearest neighbor distances for density functionals.
problem Estimating general density functionals from data.
method Asymptotically unbiased estimator using inverse Laplace transform.
result Established -consistency and mean squared error convergence.
New method speeds up k-means clustering for large k by improving nearest-neighbor search.
problem Efficiently clustering large datasets with high-dimensional points.
method Seeded Approximate Nearest-Neighbor Search methods to improve Lloyd's algorithm.
result Significantly faster k-means clustering for large k values.
Efficiently clusters large datasets with approximate nearest neighbors.
problem Efficiently clustering large datasets with high computational cost.
method Approximates density gradient ascent and nearest neighbors using LSH for scalable clustering.
result Improves clustering accuracy and scalability for large datasets.
Improved multiclass classification with class-weighted nearest neighbors.
problem Multiclass classification with large or imbalanced classes.
method Class-weighted k-nearest neighbors algorithm, derived bounds on accuracy and risk.
result Optimized classification metrics like F1 score or Matthew's Correlation Coefficient.
The Soft Nearest Neighbor Loss improves representation quality and generalization.
problem Improving the quality of representations in machine learning models.
method Explored and expanded the Soft Nearest Neighbor Loss to measure class entanglement.
result Maximizing the entanglement of different class representations leads to better generalization and uncertainty estimation.
New method for clustering binary data using nearest neighbor median shift.
problem Clustering binary data effectively.
method BinNNMS based on nearest neighbor median shift.
result BinNNMS accurately discovers cluster locations in binary data.
Nearest neighbor methods are a popular class of nonparametric estimators with several desirable properties, such as adaptivity to different distance scales in different regions of space. Prior work on convergence rates for nearest neighbor classification has not fully reflected these subtle properties. We analyze the b…
Estimates missing distributions using nearest neighbors with kernel methods.
problem Missing data and unobserved confounding in multivariate distributions.
method Distributional matrix completion framework with kernel nearest neighbors.
result Consistent recovery of underlying distributions with missing data.
PNN-smoothing improves -means clustering by merging subsets' clusterings.
problem Improving -means clustering initialization efficiency and effectiveness.
method Split dataset into subsets, cluster each subset, merge with PNN method.
result PNN-smoothing enhances -means++ seeding, reducing costs.
A fast method for LOOCV in k-NN regression reduces computation time.
problem Efficient computation of LOOCV for k-NN regression.
method Identical LOOCV estimate to (k+1)-NN MSE on training data.
result LOOCV computation can be done with (k+1)-NN regression once.
Deep learning method for brain CT scan anomaly labeling using nearest neighbors.
problem Automated anatomical labeling of brain CT scan anomalies.
method Combines local and global context, uses Relation Networks (RNs) for prediction, and employs nearest neighbors for training.
result Improved performance of Relation Networks (RNs) through nearest neighbors training strategy.
Metric learning adapted for curved manifolds improves data clustering.
problem Distance metric learning on curved manifolds.
method Extending metric learning algorithms to work on a wide range of manifolds.
result Improved performance in clustering and classification on complex networks.
Improved clustering accuracy with disentangled latent code representation.
problem Improving k-Means clustering performance.
method Optimizing the entanglement of autoencoder latent code representation using soft nearest neighbor loss with annealing temperature.
result 96.2% test clustering accuracy on MNIST, 85.6% on Fashion-MNIST, and 79.2% on EMNIST Balanced datasets.
Characterizes Lebesgue points using nearest neighbor methods.
problem Consistency of classification algorithms based on nearest neighbors.
method Characterization of Lebesgue points via 1-Nearest Neighbor regression.
result Proves convergence of 1-Nearest Neighbor classification algorithms in metric spaces.
A new classification method using disjoint centroids and normalized distance.
problem Improving classification accuracy and feature selection.
method Nearest disjoint centroid classifier with normalized distance.
result Our method outperforms other classifiers in terms of misclassification rates and feature usage.
Adaptive NN method improves matrix completion for non-smooth data.
problem Matrix completion with non-smooth non-linear functions under high missingness.
method Two-sided nearest neighbors with \Holder function class non-linearity.
result NN error rate matches oracle's for latent factors, non-trivial for wide range of missingness.
Improved nearest neighbors for missing data in latent factor models.
problem Estimation with missing data in latent factor models.
method Doubly robust nearest neighbors (NN) that considers both row and column neighbors.
result Provides a consistent estimate and near-quadratic improvement in error.
New clustering algorithms for random process data without model knowledge.
problem Clustering random process data without model statistics and number of models.
method Two algorithms using -distance between PSDs, NNPC via spectral clustering and KM.
result Both algorithms succeed with high probability in noisy and missing data scenarios.
Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.
problem Understanding and optimizing deep learning training phases.
method Direct measurements on three deepnet architectures across seven datasets.
result Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.
The Nearest subspace classifier (NSS) finds an estimation of the underlying subspace within each class and assigns data points to the class that corresponds to its nearest subspace. This paper mainly studies how well NSS can be generalized to new samples. It is proved that NSS is strongly consistent under certain assum…
Sparse nearest-centroid classifiers detect relevant features for classification.
problem Classifying data with low computational cost and feature selection.
method Proposes and sparse variants of nearest-centroid classifiers.
result Training sparse classifiers can be done exactly and at quasi-linear cost.
There is an increasing body of evidence suggesting that exact nearest neighbour search in high-dimensional spaces is affected by the curse of dimensionality at a fundamental level. Does it necessarily mean that the same is true for k nearest neighbours based learning algorithms such as the k-NN classifier? We analyse t…
Proposes KNORA-B and KNORA-BI for DES, improving classification performance.
problem Selecting locally competent classifiers for new test samples.
method KNORA-B and KNORA-BI use nearest neighbors to reduce region of competence, maintaining at least one sample from each class.
result KNORA-BI outperforms state-of-the-art techniques on imbalance datasets.
Proposes learning a metric for class-conditional KNN to improve performance.
problem Failure of traditional NN techniques when data representation does not capture perceptual similarity.
method Class Conditional Metric Learning (CCML) that optimizes a soft form of NBNN selection rule.
result CCML outperforms existing learned distance metrics across various datasets.
Optimizes one-class classification methods for better performance.
problem Improving one-class classification accuracy through hyperparameter optimization.
method Hyperparameter optimization for five one-class classification methods (SVM, NND, LNND, LOF, ALP) using various datasets.
result ALP and SVM perform best after hyperparameter optimization, with ALP being more efficient.
A review of nearest neighbour classifiers, focusing on similarity measures and computational efficiency.
problem Improving the performance of nearest neighbour classifiers.
method Explains mechanisms for assessing similarity (distance), identifying nearest neighbours, and reducing data dimensionality.
result Added new sections on time-series similarity measures, retrieval speed-up, and intrinsic dimensionality.
This paper provides fast estimates for complex option types.
problem Estimating prices for constrained multiple exercise American options.
method Lookahead search for lower estimates and nearest-neighbor martingale for upper estimates.
result Probabilistic convergence guarantees for the algorithms.
Efficiently selects nearest neighbors for labeling to speed up active learning.
problem Intractable active learning and search for large-scale unlabeled data.
method Restricts candidate pool to nearest neighbors of labeled set.
result Achieved similar performance to global approach but reduced computational cost by up to 3 orders of magnitude.
A new method improves the DNN estimator for mean regression, achieving optimal convergence rates.
problem Lack of distributional results and suboptimal convergence rates for DNN estimator.
method Two-scale distributional nearest neighbors (TDNN) estimator, combining two DNN estimators with different subsampling scales.
result The two-scale DNN estimator achieves the optimal nonparametric convergence rate under fourth-order smoothness.
Java implementation improves nearest neighbor algorithm complexity.
problem Improving efficiency of nearest neighbor descent algorithm.
method Parallel streams implementation with statistical termination criterion.
result Complexity up to for -nearest neighbors.
FastMuyGPs speeds up GP predictions for large datasets.
problem High cost of Gaussian process predictions for large data.
method Combines cross-validation, batching, nearest neighbors sparsification, and precomputation.
result Superior accuracy and competitive runtime compared to other methods.
Neural networks classify OOD images by their nearest neighbor in training data.
problem Understanding out-of-distribution prediction behavior of neural networks.
method Nearest category generalization (NCG) measure to assess OOD prediction accuracy.
result Adversarially robust networks have higher NCG accuracy than natural training, indicating local regularization impacts decision regions.
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.
This paper introduces a class of k-nearest neighbor (-NN) estimators called bipartite plug-in (BPI) estimators for estimating integrals of non-linear functions of a probability density, such as Shannon entropy and Rényi entropy. The density is assumed to be smooth, have bounded support, and be uniformly bounded from…
Proposes multi-neighborhood LBPs for land use classification.
problem Challenges in classifying land use images due to intra class variability and inter class similarities.
method Uses multi-neighborhood LBPs combined with nearest neighbor classifier.
result Achieved an accuracy of 77.76% on UC Merced 21 class land use image dataset.
The paper studies empirical processes from nearest neighbors in regression.
problem Estimating conditional cumulative distribution functions and local linear regression.
method Uniform central limit theorem and non-asymptotic bound under local bracketing entropy and uniform entropy numbers.
result Gaussian limit of empirical process with simple covariance.
This paper proposes a new method for feature scaling in K-Nearest Neighbors.
problem Feature scaling issues in K-Nearest Neighbors algorithm.
method Assign weights to individual features using out-of-bag errors from decision tree models.
result Improves prediction accuracy by assigning weights to features based on out-of-bag errors.
Under-bagging -NN improves performance on imbalanced classification.
problem Imbalanced classification problems where one class is significantly underrepresented.
method Proposes an under-bagging -NN ensemble learning algorithm, analyzing convergence rates and efficiency.
result Achieves optimal convergence rates under mild assumptions and reduces sub-sample size and for highly imbalanced data.
We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their nonparametric generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the L1-distance between estimated power spectra…
A new classifier encodes local neighborhoods for each class using Fly Bloom Filters.
problem Efficiently classify data with single-pass learning.
method Proposes a new classifier that encodes local neighborhoods for each class with per-class Fly Bloom Filters.
result The proposed classifier's performance is competitive with nearest-neighbor classifiers and other single-pass classifiers.
Paper proposes deep learning models for k-NN classification.
problem Imbalanced datasets and complex feature vectors in classification.
method Sequence to sequence model and memory network models.
result Models outperform k-NN and other state-of-the-art models.
ASK-NN: An Asymmetric Nearest-Neighbor Test that detects Distribution Drifts in Natural Languagecs.LG
ASK-NN detects distribution drifts in LLM-generated text.
problem Hallucinations and artificial text in LLM-generated outputs.
method Asymmetric two-sample test based on directed k-nearest-neighbor graph.
result ASK-NN is competitive with baselines on various benchmarks.
Unified framework evaluates different nearest neighbor classification methods.
problem Evaluating and comparing classical, fuzzy, and fuzzy rough nearest neighbor classification methods.
method Standardized nearest neighbor weighting with kernel functions applied to distance and/or rank values of nearest neighbors.
result NN, FNN, and FRNN perform best with Boscovich distance, and NN and FRNN perform best with specific combinations of weights and scaling measures.
BigNN classifier improves nearest neighbor classification for large datasets.
problem Classification of large datasets that cannot fit into a single machine's memory.
method Divide and conquer scheme with majority voting for final decision; pre-training acceleration technique.
result Rates of convergence for bigNN classifier under minimal assumptions, proving it as optimal.
A fast algorithm for -means clustering using subsampled SDP.
problem Efficiently solving large-scale -means clustering problems.
method Sketch-and-Lift (SL) approach for approximating SDP relaxed -means.
result SL method achieves similar exact recovery threshold as full SDP on full dataset.