Comparisons of QP and LP based learning from empirical data

DOI10.1007/3-540-45517-5_36MaRDI QIDQ2772547zbMATH OpenFDO

Authors Vojislav Kecman, T. S. Arthanari

Publication date 19 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2070/20700326

zbMATH Keywords

learning from experimental datalinear programmingneural networksquadratic programmingsupport vector machines

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Linear programming support vector machines
• Support vector machine based on linear programming
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• Quadratic programming formulations for classificationand regression
• scientific article; zbMATH DE number 2015480

Cited in

(1)

• A meta-heuristic approach for improving the accuracy in some classification algorithms

This page was built for publication: Comparisons of QP and LP based learning from empirical data

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