About the non-convex optimization problem induced by non-positive semidefinite kernel learning

DOI10.1007/s11634-008-0033-4zbMath1284.90058OpenAlexW1993371222MaRDI QIDQ2442765

Ingo Mierswa, Katharina Morik

Publication date: 1 April 2014

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-008-0033-4

zbMATH Keywords

kernel methodsnon-convex optimizationsupport vector machine

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05) Compliance or weight optimization in solid mechanics (74P05)

Related Items (1)

Indefinite Proximity Learning: A Review

Uses Software

• UCI-ml
• SVMlight
• LIBSVM
• ElemStatLearn
• StatLib Datasets Archive

Cites Work

• Unnamed Item
• Unnamed Item
• Evolution strategies. A comprehensive introduction
• Some results on Tchebycheffian spline functions and stochastic processes
• 10.1162/15324430152748236
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: About the non-convex optimization problem induced by non-positive semidefinite kernel learning