Mining data with rare events: A case study

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 2, Issue , 2007, Pages 132-139

  Seiffert, Chris ^a   Khoshgoftaar, Taghi M ^a   Van Hulse, Jason ^a   Napolitano, Amri ^a  

^a Florida Atlantic Univ   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); CYBERNETICS;

CASE STUDIES; CLASS DISTRIBUTIONS; CLASS IMBALANCES; CLASSIFICATION MODELS; CLASSIFICATION PERFORMANCE; DATA SAMPLING; DATA SET SIZE; INTERNATIONAL CONFERENCES; PERFORMANCE IMPROVEMENTS; RARE EVENTS; TRAINING DATA;

DATA HANDLING;

EID: 48649107941     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2007.71     Document Type: Conference Paper

References (18)

1. D.W. Aha. Lazy learning. Kluwer Academic Publishers, Norwell, MA, USA, 1997.
2. R. Barandela, R. M. Valdovinos, J. S. Sanchez, and F. J. Ferri. The imbalanced training sample problem: Under or over sampling? In Joint IAPR International Workshops on Structural, Syntactic, and Statistical Pattern Recognition (SSPR/SPR'04), Lecture Notes in Computer Science 3138, (806-814), 2004.
3. C. Blake and C. Merz. UCI repository of machine learning databases. http://www.ics.uci.edu/mlearn/MLRepository.html, 1998. Department of Information and Computer Sciences, University of California, Irvine.
4. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
5. N. V. Chawla, L. O. Hall, K. W. Bowyer, and W. P. Kegelmeyer. Smote: Synthetic minority oversampling technique. Journal of Artificial Intelligence Research, (16):321-357, 2002.
6. C. Drummond and R. C. Holte. C4.5, class imbalance, and cost sensitivity: why under-sampling beats over-sampling. In Workshop on Learning from Imbalanced Data Sets II, International Conference on Machine Learning, 2003.
7. C. Elkan. The foundations of cost-sensitive learning. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 239-246, 2001.
8. H. Han, W. Y. Wang, and B. H. Mao. Borderline-SMOTE: A new over-sampling method in imbalanced data sets learning. In In International Conference on Intelligent Computing (ICIC'05). Lecture Notes in Computer Science 3644, pages 878-887. Springer-Verlag, 2005.
9. T. Jo and N. Japkowicz. Class imbalances versus small disjuncts. SIGKDD Explorations, 6(1):40-49, 2004.
10. T. M. Khoshgoftaar, E. B. Allen, and J. Deng. Using regression trees to classify fault-prone software modules. IEEE Trans. Reliability, 51(4):455-462, 2002.
11. M. Kubat and S. Matwin. Addressing the curse of imbalanced training sets: One sided selection. In Proceedings of the Fourteenth International Conference on Machine Learning, pages 179-186. Morgan Kaufmann, 1997.
12. M. Maloof. Learning when data sets are imbalanced and when costs are unequal and unknown. In Proceedings of the ICML'03 Workshop on Learning from Imbalanced Data Sets, 2003.
13. P. Turney. Types of cost in inductive concept learning. In Proceedings of the ICML-2000 Workshop on Cost-Sensitive Learning, Stanford, CA, July 2000.
14. J. Van Hulse, T. M. Khoshgoftaar, and A. Napolitano. Experimental perspectives on learning from imbalanced data. In In Proceedings of the 24th International Conference on Machine Learning, Corvallis, OR, USA, June 2007.
15. G. M. Weiss. Mining with rarity: A unifying framework. SIGKDD Explorations, 6(1):7-19, 2004.
16. G. M. Weiss and F. Provost. Learning when training data are costly: the effect of class distribution on tree induction. Journal of Artificial Intelligence Research, (19):315-354, 2003.
17. I. H. Witten and E. Frank. Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco, California, 2nd edition, 2005.
18. C. Wohlin, P. Runeson, M. Host, M. C. Ohlsson, B. Regnell, and A. Wesslen. Experimentation in Software Engineering: An Introduction. Kluwer International Series in Software Engineering. Kluwer Academic Publishers, Boston, MA, 2000.