Kernel projection algorithm for large-scale SVM problems.

DOI10.1007/BF02948824zbMATH Open1057.68096MaRDI QIDQ1850682FDOQ1850682

Jue Wang, Jiaqi Wang, Q. Tao

Publication date: 2002

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Recommendations

• A novel geometric nearest point algorithm for constructing support vector machine classifiers
• scientific article; zbMATH DE number 1974617
• Projection support vector machine generators
• An efficient support vector machine learning method with second-order cone programming for large-scale problems
• A linear support vector machine solver for a large number of training examples

zbMATH Keywords

Support Vector Machinestatistical machine learningnearest point pair problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Finding the Point of a Polyhedron Closest to the Origin
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
• Kernel projection algorithm for large-scale SVM problems.

Cited In (5)

• Projection support vector machine generators
• A \(\nu \)-twin support vector machine (\(\nu \)-TSVM) classifier and its geometric algorithms
• A comparative study on large scale kernelized support vector machines
• Kernel projection algorithm for large-scale SVM problems.
• A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty

This page was built for publication: Kernel projection algorithm for large-scale SVM problems.

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