One-class classification: taxonomy of study and review of techniques

被引:413
作者
Khan, Shehroz S. [1 ]
Madden, Michael G. [2 ]
机构
[1] Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
[2] Natl Univ Ireland, Coll Engn & Informat, Galway, Ireland
关键词
ONE-CLASS CLASSIFIERS; NEIGHBOR DATA DESCRIPTION; SUPPORT VECTOR MACHINES; ONE-CLASS SVM; ANOMALY DETECTION; NOVELTY DETECTION; LEARNING ALGORITHM; RECOGNITION; ENSEMBLES; PERFORMANCE;
D O I
10.1017/S026988891300043X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One-class classification (OCC) algorithms aim to build classification models when the negative class is either absent, poorly sampled or not well defined. This unique situation constrains the learning of efficient classifiers by defining class boundary just with the knowledge of positive class. The OCC problem has been considered and applied under many research themes, such as outlier/novelty detection and concept learning. In this paper, we present a unified view of the general problem of OCC by presenting a taxonomy of study for OCC problems, which is based on the availability of training data, algorithms used and the application domains applied. We further delve into each of the categories of the proposed taxonomy and present a comprehensive literature review of the OCC algorithms, techniques and methodologies with a focus on their significance, limitations and applications. We conclude our paper by discussing some open research problems in the field of OCC and present our vision for future research.
引用
收藏
页码:345 / 374
页数:30
相关论文
共 183 条
[1]  
Alashwal H., 2006, Int. J. Biomed. Sci, V1, P120
[2]  
[Anonymous], 2003, P 20 INT C MACH LEAR
[3]  
[Anonymous], P 5 ANN C ADV SCH CO
[4]  
[Anonymous], 2002, P 15 NIPS INT C NEUR
[5]  
[Anonymous], 2015, Linear and Nonlinear Programming
[6]  
[Anonymous], P 20 IR C ART INT CO
[7]  
Bache K., 2013, UCI Machine Learning Repository
[8]  
Ban T, 2006, IEEE IJCNN, P327
[9]  
Bartkowiak Anna M., 2011, International Journal of Computer Information Systems and Industrial Management Applications, V3, P61
[10]   An empirical comparison of voting classification algorithms: Bagging, boosting, and variants [J].
Bauer, E ;
Kohavi, R .
MACHINE LEARNING, 1999, 36 (1-2) :105-139