Kernel treelets

From MaRDI portal
Publication:5237486

DOI10.1142/S2424922X19500062zbMATH Open1430.62144arXiv1812.04808OpenAlexW2903745659MaRDI QIDQ5237486FDOQ5237486

Hector D. Ceniceros, Hedi Xia

Publication date: 18 October 2019

Published in: Advances in Data Science and Adaptive Analysis (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1812.04808




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Kernel treelets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237486)