Abstract
The classification problem consists of using some known objects, usually described by a large vector of features, to induce a model that classifies others into known classes. The present paper deals with the optimization of Nearest Neighbor Classifiers via Metaheuristic Algorithms. The Metaheuristic Algorithms used include tabu search, genetic algorithms and ant colony optimization. The performance of the proposed algorithms is tested using data from 1411 firms derived from the loan portfolio of a leading Greek Commercial Bank in order to classify the firms in different groups representing different levels of credit risk. Also, a comparison of the algorithm with other methods such as UTADIS, SVM, CART, and other classification methods is performed using these data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aha D.W. and Bankert R.L. (1996). A comparative evaluation of sequential feature selection algorithms. In: Fisher, D. and Lenx, J.-H. (eds) Artificial Intelligence and Statistics, pp 12. Springer-Verlag, New York
Breiman L., Friedman J., Olshen R. and Stone C.J. (1984). Classification and Regression Trees. Chapman and Hall, New York
Cantu-Paz, E.: Feature Subset Selection, Class Separability, and Genetic Algorithms. Genetic and Evolutionary Computation Conference, pp. 959–970 (2004)
Cantu-Paz, E., Newsam, S., Kamath, C.: Feature selection in scientific application. In: Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 788–793 (2004)
Dorigo M. and Stutzle T. (2004). Ant Colony Optimization, A Bradford Book. The MIT Press, Cambridge
Doumpos, M., Zopounidis, C.: Multicriteria Decision Aid Classification Methods Kluwer Academic Publishers, Dordrecht (2002)
Doumpos M., Kosmidou K., Baourakis G. and Zopounidis C. (2002). Credit risk assessment using a multicriteria hierarchical discrimination approach: a comparative analysis. Eur. J. Oper. Res. 138: 392–412
Duda R.O., Hart P.E. and Stork D.G. (2001). Pattern Classification and Scene Analysis 2nd edn. John Wiley and Sons, New York
Giudici P. (2003). Applied Data Mining: Statistical Methods for Business and Industry. John Wiley and Sons, Chichester
Glover F. (1989). Tabu search I. ORSA J. Comput. 1(3): 190–206
Glover F. (1990). Tabu search II. ORSA J. Comput. 2(1): 4–32
Goldberg D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, INC, Massachussets
Hastie T., Tibshirani R. and Friedman J. (2001). The Elements of Statistical Learning; Data mining, Inference, and Prediction. Springer Series in Statistics, Springer-Verlag, New York
Holland J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI
Huberty C.J. (1994). Applied Discriminant Analysis. John Wiley, New York
Jacquet-Lagrèze E. (1995). An application of the UTA discriminant model for the evaluation of R&D projects. In: Pardalos, P.M., Siskos, Y. and Zopounidis, C. (eds) Advances in Multicriteria Analysis, pp 203–211. Kluwer Academic Publishers, Dordrecht
Jain A. and Zongker D. (1997). Feature selection: evaluation, application and small sample performance. IEEE Transactions on Pattern Analysis and Machine Intelligence 19: 153–158
Kira, K., Rendell, L.: A practical approach to feature selection. In:Proceedings of the Ninth International Conference on Machine Learning, pp. 249–256. Aberdeen, Scotland (1992)
Kohavi R. and John G. (1997). Wrappers for feature subset selection. Artif Intelli 97: 273–324
Lopez F.G., Torres M.G., Batista B.M., Perez J.A.M. and Moreno-Vega J.M. (2006). Solving feature subset selection problem by a parallel scatter search. Eur. J. Oper. Res. 169: 477–489
Marinakis Y., Migdalas A. and Pardalos P.M. (2005). A hybrid genetic-GRASP algorithm using langrangean relaxation for the traveling salesman problem. J. Combi. Optim. 10: 311–326
Narendra P.M. and Fukunaga K. (1977). A branch and bound algorithm for feature subset selection. IEEE Trans. Comput. 26(9): 917–922
Pudil P., Novovicova J. and Kittler J. (1994). Floating search methods in feature selection. Pattern Recognit. Lett. 15: 1119–1125
Reeves C.R. (1995). Genetic algorithms. In: Reeves, C.R. (eds) Modern Heuristic Techniques for Combinatorial Problems, pp 151–196. McGraw - Hill, London
Reeves C.R. (2003). Genetic algorithms. In: Glover, F. and Kochenberger, G.A. (eds) Handbooks of Metaheuristics, pp 55–82. Kluwer Academic Publishers, Dordrecht
Rego C. and Glover F. (2002). Local search and metaheuristics. In: Gutin, G. and Punnen, A. (eds) The Traveling Salesman Problem and its Variations, pp 309–367. Kluwer Academic Publishers, Dordrecht
Siedlecki W. and Sklansky J. (1989). A note on genetic algorithms for large-scale feature selection. Pattern Recognition Lett. 10: 335–347
Siedlecki W. and Sklansky J. (1988). On automatic feature selection. Int. J. Pattern Recogn. Artif. Intell. 2(2): 197–220
Specht D. (1990). Probabilistic neural networks. Neural Networks 3: 109–118
Vapnik V.N. (1998). Statistical Learning Theory. Wiley, New York
Zhang, C., Hu, H.: Ant colony optimization combining with mutual information for feature selection in support vector machines. In: Zhang, S., Jarvis, R. (eds.) AI 2005, pp. 918–921. LNAI 3809 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Marinakis, Y., Marinaki, M., Doumpos, M. et al. Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment. J Glob Optim 42, 279–293 (2008). https://doi.org/10.1007/s10898-007-9242-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-007-9242-1