Learning over subconcepts: Strategies for 1-class classification

被引:14
作者
Sharma, Shiven [1 ]
Somayaji, Anil [2 ]
Japkowicz, Nathalie [1 ,3 ]
机构
[1] Univ Ottawa, Sch Informat Technol & Engn, Ottawa, ON K1N 6N5, Canada
[2] Carleton Univ, Sch Comp Sci, Ottawa, ON, Canada
[3] Amer Univ, 4400 Massachusetts Ave NW, Washington, DC 20016 USA
基金
加拿大自然科学与工程研究理事会;
关键词
anomaly detection; classification; machine learning; 1-class classification; ENSEMBLES; SYSTEM;
D O I
10.1111/coin.12128
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In machine learning research and application, multiclass classification algorithms reign supreme. Their fundamental property is the reliance on the availability of data from all known categories to induce effective classifiers. Unfortunately, data from so-called real-world domains sometimes do not satisfy this property, and researchers use methods such as sampling to make the data more conducive for classification. However, there are scenarios in which even such explicit methods to rectify distributions fail. In such cases, 1-class classification algorithms become the practical alternative. Unfortunately, domain complexity severely impacts their ability to produce effective classifiers. The work in this article addresses this issue and develops a strategy that allows for 1-class classification over complex domains. In particular, we introduce the notion of learning along the lines of underlying domain concepts; an important source of complexity in domains is the presence of subconcepts, and by learning over them explicitly rather than on the entire domain as a whole, we can produce powerful 1-class classification systems. The level of knowledge regarding these subconcepts will naturally vary by domain, and thus, we develop 3 distinct methodologies that take the amount of domain knowledge available into account. We demonstrate these over 3 real-world domains.
引用
收藏
页码:440 / 467
页数:28
相关论文
共 24 条
[1]  
[Anonymous], 2009, SIGKDD Explorations, DOI DOI 10.1145/1656274.1656278
[2]  
[Anonymous], 2005, P 28 AUSTR CS C
[3]  
[Anonymous], P WORKSH LEARN IMB D
[4]  
[Anonymous], 1997, P 14 INT C ONMACHINE
[5]  
Bellinger C., 2011, 2011 IEEE SSCI Symposium on Computational Intelligence for Security and Defense Applications (CISDA 2011), P88, DOI 10.1109/CISDA.2011.5945945
[6]  
Bellinger C, 2011, T COMPUTATIONAL COLL, V7190, P1
[7]  
Bellinger C., 2010, P SUMMERSIM MULT, P452
[8]   One-Class versus Binary Classification: Which and When? [J].
Bellinger, Colin ;
Sharma, Shiven ;
Japkowicz, Nathalie .
2012 11TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA 2012), VOL 2, 2012, :102-106
[9]  
Denil M, 2010, LECT NOTES ARTIF INT, V6085, P220
[10]   One class random forests [J].
Desir, Chesner ;
Bernard, Simon ;
Petitjean, Caroline ;
Heutte, Laurent .
PATTERN RECOGNITION, 2013, 46 (12) :3490-3506