FOUNDATIONS OF IMBALANCED LEARNING - Imbalanced Learning: Foundations, Algorithms, and Applications - page 41

39. D. Carvalho and A. A. Freitas, “A genetic algorithm for discovering small-disjunct
rules in data mining,” Applied Soft Computing , vol. 2, no. 2, pp. 75 - 88, 2002.
40. D. Carvalho and A. A. Freitas, “New results for a hybrid decision tree/genetic algo-
rithm for data mining,” in Proceedings of the Fourth International Conference on
Recent Advances in Soft Computing (Nottingham, UK), pp. 260 - 265, Nottingham
Trent University, 2002.
41. M. Joshi, R. Agarwal, and V. Kumar, “Mining needles in a haystack: Classifying rare
classes via two-phase rule induction,” in SIGMOD '01 Conference on Management
of Data (Santa Barbara, CA, USA), pp. 91 - 102, ACM, 2001.
42. B. Zadrozny, J. Langford, and N. Abe, “Cost-sensitive learning by cost-proportionate
example weighting,” in Proceedings of the Third IEEE International Conference on
Data Mining (Melbourne, FL, USA), IEEE Computer Society, pp. 435 - 442, 2003.
43. C. Elkan, “The foundations of cost-sensitive learning,” in Proceedings of the Sev-
enteenth International Conference on Machine Learning (Stanford, CA, USA), pp.
239 - 246, Morgan Kaufmann, 2001.
44. W. Fan, S. Stolfo, J. Zhang, and P. Chan, “Adacost: Misclassification cost-sensitive
boosting,” in Proceedings of the Sixteenth International Conference on Machine
Learning (Bled, Slovenia), pp. 99 - 105, Morgan Kaufmann, 1999.
45. M. Joshi, V. Kumar, and R. C. Agarwal, “Evaluating boosting algorithms to classify
rare cases: Comparison and improvements,” in First IEEE International Conference
on Data Mining (San Jose, CA, USA), IEEE Computer Society, pp. 257 - 264, 2001.
46. N. Chawla, A. Lazarevic, L. Hall, and K. Bowyer, “SMOTEBoost: Improving pre-
diction of the minority class in boosting,” in Proceedings of Principles of Knowledge
Discovery in Databases (Cavtat-Dubrovnik, Croatia), pp. 107 - 119, Springer, 2003.
47. N. Japkowicz, C. Myers, and M. Gluck, “A novelty detection approach to classifi-
cation,” in Proceedings of the Fourteenth Joint Conference on Artificial Intelligence
(Montreal, Quebec, Canada), pp. 518 - 523, Morgan Kaufmann, 1995.
48. B. Raskutti and A. Kowalczyk, “Extreme re-balancing for SVMs: A case study,” in
ICML Workshop on Learning from Imbalanced Data Sets II (Washington, DC), 2003.
49. W. Cohen, “Fast effective rule induction,” in Proceedings of the Twelfth International
Conference on Machine Learning (Tahoe City, CA, USA), pp. 115 - 123, Morgan
Kaufmann, 1995.
50. M. Kubat, R. Holte, and S. Matwin, “Learning when negative examples abound,” in
Machine Learning: ECML-97 , Lecture Notes in Artificial Intelligence , vol. 1224, pp.
146 - 153, Springer, 1997.
51. L. Breiman, J. Friedman, R. Olshen, and C. Stone, Classification and Regressions
Trees . Boca Raton, FL: Chapman and Hall/CRC Press, 1984.