Optimisation and evaluation of random forests for imbalanced datasets

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

Volumn 4203 LNAI, Issue , 2006, Pages 622-631

  Thomas, Julien ^a,b   Jouve, Pierre Emmanuel ^b   Nicoloyannis, Nicolas ^a  

^a UNIVERSITÉ LUMIÈRE LYON 2   (France)

^b Le Gemellyon Sud   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; OPTIMIZATION; QUALITY CONTROL; TREES (MATHEMATICS);

PRECISION RATES; QUALITY ASSESSMENT; RANDOM FORESTS;

RANDOM PROCESSES;

EID: 33750351882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11875604_69     Document Type: Conference Paper

References (15)

1. G.M. Weiss, "Mining with Rarity: A Unifying Framework", SIGKDD Explorations, 6(1):7-19, 2004.
2. N. Japkowicz, "The Class Imbalance Problem: Significance and Strategies", Proc. of International Conf. on Artificial Intelligence (IC-AI'2000), 2000.
3. P.K. Chan, S.J. Stolfo, "Toward scalable learning with non-uniform class and cost distributions: a case study in credit card fraud detection." Proc. of the 4th International Conf. on Knowledge Discovery and DataMining, 164-168, 2001.
4. J.W. Grzymala-Busse, Z. Zheng, L. K. Goodwin, and W. J. Grzymala-Busse, "An approach to imbalanced data sets based on changing rule strength." Learning from Imbalanced Data Sets: Papers from the AAAI Workshop, pp 69-74, AAAI Press Technical Report WS-00-05, 2000.
5. G.M. Weiss, and H. Hirsh, "Learning to predict rare events in event sequences." Proc. of the 4th International Conference on Knowledge Discovery and Data Mining, pp 359-363, 1998.
6. P. Domingos, "Metacost: A general method for making classifiers cost-sensitive.", Proc. of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 155-164, San Diego, ACM Press, 1999.
7. Pazzani, M., Merz, C., Murphy, P., Ali, K., Hume, T., Brunk, C., "Reducing misclassification costs.", Proc. of the 11th International Conference on Machine Learning, San Francisco. Morgan Kaufmann, 1994.
8. Chawla N.V., Bowyer K.W., Hall L.O., Kegelmeyer W.P. "Smote: Synthetic minority oversampling technique.", Journal of Artificial Intelligence Research, 16, pp 321-357, 2002.
9. L. Breiman, "Random Forests", In Machine Learning, vol 45(1), pp 5-32, 2001.
10. C. Chen, A. Liaw, "Using Random Forest to Learn Imbalanced Data.", Technical Report. Berkeley, Department of Statistics, University of California, 2004.
11. F. Leon, M.H. Zaharia, D. Gâlea, "Performance Analysis of Categorization Algorithms", Proc. of the 8th International Symposium on Automatic Control and Computer Science, ISBN 973-621-086-3, 2004.
12. S. Marcellin, D.A. Zigued, G. Ritschard, "An asymmetric entropy measure for decision trees", IPMU 06. Paris, France, July 2006.
13. B. Kavsek, N. Lavrac, L. Todorovski, "ROC Analysis of Example Weighting in Subgroup Discovery", European Conference on Artificial Intelligence, 2004.
14. S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, "Optimization by Simulated Annealing", Science Volume 220, Number 4598, 1983.
15. S. Hettich and S.D. Bay, "The UCI KDD Archive", Irvine, University of California, USA, Department of Information and Computer Science, 1999.