Guaranteed Classification via Regularized Similarity Learning

DOI10.1162/NECO_a_00556zbMath1410.68316arXiv1306.3108OpenAlexW2129127886WikidataQ45033678 ScholiaQ45033678MaRDI QIDQ5378332

Zheng-Chu Guo, Yiming Ying

Publication date: 12 June 2019

Published in: Neural Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Online regularized learning with pairwise loss functions ⋮ Indefinite Proximity Learning: A Review ⋮ Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning

Cites Work

• Generalization bounds for metric and similarity learning
• Empirical margin distributions and bounding the generalization error of combined classifiers
• Regularization networks with indefinite kernels
• Ranking and empirical minimization of \(U\)-statistics
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• 10.1162/153244302760200704
• 10.1162/153244303321897690
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guaranteed Classification via Regularized Similarity Learning