4.5 Article

Fast structural ensemble for One-Class Classification

Journal

PATTERN RECOGNITION LETTERS
Volume 80, Issue -, Pages 179-187

Publisher

ELSEVIER
DOI: 10.1016/j.patrec.2016.06.028

Keywords

One-class classifier; Clustering; Structural ensemble; Divide-and-conquer

Funding

  1. National Natural Science Foundations of China [61472302, 61272280, U1404620, 41271447]
  2. Open Projects Program of National Laboratory of Pattern Recognition [20160 0 031]
  3. Program for New Century Excellent Talents in University [NCET-12-0919]
  4. Fundamental Research Funds for the Central Universities [K5051203020, K5051303018, JB150313, JB150317, BDY081422]
  5. Special Program for Applied Research on Super Computation of the NSFC-Guangdong Joint Fund
  6. Natural Science Foundation of Shaanxi Province [2010JM8027]
  7. Creative Project of the Science and Technology State of Xi'an [CXY1441(1)]
  8. State Key Laboratory of Geo-information Engineering [SKLGIE2014-M-4-4]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available