%0 Conference Proceedings
%T Weighted Bagging for Graph based One-Class Classifiers
%A Santiago Segui
%A Laura Igual
%A Jordi Vitria
%B 9th International Workshop on Multiple Classifier Systems
%D 2010
%V 5997
%I Springer Berlin Heidelberg
%@ 0302-9743
%@ 978-3-642-12126-5
%F Santiago Segui2010
%O MILAB;OR;MV
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=1284), last updated on Wed, 28 Jul 2021 10:11:06 +0200
%X Most conventional learning algorithms require both positive and negative training data for achieving accurate classification results. However, the problem of learning classifiers from only positive data arises in many applications where negative data are too costly, difficult to obtain, or not available at all. Minimum Spanning Tree Class Descriptor (MST_CD) was presented as a method that achieves better accuracies than other one-class classifiers in high dimensional data. However, the presence of outliers in the target class severely harms the performance of this classifier. In this paper we propose two bagging strategies for MST_CD that reduce the influence of outliers in training data. We show the improved performance on both real and artificially contaminated data.
%U http://dx.doi.org/10.1007/978-3-642-12127-2_1
%P 1-10