{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:48:50Z","timestamp":1777391330580,"version":"3.51.4"},"reference-count":28,"publisher":"SAGE Publications","issue":"1-2","license":[{"start":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T00:00:00Z","timestamp":1524009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Algorithmic Finance"],"published-print":{"date-parts":[[2018,6,21]]},"abstract":"<jats:p>Credit scoring (CS) is an important process in both banking and finance. Lenders or creditors have to use CS to predict the probability that a borrower will default or become delinquent. CS is usually based on variables related to the applicant such as: his age, his historical payments, his behavior, etc. This paper first proposes a new method for variable selection. The proposed method (VS-VNS) is based on the variable neighborhood search meta-heuristic. VS-VNS allows us to select a set of significant variables for the data classification task. The VS-VNS is combined then with a Bayesian network (BN) to build models for CS and select counterparties. Further, six search methods are studied for BN on different sets of variables. The different techniques and combinations are evaluated on some well-known financial datasets. The numerical results are promising and show the benefits of the new proposed approach (VS-VNS) for data classification and credit scoring.<\/jats:p>","DOI":"10.3233\/af-180227","type":"journal-article","created":{"date-parts":[[2018,4,20]],"date-time":"2018-04-20T10:56:47Z","timestamp":1524221807000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":11,"title":["A new variable selection method applied to credit scoring"],"prefix":"10.1177","volume":"7","author":[{"given":"Dalila","family":"Boughaci","sequence":"first","affiliation":[{"name":"LRIA\/Computer Science Department, University of Sciences and Technology Houari Boumediene, USTHB - BP 32 El-Alia, Beb-Ezzoaur, Algiers, Algeria"}]},{"given":"Abdullah A.K.","family":"Alkhawaldeh","sequence":"additional","affiliation":[{"name":"Department of Accounting, Faculty of Economics and Administrative Sciences, The Hashemite University, Zarqa, Jordan"}]}],"member":"179","published-online":{"date-parts":[[2018,4,18]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.01.076"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.005"},{"key":"ref003","first-page":"34","volume-title":"LNCS 3907","author":"Bonilla Huerta E.B.","year":"2006"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-010-9127-z"},{"key":"ref005","unstructured":"Breiman, L., Friedman, J., Olshen, R., Stone, C. 1984. Classification and Regression Trees, Belmont, CA: Wadsworth."},{"key":"ref006","doi-asserted-by":"crossref","unstructured":"Caruana, R., Freitag, D. 1994. Greedy attribute selection, In Proceedings of the eleventh international conference on machine learning, (ICML 1994, New Brunswick, New Jersey), Morgan Kauffmann, pp. 28\u201336.","DOI":"10.1016\/B978-1-55860-335-6.50012-X"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00246-4"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007465528199"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-288-1_42"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ref011","unstructured":"HallM. 1999. Correlation-based Feature Selection for Machine Learning, Methodology 21i195-i20(April), 1\u20135."},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-985X.1997.00078.x"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.2307\/2348414"},{"key":"ref014","unstructured":"Hansen, P. 1986. The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming, Presented at the Congresson Numerical Methods in Combinatorial Optimization, Capri, Italy."},{"key":"ref015","first-page":"22","volume-title":"Proceedings of the th national conference on artificial intelligence","author":"Hoos H.H.","year":"2000"},{"key":"ref016","first-page":"338","volume-title":"Proceedings of the eleventh conference on uncertainty in artificial intelligence","author":"John G.H.","year":"1995"},{"key":"ref017","unstructured":"Jolliffe, I.T. 2002. Principal Component Analysis, Series: Springer Series in Statistics, 2nd ed. Springer, NY, 2002, XXIX, 487 p. 28 illus. ISBN 978-0-387-95442-4."},{"key":"ref018","first-page":"273","author":"Kohavi R.","year":"1996","journal-title":"Special issue on relevance"},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2010.11.022"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref022","first-page":"3","author":"Mester L.J.","year":"1997","journal-title":"Business Review (September)"},{"issue":"42","key":"ref023","first-page":"30","volume":"107","author":"Miller M.","year":"2003","journal-title":"National Underwriter"},{"issue":"1","key":"ref024","first-page":"37","volume":"2","author":"Powers D.M W.","year":"2011","journal-title":"Journal of Machine Learning Technologies"},{"key":"ref025","first-page":"221","volume":"21","author":"Quinlan J.R.","journal-title":"Int J Man-Machine Studies"},{"key":"ref026","unstructured":"Sousaa, M.R., Gamaa, J., Brandao, E. 2015. A new dynamic modeling framework for credit risk assessment, Expert Systems With Applications October 16, 2015."},{"key":"ref027","unstructured":"Waikato Environment for Knowledge Analysis (WEKA), Version 3.9. The University ofWaikato, Hmilton, New Zealand, Software available at http:\/\/www.cs.waikato.ac.nz\/_ml\/weka\/: Accessed: On November 2017."},{"key":"ref028","doi-asserted-by":"publisher","DOI":"10.2307\/2330408"}],"container-title":["Algorithmic Finance"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AF-180227","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AF-180227","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AF-180227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T09:52:56Z","timestamp":1777369976000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AF-180227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,18]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,6,21]]}},"alternative-id":["10.3233\/AF-180227"],"URL":"https:\/\/doi.org\/10.3233\/af-180227","relation":{},"ISSN":["2158-5571","2157-6203"],"issn-type":[{"value":"2158-5571","type":"print"},{"value":"2157-6203","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,18]]}}}