Data complexity measures and nearest neighbor classifiers: A practical analysis for meta-learning

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 1, Issue , 2012, Pages 1065-1069

  Cavalcanti, George D C ^a   Ren, Tsang Ing ^a   Vale, Breno A ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPLEXITY; EXPERIMENTAL STUDIES; METALEARNING; NEAREST NEIGHBOR CLASSIFIER; REAL DATA SETS;

ARTIFICIAL INTELLIGENCE;

FORECASTING;

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

References (17)

1. T. M. Cover and P. E. Hart, "Nearest neighbor pattern classification", IEEE Transactions on Information Theory, vol. 13, pp.21-27, 1967.
2. E. B. Mansilla and T. K. Ho, "On classifier domains of competence", International Conference on Pattern Recognition, pp. 136-139, 2004.
3. S. Y. Sohn, "Meta Analysis of Classification Algorithms for Pattern Recognition", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, pp 1137-1144, 1999.
4. R. A. Mollineda, J. S. Sanchez and J. M. Sotoca, "A meta-learning framework for pattern classification by means of data complexity measures", Inteligencia artificial: Revista Iberoamericana de Inteligencia Artificial, vol. 10, pp. 31-38, 2006.
5. J. S. Sanchez et al., "An analysis of how training data complexity affects the nearest neighbor classifiers," Pattern Analysis and Applications, vol. 10, pp. 189-201, 2007.
6. A. Frank and A. Asuncion, UCI Machine Learning Repository, [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science, 2010.
7. D. J. Hand and V. Vinciotti , "Choosing k for two-class nearest neighbor classifiers with unbalanced classes", Pattern Recognition Letters, vol. 24, pp.1555-1562, 2003.
8. N. Japkowicz and S. Stephen , "The class imbalance problem: a systematic study", Intelligent Data Analysis, vol. 6, pp.429-449, 2002.
9. C. S. Pereira and G. D. C. Cavalcanti, 'Instance Selection Algorithm based on a Ranking Procedure", International Joint Conference on Neural Networks (IJCNN), pp. 2409-2416, 2011.
10. C. S. Pereira and G. D. C. Cavalcanti. "Handwritten Connected Digits Detection: An Approach Using Instance Selection", International Conference on Image Processing (ICIP), pp. 2613-2616, 2011.
11. C. S. Pereira and G. D. C. Cavalcanti, "Prototype Selection for Handwritten Connected Digits Classification", International Conference on Document Analysis and Recognition (ICDAR), pp. 1021-1025, 2009.
12. C. S. Pereira and G. D. C. Cavalcanti, "Prototype Selection: Combining Self-generating and Gaussian Mixtures for Pattern Classification" , International Joint Conference on Neural Networks (IJCNN), pp. 3505-3510, 2008.
13. T. K. Ho and M. Basu, "Complexity measures of supervised classification problems", IEEE Transactions on PAMI, vol. 24, pp. 289-300, 2002.
14. R. A. Mollineda et al., "Data Characterization for Effective Prototype Selection", Iberian Conference on Pattern Recognition and Image Analysis, pp. 27-34, 2005.
15. D. L. Wilson, "Asymptotic Properties of Nearest Neighbor Rules Using Edited Data", IEEE Transactions on Systems, Man and Cybernetics, vol. 2, pp. 408-421, 1972.
16. J. M. Sotoca, J. S. Snchez and R. A. Mollineda, "A review of data complexity measures and their applicability to pattern classification problems", Taller Nacional de Mineria de Datos y Aprendizaje, TAMIDA, pp. 77-83, 2005.
17. D. A. Zighed, S. Lallich and F. Muhlenbac, "A statistical approach of class separability", Applied Stochastic Models in Business and Industry, vol. 21(2), pp. 187-197, 2005.