Files
Document type
ArticleVersion
Accepted versionPublication date
All rights reserved
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/53584
Approximate polytope ensemble for one-class classification
Journal Title
Director/Tutor
Additional contribution
Journal ISSN
Volume Title
Abstract
In this work, a new one-class classification ensemble strategy called approximate polytope ensemble is presented. The main contribution of the paper is threefold. First, the geometrical concept of convex hull is used to define the boundary of the target class defining the problem. Expansions and contractions of this geometrical structure are introduced in order to avoid over-fitting. Second, the decision whether a point belongs to the convex hull model in high dimensional spaces is approximated by means of random projections and an ensemble decision process. Finally, a tiling strategy is proposed in order to model non-convex structures. Experimental results show that the proposed strategy is significantly better than state of the art one-class classification methods on over 200 datasets.
Related resource
Subject (English)
Citation
Citation
CASALE, Pierluigi, PUJOL VILA, Oriol and RADEVA, Petia. Approximate polytope ensemble for one-class classification. Pattern Recognition. 2014. Vol. 47, num. 2, pags. 854-864. ISSN 0031-3203. [consulted: 7 of October of 2026]. Available at: https://hdl.handle.net/2445/53584