Boosted sparse nonlinear distance metric learning

DOI10.1002/SAM.11307MaRDI QIDQ4970187zbMATH OpenOpenAlexFDO

Authors Yuting Ma, Tian Zheng

Publication date 14 October 2020

Published in Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

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

zbMATH Keywords

boostingsparsitysupervised learning

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• Boosting a weak learning algorithm by majority
• Extensions of Lipschitz mappings into a Hilbert space
• Greedy function approximation: A gradient boosting machine.
• scientific article; zbMATH DE number 700016 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Metric Learning
• Random forests
• Sparse boosting
• Stochastic gradient boosting.
• Theory of Reproducing Kernels
• Truncated power method for sparse eigenvalue problems

Cited in

(1)

• Kernel-based measures of association

Describes a project that uses

Uses Software

• UCI
• Boruta
• CLOP
• GSML

This page was built for publication: Boosted sparse nonlinear distance metric learning

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