On the k-NN performance in a challenging scenario of imbalance and overlapping

Pattern Analysis and Applications

Volumn 11, Issue 3-4, 2008, Pages 269-280

  Garcia V ^a   Mollineda, R A ^b   Sanchez J S ^b  

^a INSTITUTO TECNOLÓGICO DE TOLUCA   (Mexico)

^b UNIVERSITAT JAUME I   (Spain)

Author keywords

Class overlap; Imbalanced data; Local and global learning; Local imbalance ratio; Nearest neighbour rule; Overall imbalance ratio

Indexed keywords

EID: 50549093573     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10044-007-0087-5     Document Type: Article

References (35)

1. Domingos P (1999) Metacost: a general method for making classifiers cost-sensitive. In: Proceedings of the 5th international conference on knowledge discovery and data mining, pp 155-164
2. Gordon DF, Perlis D (1989) Explicitly biased generalization. Comput Intell 5:67-81
3. Pazzani M, Merz C, Murphy P, Ali K, Hume T, Brunk C (1994) Reducing misclassification costs. In: Proceedings 11th international conference on machine learning, pp 217-225
4. Chawla NV, Bowyer KW, Hall LO, Kegelmeyer WP (2002) SMOTE: synthetic minority over-sampling technique. J Artif Intell Res 16:321-357
5. Kubat M, Matwin S (1997) Adressing the curse of imbalanced training sets: one-sided selection. Proceedings of the 14th international conference on machine learning, pp 179-186
6. Barandela R, Sánchez JS, García V, Rangel E (2003) Strategies for learning in class imbalance problems. Pattern Recognit 36:849-851
7. Fawcett T, Provost F (1996) Adaptive fraud detection. Data Mining Knowl Discov 1:291-316
8. Japkowicz N, Stephen S (2002) The class imbalance problem: a systematic study. Intell Data Anal J 6(5):429-450
9. Jo T, Japkowicz N (2004) Class imbalances versus small disjuncts. SIGKDD Explor 6:40-49
10. Weiss GM (2003) The effect of small disjuncts and class distribution on decision tree learning. PhD thesis, Rutgers University
11. Prati RC, Batista GE, Monard MC (2004) Class imbalance versus class overlapping: an analysis of a learning system behavior. In: Proceedings of the 3rd Mexican international conference on artificial intelligence, pp 312-321
12. Orriols A, Bernardó E (2005) The class imbalance problem in learning classifier systems: a preliminary study. In: Proceedings of conference on genetic and evolutionary computation, pp 74-78
13. Visa S, Ralescu A (2003) Learning from imbalanced and overlapped data using fuzzy sets. In: Proceedings of ICML-2003 workshop: learning with imbalanced data sets II, pp 97-104
14. Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13:21-27
15. Dasarathy BV (1991) Nearest neighbor norms: NN pattern classification techniques. IEEE Computer Society Press, Los Alamos
16. Devijver PA, Kittler J (1992) Pattern recognition: a statistical approach. Prentice Hall, Englewood Cliffs
17. Hand DJ, Vinciotti V (2003) Choosing k for two-class nearest neighbour classifiers with unbalanced classes. Pattern Recognit Lett 24:1555-1562
18. Zhang J, Mani I (2003) kNN approach to unbalanced data distributions: a case study involving information extraction. In: Proceedings of workshop on learning from imbalanced datasets II, pp 42-48
19. Duda RO, Hart PE, Stork DG (2001) Pattern classification and scene analysis. Wiley, New York
20. Bishop C (1995) Neural networks for pattern recognition. Oxford University Press, USA
21. Quinlan JR (1993) C4.5: Programs for machine learning. Morgan Kaufmann, San Mateo
22. Buhmann M, Albowitz M (2003) Radial basis functions: theory and implementations. Cambridge University Press, USA
23. Cover TM (1968) Estimation by the nearest neighbor rule. IEEE Trans Inf Theory 14:50-55
24. Okamoto S, Yugami N (2003) Effects of domain characteristics on instance-based learning algorithms. Theor Comput Sci 298:207-233
25. Little RJA, Rubin DB (2002) Statistical analysis with missing data. Wiley, New York
26. Kubat M, Chen WK (1998) Weighted projection in nearest-neighbor classifiers. In: Proceedings of 1st southern symposium on computing, pp 27-34
27. Friedman JH (1997) On bias, variance, 0/1-loss, and the curse of dimensionality. Data Mining Knowl Discov 1:55-77
28. Sánchez JS, Barandela R, Marqués AI, Alejo R, Badenas J (2003) Analysis of new techniques to obtain quality training sets. Pattern Recognit Lett 24:1015-1022
29. Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is "nearest neighbor" meaningful?. In: Proceedings of 7th international conference on database theory, pp 217-235
30. Provost F, Fawcett T (1997) Analysis and visualization of classifier performance: comparison under imprecise class and cost distributions. In: Proceedings of 3rd international conference on knowledge discovery and data mining, pp 43-48
31. Huang J, Ling CX (2005) Using AUC and accuracy in evaluating learning algorithms. IEEE Trans Knowl Data Engng 17:299-310
32. Daskalaki S, Kopanas I, Avouris N (2006) Evaluation of classifiers for an uneven class distribution problem. Appl Artif Intell 20:381-417
33. Landgrebe TCW, Paclick P, Duin RPW (2006) Precision-recall operating characteristic (P-ROC) curves in imprecise environments. In: Proceedings of 18th international conference on pattern recognition, pp 123-127
34. Fawcett T (2006) ROC graphs with instance-varying costs. Pattern Recognit Lett 27:882-891
35. Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques. Morgan Kaufmann, USA