A new maximum margin algorithm for one-class problems and its boosting implementation

DOI10.1016/j.patcog.2004.10.010zbMath1074.68595OpenAlexW2050025334MaRDI QIDQ1779737

Jue Wang, Gao-wei Wu, Qing Tao

Publication date: 1 June 2005

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2004.10.010

zbMATH Keywords

MarginOutliersSupport vector machinesBoostingStatistical learning theoryOne-class problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Learning linear PCA with convex semi-definite programming ⋮ Approximate polytope ensemble for one-class classification ⋮ Selection-fusion approach for classification of datasets with missing values

Cites Work

• Unnamed Item
• Unnamed Item
• Support vector data description
• Arbitrary-norm separating plane
• Estimating the Support of a High-Dimensional Distribution
• A theory of the learnable
• 10.1162/15324430152748227
• Linear programming boosting via column generation

This page was built for publication: A new maximum margin algorithm for one-class problems and its boosting implementation