Racing for unbalanced methods selection

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

Volumn 8206 LNCS, Issue , 2013, Pages 24-31

  Dal Pozzolo, Andrea ^a   Caelen, Olivier ^b   Waterschoot, Serge ^b   Bontempi, Gianluca ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b Atos Worldline   (Belgium)

Author keywords

Fraud detection; Racing; Unbalanced data

Indexed keywords

CLASSIFICATION ALGORITHM; EXPERIMENTAL COMPARISON; FRAUD DETECTION; RACING; SPECIFIC NATURE; UNBALANCED DATA;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ENGINEERING EDUCATION;

EID: 84890882574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-41278-3_4     Document Type: Conference Paper

References (21)

1. D.N.A. Asuncion. UCI machine learning repository (2007)
2. Batista, G., Carvalho, A., Monard, M.: Applying one-sided selection to unbalanced datasets. In: Cairó, O., Cantú, F.J. (eds.) MICAI 2000. LNCS, vol. 1793, pp. 315-325. Springer, Heidelberg (2000)
3. Birattari, M.: Race: Racing methods for the selection of the best, R package version 0.1.59 (2012)
4. Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11-18 (2002)
5. Chawla, N., Bowyer, K., Hall, L., Kegelmeyer, W.: Smote: synthetic minority oversampling technique. Arxiv preprint arXiv:1106.1813 (2011)
6. Clark, P., Niblett, T.: The cn2 induction algorithm. Machine Learning 3(4), 261-283 (1989)
7. Drummond, C., Holte, R., et al.: C4. 5, class imbalance, and cost sensitivity: why under-sampling beats over-sampling. In: Workshop on Learning from Imbalanced Datasets II. Citeseer (2003)
8. Hart, P.E.: The condensed nearest neighbor rule. IEEE Transactions on Information Theory (1968)
9. Holte, R.C., Acker, L.E., Porter, B.W., et al.: Concept learning and the problem of small disjuncts. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, vol. 1. Citeseer (1989)
10. Japkowicz, N., Stephen, S.: The class imbalance problem: A systematic study. Intelligent Data Analysis 6(5), 429-449 (2002)
11. Kubat, M., Matwin, S., et al.: Addressing the curse of imbalanced training sets: onesided selection. In: Machine Learning-International Workshop Then Conference, pp. 179-186. Morgan Kaufmann Publishers, Inc. (1997)
12. Laurikkala, J.: Improving identification of difficult small classes by balancing class distribution. In: Quaglini, S., Barahona, P., Andreassen, S. (eds.) AIME 2001. LNCS (LNAI), vol. 2101, pp. 63-66. Springer, Heidelberg (2001)
13. Liu, X., Wu, J., Zhou, Z.: Exploratory undersampling for class-imbalance learning. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 39(2), 539-550 (2009)
14. Lin, K.T.M., Yao, X.: A dynamic sampling approach to training neural networks for multi-class imbalance classification. IEEE Transactions on Neural Networks and Learning Systems 24, 647-660 (2013)
15. Maron, O., Moore, A.: Hoeffding races: Accelerating model selection search for classification and function approximation, p. 263. Robotics Institute (1993)
16. Olshen, L., Stone, C.: Classification and regression trees. Wadsworth International Group (1984)
17. Quinlan, J.R.: C4. 5: programs for machine learning, vol. 1. Morgan Kaufmann (1993)
18. R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2011) ISBN 3-900051-07-0
19. Tomek, I.: Two modifications of cnn. IEEE Trans. Syst. Man Cybern. 6, 769-772 (1976)
20. Wilson, D.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man and Cybernetics (3), 408-421 (1972)
21. Wilson, D., Martinez, T.: Reduction techniques for instance-based learning algorithms. Machine Learning 38(3), 257-286 (2000)