arXiv research

Explicitly or implicitly, most of dimensionality reduction methods need to determine which samples are neighbors and the similarity between the neighbors in the original highdimensional space. The projection matrix is then learned on the assumption that the neighborhood information (e.g., the similarity) is known and f…

We propose a simple kernel based nearest neighbor approach for handwritten digit classification. The "distance" here is actually a kernel defining the similarity between two images. We carefully study the effects of different number of neighbors and weight schemes and report the results. With only a few nearest neighbo…

SPINEX improves clustering with explainable neighbors, outperforming other methods.

Recently similarity graphs became the leading paradigm for efficient nearest neighbor search, outperforming traditional tree-based and LSH-based methods. Similarity graphs perform the search via greedy routing: a query traverses the graph and in each vertex moves to the adjacent vertex that is the closest to this query…

Study on the structure of classifier boundaries in DNA sequencing.

New algorithm improves similarity graph construction for nearest neighbor search.

SPINEX improves time series forecasting with explainable neighbors.

A new GCN model learns higher-order neighbors without explicit adjacency matrix computation.

PG-EVIKAL refines molecular property predictions using neighbor fusion and evidential neural networks.

Paper develops multivariate time series similarity and distance measures.

This paper introduces PM and PMLP to enhance SSL by considering probability density and cluster assumptions.

Enhances graph neural networks by considering feature similarities in node aggregation.

The method of random projections has become a standard tool for machine learning, data mining, and search with massive data at Web scale. The effective use of random projections requires efficient coding schemes for quantizing (real-valued) projected data into integers. In this paper, we focus on a simple 2-bit coding …

Since its introduction, unsupervised representation learning has attracted a lot of attention from the research community, as it is demonstrated to be highly effective and easy-to-apply in tasks such as dimension reduction, clustering, visualization, information retrieval, and semi-supervised learning. In this work, we…

We explore and expand the $\textit{Soft Nearest Neighbor Loss}$ to measure the $\textit{entanglement}$ of class manifolds in representation space: i.e., how close pairs of points from the same class are relative to pairs of points from different classes. We demonstrate several use cases of the loss. As an analytical to…

Improved nearest neighbors for missing data in latent factor models.

ICQ improves high-dimensional similarity search without sacrificing precision.

UMAP's true loss function differs from what was previously thought, focusing on nearest neighbor graph similarities.

In this paper, we develop four malware detection methods using Hamming distance to find similarity between samples which are first nearest neighbors (FNN), all nearest neighbors (ANN), weighted all nearest neighbors (WANN), and k-medoid based nearest neighbors (KMNN). In our proposed methods, we can trigger the alarm i…

Modified cosine distance improves similarity performance in data with variance and correlation.

Graph convolutional networks (GCNs) are powerful deep neural networks for graph-structured data. However, GCN computes the representation of a node recursively from its neighbors, making the receptive field size grow exponentially with the number of layers. Previous attempts on reducing the receptive field size by subs…

SNJ recovers latent tree models from similarity matrices.

Java implementation improves nearest neighbor algorithm complexity.

kNN-MTS improves MTS forecasting by using nearest neighbor retrieval over a large dataset.

Single-layer GCN model improves recommendation performance with less complexity.

In many scientific disciplines structures in high-dimensional data have to be found, e.g., in stellar spectra, in genome data, or in face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regressio…

This paper improves forecasts for diverse time series by averaging similar ones.

Efficiently selects nearest neighbors for labeling to speed up active learning.

ProbMinHash improves Jaccard similarity hashing for big data applications.

We introduce a semiparametric approach to neighbor-based classification. We build off the recently proposed Boundary Trees algorithm by Mathy et al.(2015) which enables fast neighbor-based classification, regression and retrieval in large datasets. While boundary trees use an Euclidean measure of similarity, the Differ…

Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selecti…

Dissertation tackles zero-shot anomaly detection, focusing on consistent anomalies and proposing CoDeGraph framework.

Retrieving the most similar objects in a large-scale database for a given query is a fundamental building block in many application domains, ranging from web searches, visual, cross media, and document retrievals. State-of-the-art approaches have mainly focused on capturing the underlying geometry of the data manifolds…

The paper explains how nearest neighbor methods succeed in prediction.

The recently proposed self-ensembling methods have achieved promising results in deep semi-supervised learning, which penalize inconsistent predictions of unlabeled data under different perturbations. However, they only consider adding perturbations to each single data point, while ignoring the connections between data…

Improves Gower's similarity for mixed-type variables with automatic weighting.

New method selects recent similar periods for better electricity price forecasting.

The stability of statistical analysis is an important indicator for reproducibility, which is one main principle of scientific method. It entails that similar statistical conclusions can be reached based on independent samples from the same underlying population. In this paper, we introduce a general measure of classif…

Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution rule,https://doi.org/10.1088/1361-6544/ab1275] that for a connected self-similar set, space-filling curves can be c…

Revised ct-SNE improves t-SNE for visualizing data beyond labels.

Study shows SNN graph Laplacians converge to k-NN graph Laplacians under large scale asymptotics.

DSNE visualizes data velocity in lower dimensions.

This paper studies a stylized, yet natural, learning-to-rank problem and points out the critical incorrectness of a widely used nearest neighbor algorithm. We consider a model with $n$ agents (users) $\{x_i\}_{i \in [n]}$ and $m$ alternatives (items) $\{y_j\}_{j \in [m]}$, each of which is associated with a latent feat…

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…

NE-VAE prevents posterior collapse in VAEs by embedding neighbors in latent space.

Paper develops robust $k$-NN algorithm for few samples.

Parametric quantile regressions are a useful tool for creating probabilistic energy forecasts. Nonetheless, since classical quantile regressions are trained using a non-differentiable cost function, their creation using complex data mining techniques (e.g., artificial neural networks) may be complicated. This article p…

Using the trends of estimated abilities in terms of item response theory for online testing, we can predict the success/failure status for the final examination to each student at early stages in courses. In prediction, we applied the newly developed nearest neighbor method for determining the similarity of learning sk…