Weighted bagging for graph based one-class classifiers

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

Volumn 5997 LNCS, Issue , 2010, Pages 1-10

  Seguí, Santi ^a,b   Igual, Laura ^a,b   Vitrià, Jordi ^a,b  

^a Edifici O ^*  (Spain)

^b UNIVERSITY OF BARCELONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; GRAPHIC METHODS; LEARNING ALGORITHMS; STATISTICS; TREES (MATHEMATICS);

CLASSIFICATION RESULTS; HIGH DIMENSIONAL DATA; LEARNING CLASSIFIERS; MINIMUM SPANNING TREES; ONE-CLASS CLASSIFIER; POSITIVE DATA; TARGET CLASS; TRAINING DATA;

CLASSIFICATION (OF INFORMATION);

EID: 77952066514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12127-2_1     Document Type: Conference Paper

References (21)

1. Tax, D.M.J.: One-class classification. PhD thesis, Delft. University of Technology (2001)
2. Bishop, C.M.: Neural Networks for Pattern Recognition, 1st edn. Oxford University Press, USA (1996)
3. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley & Sons Inc., Chichester (1973)
4. Parzen, E., Hoti, F.: On estimation of a probability density function and mode (1962)
5. Ypma, A., Ypma, E., Duin, R.P.: Support objects for domain approximation. In: ICANN 1998, Skovde, Sweden, pp. 2-4. Springer, Heidelberg (1998)
6. Schölkopf, B., Platt, J.C., Shawe-Taylor, J., Smola, A.J., Williamson, R.C.: Estimating the support of a high-dimensional distribution. Neural Computation 13, 2001 (1999)
7. Kohonen, T., Schroeder, M.R., Huang, T.S. (eds.): Self-Organizing Maps. Springer-Verlag New York, Inc., Secaucus (2001)
8. Juszczak, P., Tax, D.M.J., Pekalska, E., Duin, R.P.W.: Minimum spanning tree based one-class classifier. Neurocomput. 72(7-9), 1859-1869 (2009)
9. Kuncheva, L.I.: Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience, Hoboken (2004)
10. Breiman, L.: Bagging predictors. Machine Learning 24, 123-140 (1996)
11. Bauer, E., Kohavi, R.: An empirical comparison of voting classification algorithms: Bagging, boosting, and variants (1998)
12. Shieh, A.D., Kamm, D.F.: Ensembles of one class support vector machines. In: Benediktsson, J.A., Kittler, J., Roli, F. (eds.) MCS 2009. LNCS, vol. 5519, pp. 181-190. Springer, Heidelberg (2009)
13. Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. IEEE Ann. Hist. Comput. 7(1), 43-57 (1985)
14. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technology Journal 36, 1389-1401 (1957)
15. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1), 48-50 (1956)
16. Dietterich, T.G.: Ensemble methods in machine learning, pp. 1-15. Springer, Heidelberg (2000)
17. Marzio, M.D.: Boosting kernel density estimates: A bias reduction technique? Biometrika 91(1), 226-233 (2004)
18. Bradley, A.P.: The use of the area under the roc curve in the evaluation of machine learning algorithms. Pattern Recognition 30(7), 1145-1159 (1997)
19. Tax, D.: Ddtools, the data description toolbox for matlab (December 2009), version 1.7.3
20. Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)
21. Demšar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1-30 (2006)