INTRODUCTION - Imbalanced Learning: Foundations, Algorithms, and Applications - page 9

17. X. Y. Liu, J. Wu, and Z. H. Zhou, “Exploratory under-sampling for class-imbalance
learning,” in Proceedings of International Conference on Data Mining (Washington,
DC, USA), pp. 965-969, IEEE Computer Society, 2006.
18. S. Chen, H. He, and E. A. Garcia, “RAMOBoost: Ranked minority over-sampling in
boosting,” IEEE Transactions on Neural Networks , vol. 21, no. 10, pp. 1624-1642,
2010.
19. I. Tomek, “Two modifications of CNN,” IEEE Transactions on System, Man, and
Cybernetics , vol. 6, pp. 769-772, 1976.
20. J. Laurikkala, “Improving identification of difficult small classes by balancing class
distribution,” in Proceedings of Conference AI in Medicine in Europe: Artificial Intel-
ligence Medicine , pp. 63-66, 2001.
21. C. Elkan, “The foundations of cost-sensitive learning,” in Proceedings of International
Joint Conference on Artificial Intelligence , pp. 973-978, 2001.
22. K. M. Ting, “An instance-weighting method to induce cost-sensitive trees,” IEEE
Transactions on Knowledge and Data Engineering , vol. 14, no. 3, pp. 659-665,
2002.
23. G. M. Weiss, “Mining with rarity: A unifying framework,” ACM SIGKDD Explo-
rations Newsletter , vol. 6, no. 1, pp. 7-19, 2004.
24. M. A. Maloof, “Learning when data sets are imbalanced and when costs are unequal
and unknown,” in Proceedings of International Conference on Machine Learning,
Workshop on Learning from Imbalanced Data Sets II , 2003.
25. B. Zadrozny, J. Langford, and N. Abe, “Cost-sensitive learning by cost-proportionate
example weighting,” in Proceedings of International Conference on Data Mining , pp.
435-442, 2003.
26. P. Domingos, “MetaCost: A general method for making classifiers cost-sensitive,” in
Proceedings of International Conference on Knowledge Discovery and Data Mining ,
pp. 155-164, 1999.
27. Y. Sun, M. S. Kamel, A. K. C. Wong, and Y. Wang, “Cost-sensitive boosting for clas-
sification of imbalanced data,” Pattern Recognition , vol. 40, no. 12, pp. 3358-3378,
2007.
28. W. Fan, S. J. Stolfo, J. Zhang, and P. K. Chan, “AdaCost: Misclassification cost-
sensitive boosting,” in Proceedings of International Conference on Machine Learning ,
pp. 97-105, 1999.
29. M. Z. Kukar and I. Kononenko, “Cost-sensitive learning with neural networks,” in
Proceedings of European Conference on Artificial Intelligence , pp. 445-449, 1998.
30. X. Y. Liu and Z. H. Zhou, “Training cost-sensitive neural networks with methods
addressing the class imbalance problem,” IEEE Transactions on Knowledge and Data
Engineering , vol. 18, no. 1, pp. 63-77, 2006.
31. P. Domingos and M. Pazzani, “Beyond independence: Conditions for the optimality
of the simple Bayesian classifier,” Machine Learning , 105-112, 1996.
32. G. R. I. Webb and M. J. Pazzani, “Adjusted probability naive Bayesian induction,” in
Australian Joint Conference on Artificial Intelligence (Brisbane, Australia), Springer,
pp. 285-295, 1998.
33. G. Fumera and F. Roli, “Support vector machines with embedded reject option,” in
Proceedings of International Workshop on Pattern Recognition with Support Vector
Machines , (Niagara Falls, Canada), pp. 68-82, Springer-Verlag, 2002.