A review on distance based time series classification
Time series classification is an increasing research topic due to the vast amount of time
series data that is being created over a wide variety of fields. The particularity of the data …
series data that is being created over a wide variety of fields. The particularity of the data …
[PDF][PDF] Similarity-based classification: Concepts and algorithms.
This paper reviews and extends the field of similarity-based classification, presenting new
analyses, algorithms, data sets, and a comprehensive set of experimental results for a rich …
analyses, algorithms, data sets, and a comprehensive set of experimental results for a rich …
[图书][B] Mathematics for machine learning
The fundamental mathematical tools needed to understand machine learning include linear
algebra, analytic geometry, matrix decompositions, vector calculus, optimization, probability …
algebra, analytic geometry, matrix decompositions, vector calculus, optimization, probability …
Wasserstein weisfeiler-lehman graph kernels
M Togninalli, E Ghisu… - Advances in neural …, 2019 - proceedings.neurips.cc
Most graph kernels are an instance of the class of R-Convolution kernels, which measure
the similarity of objects by comparing their substructures. Despite their empirical success …
the similarity of objects by comparing their substructures. Despite their empirical success …
[PDF][PDF] Semi-supervised classification by low density separation
O Chapelle, A Zien - International workshop on artificial …, 2005 - proceedings.mlr.press
We believe that the cluster assumption is key to successful semi-supervised learning. Based
on this, we propose three semi-supervised algorithms: 1. deriving graph-based distances …
on this, we propose three semi-supervised algorithms: 1. deriving graph-based distances …
Grassmann discriminant analysis: a unifying view on subspace-based learning
In this paper we propose a discriminant learning framework for problems in which data
consist of linear subspaces instead of vectors. By treating subspaces as basic elements, we …
consist of linear subspaces instead of vectors. By treating subspaces as basic elements, we …
Kernel methods on Riemannian manifolds with Gaussian RBF kernels
In this paper, we develop an approach to exploiting kernel methods with manifold-valued
data. In many computer vision problems, the data can be naturally represented as points on …
data. In many computer vision problems, the data can be naturally represented as points on …
Kernel methods on the Riemannian manifold of symmetric positive definite matrices
Abstract Symmetric Positive Definite (SPD) matrices have become popular to encode image
information. Accounting for the geometry of the Riemannian manifold of SPD matrices has …
information. Accounting for the geometry of the Riemannian manifold of SPD matrices has …
[PDF][PDF] Probability product kernels
The advantages of discriminative learning algorithms and kernel machines are combined
with generative modeling using a novel kernel between distributions. In the probability …
with generative modeling using a novel kernel between distributions. In the probability …
Learning SVM in Kreĭn spaces
This paper presents a theoretical foundation for an SVM solver in Kreĭn spaces. Up to now,
all methods are based either on the matrix correction, or on non-convex minimization, or on …
all methods are based either on the matrix correction, or on non-convex minimization, or on …