Kernel Treelets

12/12/2018
by   Hedi Xia, et al.
12

A new method for hierarchical clustering is presented. It combines treelets, a particular multiscale decomposition of data, with a projection on a reproducing kernel Hilbert space. The proposed approach, called kernel treelets (KT), effectively substitutes the correlation coefficient matrix used in treelets with a symmetric, positive semi-definite matrix efficiently constructed from a kernel function. Unlike most clustering methods, which require data sets to be numeric, KT can be applied to more general data and yield a multi-resolution sequence of basis on the data directly in feature space. The effectiveness and potential of KT in clustering analysis is illustrated with some examples.

READ FULL TEXT

page 9

page 10

research
01/04/2016

Kernel Sparse Subspace Clustering on Symmetric Positive Definite Manifolds

Sparse subspace clustering (SSC), as one of the most successful subspace...
research
02/14/2021

A Forward Backward Greedy approach for Sparse Multiscale Learning

Multiscale Models are known to be successful in uncovering and analyzing...
research
02/18/2021

Domain Adaptive Learning Based on Sample-Dependent and Learnable Kernels

Reproducing Kernel Hilbert Space (RKHS) is the common mathematical platf...
research
07/03/2018

One-Class Kernel Spectral Regression for Outlier Detection

The paper introduces a new efficient nonlinear one-class classifier form...
research
08/16/2019

Kernel Sketching yields Kernel JL

The main contribution of the paper is to show that Gaussian sketching of...
research
01/21/2020

Face Verification via learning the kernel matrix

The kernel function is introduced to solve the nonlinear pattern recogni...
research
02/27/2020

Kernel Bi-Linear Modeling for Reconstructing Data on Manifolds: The Dynamic-MRI Case

This paper establishes a kernel-based framework for reconstructing data ...

Please sign up or login with your details

Forgot password? Click here to reset