A One-Class Classification method based on Expanded Non-Convex Hulls

被引:4
作者
Novoa-Paradela, David [1 ]
Fontenla-Romero, Oscar [1 ]
Guijarro-Berdinas, Bertha [1 ]
机构
[1] Univ A Coruna, CITIC, Campus Elvina S-N, La Coruna 15008, Spain
关键词
Machine learning; One-Class Classification; Convex Hull; Delaunay triangulation; Random projections; Ensemble learning; STATISTICAL COMPARISONS; ANOMALY DETECTION; CLASSIFIERS; ALGORITHM;
D O I
10.1016/j.inffus.2022.07.023
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents an intuitive, robust and efficient One-Class Classification algorithm. The method developed is called OCENCH (One-class Classification via Expanded Non-Convex Hulls) and bases its operation on the construction of subdivisible and expandable non-convex hulls to represent the target class. The method begins by reducing the dimensionality of the data to two-dimensional spaces using random projections. After that, an iterative process based on Delaunay triangulations is applied to these spaces to obtain simple polygons that characterizes the non-convex shape of the normal class data. In addition, the method subdivides the non -convex hulls to represent separate regions in space if necessary. The method has been evaluated and compared to several main algorithms of the field using real data sets. In contrast to other methods, OCENCH can deal with non-convex and disjointed shapes. Finally, its execution can be carried out in a parallel way, which is interesting to reduce the execution time.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 35 条
  • [1] [Anonymous], 2000, An introduction to support vector machines and other kernel-based learning methods
  • [2] Asuncion A., 2007, UCI machine learning repository
  • [3] The Quickhull algorithm for convex hulls
    Barber, CB
    Dobkin, DP
    Huhdanpaa, H
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04): : 469 - 483
  • [4] Bingham E., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P245, DOI 10.1145/502512.502546
  • [5] LOF: Identifying density-based local outliers
    Breunig, MM
    Kriegel, HP
    Ng, RT
    Sander, J
    [J]. SIGMOD RECORD, 2000, 29 (02) : 93 - 104
  • [6] Approximate polytope ensemble for one-class classification
    Casale, Pierluigi
    Pujol, Oriol
    Radeva, Petia
    [J]. PATTERN RECOGNITION, 2014, 47 (02) : 854 - 864
  • [7] An elementary proof of a theorem of Johnson and Lindenstrauss
    Dasgupta, S
    Gupta, A
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (01) : 60 - 65
  • [8] Dasgupta S., 2013, C UNC ART INT
  • [9] Demsar J, 2006, J MACH LEARN RES, V7, P1
  • [10] Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
    Duckham, Matt
    Kulik, Lars
    Worboys, Mike
    Galton, Antony
    [J]. PATTERN RECOGNITION, 2008, 41 (10) : 3224 - 3236