Results 41 to 50 of about 7,890 (182)
Topological Data Analysis with Bregman Divergences
We show that the framework of topological data analysis can be extended from metrics to Bregman divergences, widening the scope of possible applications. Examples are the Kullback-Leibler divergence, which is commonly used for comparing text and images, and the Itakura-Saito divergence, popular for speech and sound.
Edelsbrunner, Herbert, Wagner, Hubert
openaire +4 more sources
Neural Bregman Divergences for Distance Learning
Many metric learning tasks, such as triplet learning, nearest neighbor retrieval, and visualization, are treated primarily as embedding tasks where the ultimate metric is some variant of the Euclidean distance (e.g., cosine or Mahalanobis), and the algorithm must learn to embed points into the pre-chosen space.
Fred Lu, Edward Raff, Francis Ferraro
openaire +3 more sources
Regularised transfer learning for hyperspectral image classification
This study presents a transfer learning method for addressing the insufficient sample problem in hyperspectral image classification. In order to find common feature representation for both the source domain and target domain, we introduce a ...
Qian Shi +3 more
doaj +1 more source
CLUSTERING-BASED APPROACHES TO THE EXPLORATION OF SPATIO-TEMPORAL DATA [PDF]
As one spatio-temporal data mining task, clustering helps the exploration of patterns in the data by grouping similar elements together. However, previous studies on spatial or temporal clustering are incapable of analysing complex patterns in spatio ...
X. Wu +3 more
doaj +1 more source
Non-flat clustering whith alpha-divergences [PDF]
International audienceThe scope of the well-known $k$-means algorithm has been broadly extended with some recent results: first, the k-means++ initialization method gives some approximation guarantees; second, the Bregman k-means algorithm generalizes ...
Nielsen, Frank, Schwander, Olivier
core +3 more sources
Modulus of convexity for operator convex functions [PDF]
Given an operator convex function $f(x)$, we obtain an operator-valued lower bound for $cf(x) + (1-c)f(y) - f(cx + (1-c)y)$, $c \in [0,1]$. The lower bound is expressed in terms of the matrix Bregman divergence.
Kim, Isaac H.
core +3 more sources
The purpose of this paper is twofold. On a technical side, we propose an extension of the Hausdorff distance from metric spaces to spaces equipped with asymmetric distance measures.
Tuyen Pham +2 more
doaj +1 more source
Sum decomposition of divergence into three divergences
Divergence functions play a key role as to measure the discrepancy between two points in the field of machine learning, statistics and signal processing. Well-known divergences are the Bregman divergences, the Jensen divergences and the f-divergences. In
Nishiyama, Tomohiro
core +1 more source
Discounted dynamic optimization and Bregman divergence
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Extropy: Complementary Dual of Entropy [PDF]
This article provides a completion to theories of information based on entropy, resolving a longstanding question in its axiomatization as proposed by Shannon and pursued by Jaynes.
Agrò, Gianna +2 more
core +2 more sources

