Return
Fast structural ensemble for One-Class Classification
DOI:10.1016/j.patrec.2016.06.028.png)
Abstract
En 中文
One of the most important issues of One-Class Classification (OCC) algorithm is how to capture the characteristics of the positive class. Existing structural or clustering based ensemble OCC algorithms build description models for every cluster of the training dataset. However, the introduction of clustering algorithm also causes some problems, such as the determination of the number of clusters and the additional computational complexity. In this paper, we propose Fast Structural Ensemble One-Class Classifier (FS-EOCC) which is a fast framework for converting a common OCC algorithm to structural ensemble OCC algorithm. FS-EOCC adopts two rounds of complementary clustering with fixed number of clusters. This number is calculated according to the number of training samples and the complexity of the base OCC algorithm. Each partition found in the previous step is used to train one base OCC model. Finally all base models are modularly aggregated to build the structural OCC model. Experimental results show that FS-EOCC outperforms existing structural or clustering based OCC algorithms and state-of-the-art nonstructural OCC algorithms. The comparison of running time for these algorithms indicates that FS-EOCC is an efficient framework because the cost of converting a common OCC algorithm to a structural OCC algorithm is small and acceptable. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
One-class classifier
Clustering
Structural ensemble
Divide-and-conquer
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
Cited Papers
Estimating the number of clusters in a numerical data set via quantization error modeling
PATTERN RECOGNITION
IF7.6

