Pruned random subspace method for one-class classifiers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6713 LNCS, Issue , 2011, Pages 96-105

  Cheplygina, Veronika ^a   Tax, David M J ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Ensemble learning; One class classification; Pruning Ensembles; Random Subspace Method

Indexed keywords

CONSISTENCY CRITERIA; ENSEMBLE LEARNING; FEATURE SPACE; ONE-CLASS CLASSIFICATION; ONE-CLASS CLASSIFIER; PRUNING ENSEMBLES; RANDOM SUBSPACE METHOD; SUPERVISED AREAS; TARGET CLASS; TRAINING DATA;

CONTENT BASED RETRIEVAL;

EID: 80052979522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21557-5_12     Document Type: Conference Paper

References (24)

1. Biggio, B., Fumera, G., Roli, F.: Multiple classifier systems under attack. In: El Gayar, N., Kittler, J., Roli, F. (eds.) MCS 2010. LNCS, vol. 5997, pp. 74-83. Springer, Heidelberg (2010)
2. Bradley, A.: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition 30(7), 1145-1159 (1997)
3. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123-140 (1996)
4. Bryll, R., Gutierrez-Osuna, R., Quek, F.: Attribute bagging: improving accuracy of classifier ensembles by using random feature subsets. Pattern Recognition 36(6), 1291-1302 (2003)
5. Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: A survey. ACM Computing Surveys 41(3), 1-58 (2009)
6. Cheplygina, V.: Random subspace method for one-class classifiers. Master's thesis, Delft University of Technology (2010)
7. DD tools, the Data Description toolbox for Matlab, http://prlab.tudelft. nl/david-tax/dd-tools.html
8. Demšar, J.: Statistical comparisons of classifiers over multiple data sets. The Journal of Machine Learning Research 7, 1-30 (2006)
9. Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association 32(200), 675-701 (1937)
10. Ho, T.: The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(8), 832-844 (1998)
11. Kittler, J., Hatef, M., Duin, R., Matas, J.: On combining classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(3), 226-239 (2002)
12. Lazarevic, A., Kumar, V.: Feature bagging for outlier detection. In: 11th ACM SIGKDD Int. Conf. on Knowledge Discovery in Data Mining, pp. 157-166 (2005)
13. Nanni, L.: Experimental comparison of one-class classifiers for online signature verification. Neurocomputing 69(7-9), 869-873 (2006)
14. Nemenyi, P.: Distribution-free multiple comparisons. Ph.D. thesis, Princeton (1963)
15. OC classifier results, http://homepage.tudelft.nl/n9d04/occ/index.html
16. Oza, N., Tumer, K.: Classifier ensembles: Select real-world applications. Information Fusion 9(1), 4-20 (2008)
17. PRtools, Matlab toolbox for Pattern Recognition, http://www.prtools.org
18. Rokach, L.: Collective-agreement-based pruning of ensembles. Computational Statistics & Data Analysis 53(4), 1015-1026 (2009)
19. Schapire, R., Freund, Y.: Experiments with a new boosting algorithm. In: 13th Int. Conf. on Machine Learning, p. 148. Morgan Kaufmann, San Francisco (1996)
20. Tax, D., Duin, R.: Combining one-class classifiers. In: Kittler, J., Roli, F. (eds.) MCS 2001. LNCS, vol. 2096, pp. 299-308. Springer, Heidelberg (2001)
21. Tax, D.: One-class classification; Concept-learning in the absence of counterexamples. Ph.D. thesis, Delft University of Technology (June 2001)
22. Tax, D., Muller, K.: A consistency-based model selection for one-class classification. In: 17th Int. Conf. on Pattern Recognition, pp. 363-366. IEEE, Los Alamitos (2004)
23. UCI Machine Learning Repository, http://archive.ics.uci.edu/ml/
24. Zhou, Z., Wu, J., Tang, W.: Ensembling neural networks: Many could be better than all. Artificial Intelligence 137(1-2), 239-263 (2002)