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.
Recommendations
Cites work
- An efficient algorithm for a complete link method
- Analysis of human electrocardiogram for biometric recognition
- Hierarchical clustering schemes
- Scikit-learn: machine learning in Python
- The elements of statistical learning. Data mining, inference, and prediction
- Theoretical foundations of the potential function method in pattern recognition learning
- Treelets -- an adaptive multi-scale basis for sparse unordered data
Cited in
(6)- On simply structured bases of tree kernels
- Kernel(s) for problems with no kernel
- A subpath kernel for learning hierarchical image representations
- Profiles identification on hierarchical tree structure data sets
- Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data
- Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data
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)
