Approximate polytope ensemble for one-class classification

DOI10.1016/j.patcog.2013.08.007zbMath1326.68218OpenAlexW2158139223WikidataQ63443077 ScholiaQ63443077MaRDI QIDQ898344

Petia Radeva, Pierluigi Casale, Oriol Pujol

Publication date: 8 December 2015

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

Full work available at URL: http://hdl.handle.net/2445/53584

zbMATH Keywords

convex hullhigh-dimensionalityone-class classificationensemble learningrandom projections

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

An efficient convex hull algorithm using affine transformation in planar point set ⋮ Selective ensemble of SVDDs with Renyi entropy based diversity measure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-supervised classification based on random subspace dimensionality reduction
• A linear discriminant analysis framework based on random subspace for face recognition
• General support vector representation machine for one-class classification of non-stationary classes
• Soft clustering using weighted one-class support vector machines
• A linear time algorithm for obtaining the convex hull of a simple polygon
• A new maximum margin algorithm for one-class problems and its boosting implementation
• On computing the convex hull of (piecewise) curved objects
• An algorithmic theory of learning: Robust concepts and random projection
• 10.1162/15324430260185583

This page was built for publication: Approximate polytope ensemble for one-class classification