arXiv research

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

Logit distance bounds representational similarity of models.

Unified understanding of neural representation similarity measures.

Paper develops multivariate time series similarity and distance measures.

This research proposes a new distance metric using Isolation Forests.

We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit distance for Reeb graphs and prove that it is stable and universal, meaning that it pr…

We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/simila…

Survey of deep learning methods for graph similarity.

As a highlighting research topic in the multimedia area, cross-media retrieval aims to capture the complex correlations among multiple media types. Learning better shared representation and distance metric for multimedia data is important to boost the cross-media retrieval. Motivated by the strong ability of deep neura…

A novel criterion selects optimal distance metrics for cell profile analysis.

kdiff measures distances for time series and structured data.

The Wasserstein distance and its variations, e.g., the sliced-Wasserstein (SW) distance, have recently drawn attention from the machine learning community. The SW distance, specifically, was shown to have similar properties to the Wasserstein distance, while being much simpler to compute, and is therefore used in vario…

Distance plays a fundamental role in measuring similarity between objects. Various visualization techniques and learning tasks in statistics and machine learning such as shape matching, classification, dimension reduction and clustering often rely on some distance or similarity measure. It is of tremendous importance t…

We propose a new method for local distance metric learning based on sample similarity as side information. These local metrics, which utilize conical combinations of metric weight matrices, are learned from the pooled spatial characteristics of the data, as well as the similarity profiles between the pairs of samples, …

The ability to measure similarity between documents enables intelligent summarization and analysis of large corpora. Past distances between documents suffer from either an inability to incorporate semantic similarities between words or from scalability issues. As an alternative, we introduce hierarchical optimal transp…

New method learns distances and similarities robustly from noisy data.

Similarity learning has received a large amount of interest and is an important tool for many scientific and industrial applications. In this framework, we wish to infer the distance (similarity) between points with respect to an arbitrary distance function $d$. Here, we formulate the problem as a regression from a fea…

We propose $\textit{weighted inner product similarity}$ (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…

Introduces CHL, a new loss function for continuous similarity learning.

QCML improves bond similarity learning in illiquid markets.

We propose shifted inner-product similarity (SIPS), which is a novel yet very simple extension of the ordinary inner-product similarity (IPS) for neural-network based graph embedding (GE). In contrast to IPS, that is limited to approximating positive-definite (PD) similarities, SIPS goes beyond the limitation by introd…

Empirical analysis of the foreign exchange market is conducted based on methods to quantify similarities among multi-dimensional time series with spectral distances introduced in [A.-H. Sato, Physica A, 382 (2007) 258--270]. As a result it is found that the similarities among currency pairs fluctuate with the rotation …

The study explores how to infer the geometry of space forms from similarity comparisons.

The paper shows how to recover true node positions from a graph or similarity matrix.

This study investigates self-supervised learning with Wasserstein distance on tree structures.

New algorithm trains generative networks using explicit optimal transport distances.

Quantum networks learn task-dependent asymmetric similarity measures.

In this paper, we present a novel two-stage metric learning algorithm. We first map each learning instance to a probability distribution by computing its similarities to a set of fixed anchor points. Then, we define the distance in the input data space as the Fisher information distance on the associated statistical ma…

Proposes a robust similarity measure for sparse time series data.

Network Embeddings (NEs) map the nodes of a given network into $d$-dimensional Euclidean space $\mathbb{R}^d$. Ideally, this mapping is such that `similar' nodes are mapped onto nearby points, such that the NE can be used for purposes such as link prediction (if `similar' means being `more likely to be connected') or c…

fMRI is a unique non-invasive approach for understanding the functional organization of the human brain, and task-based fMRI promotes identification of functionally relevant brain regions associated with a given task. Here, we use fMRI (using the Poffenberger Paradigm) data collected in mono- and dizygotic twin pairs t…

Study uses trajectory embedding to measure place function similarity at fine spatial granularity.

Proposes a new method to learn distance metrics for semi-supervised learning.

Physics: Similar long-distance properties can mask vastly different short-distance metrics.

A new graph kernel uses LCS and Wasserstein distance for better graph comparisons.

New metric captures individual neuron tuning across neural networks.

We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured by solving a non-linear, low-rank representation problem. We show that this low-…

This paper explores using SSIM for better image generation in generative models.

SMERF improves distance learning with decision forests.

New neural nets respect triangle inequality, improving graph and reinforcement learning performance.

Two new algorithms select matrix rows and columns to preserve distances.

LSH methods extend to function spaces for efficient similarity search.

The paper examines how to test if two learning algorithms produce similar outcomes.

A recent proposal of data dependent similarity called Isolation Kernel/Similarity has enabled SVM to produce better classification accuracy. We identify shortcomings of using a tree method to implement Isolation Similarity; and propose a nearest neighbour method instead. We formally prove the characteristic of Isolatio…

New findings clarify the link between distributional closeness and representational similarity.

A new dataset distance using optimal transport, agnostic of model and label sets.

The challenge of object categorization in images is largely due to arbitrary translations and scales of the foreground objects. To attack this difficulty, we propose a new approach called collaborative receptive field learning to extract specific receptive fields (RF's) or regions from multiple images, and the selected…

It is a key to construct a similarity graph in graph-oriented subspace learning and clustering. In a similarity graph, each vertex denotes a data point and the edge weight represents the similarity between two points. There are two popular schemes to construct a similarity graph, i.e., pairwise distance based scheme an…