{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T23:03:50Z","timestamp":1784156630496,"version":"3.55.0"},"reference-count":37,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>The identification of personal credit risk constitutes a fundamental concern within the realm of financial risk management. As the credit industry experiences significant growth, the precise evaluation of borrowers' credit risk and the mitigation of credit default risk have emerged as critical priorities for financial institutions and researchers worldwide. To enhance the ability to identify defaulting customers, this paper proposes a credit risk identification algorithm based on Bagging Fast Correlation\u2010Based Filter with Temporal Convolutional Network (BaggingFCBF\u2010TCN). This algorithm initially incorporates the feature selection approach inherent in the Bagging strategy to identify and filter the characteristics associated with defaulting customers, which serves to mitigate the bias in feature selection outcomes that may favor the majority class. Subsequently, it employs an enhanced Temporal Convolutional Network (TCN) classifier for the purpose of credit risk assessment, thereby improving the ability to discern both long\u2010term and short\u2010term dependencies present in personal credit data. The test results show that: (1) The BaggingFCBF\u2010TCN algorithm significantly enhances the model's ability to identify defaulting customers, achieving optimal overall identification performance. (2) The results of the combination effect analysis indicate that the personal credit risk identification model constructed using the BaggingFCBF\u2010TCN combination algorithm outperforms other combination algorithms in both the original dataset and the dataset after class balancing treatment.<\/jats:p>","DOI":"10.1002\/cpe.70498","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T02:10:46Z","timestamp":1764987046000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Credit Risk Identification Algorithm Based on\n                    <scp>BaggingFCBF<\/scp>\n                    \u2010\n                    <scp>TCN<\/scp>"],"prefix":"10.1002","volume":"38","author":[{"given":"Tinggui","family":"Chen","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence and Electronic Commerce Zhejiang Gongshang University Hangzhou College of Commerce  Hangzhou China"},{"name":"School of Statistics and Data Science Zhejiang Gongshang University  Hangzhou China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hailian","family":"Gu","sequence":"additional","affiliation":[{"name":"School of Statistics and Data Science Zhejiang Gongshang University  Hangzhou China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Statistics and Data Science Zhejiang Gongshang University  Hangzhou China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1182-1707","authenticated-orcid":false,"given":"Limin","family":"Ni","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence and Electronic Commerce Zhejiang Gongshang University Hangzhou College of Commerce  Hangzhou China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"e_1_2_11_2_1","unstructured":"China FinTech and Digital Finance Development Report \u201cReleased_Financial Innovation_China Financial News [EB\/OL] \u201d2024 https:\/\/www.financialnews.com.cn\/kj\/jrcx\/202401\/t20240117_286053.html."},{"key":"e_1_2_11_3_1","unstructured":"Global Credit Outlook \u201cNew Risks New Playbook | S&P Global Ratings[EB\/OL] \u201d2024 https:\/\/www.spglobal.com\/ratings\/en\/research\u2010insights\/special\u2010reports\/global\u2010credit\u2010outlook\u20102024."},{"key":"e_1_2_11_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.35"},{"issue":"9","key":"e_1_2_11_5_1","first-page":"2257","article-title":"Feature Selection Method Based on Class Distribution Learning for Imbalanced Data","volume":"47","author":"Li K.","year":"2019","journal-title":"Computer and Digital Engineering"},{"key":"e_1_2_11_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2017.09.016"},{"issue":"2","key":"e_1_2_11_7_1","first-page":"475","article-title":"Feature Selection Algorithm for Imbalanced Data Based on Pseudo\u2010Label Consistency","volume":"42","author":"Li Y.","year":"2022","journal-title":"Computer Applications"},{"key":"e_1_2_11_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.09.006"},{"key":"e_1_2_11_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.041"},{"key":"e_1_2_11_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.11.015"},{"key":"e_1_2_11_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.10.037"},{"key":"e_1_2_11_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.02.025"},{"key":"e_1_2_11_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.06.053"},{"key":"e_1_2_11_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118732"},{"key":"e_1_2_11_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.06.023"},{"key":"e_1_2_11_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.08.029"},{"key":"e_1_2_11_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/23311975.2019.1675455"},{"key":"e_1_2_11_18_1","doi-asserted-by":"publisher","DOI":"10.25236\/AJETS.2020.030108"},{"key":"e_1_2_11_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521\u2010020\u201005489\u2010z"},{"key":"e_1_2_11_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2018.08.002"},{"key":"e_1_2_11_21_1","doi-asserted-by":"publisher","DOI":"10.4018\/JITR.2019010106"},{"key":"e_1_2_11_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116913"},{"key":"e_1_2_11_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.iswa.2023.200204"},{"key":"e_1_2_11_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118991"},{"key":"e_1_2_11_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.12.002"},{"key":"e_1_2_11_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.02.029"},{"key":"e_1_2_11_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2020.100997"},{"key":"e_1_2_11_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102236"},{"key":"e_1_2_11_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2887138"},{"key":"e_1_2_11_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106852"},{"key":"e_1_2_11_31_1","volume-title":"The Twelfth International Conference on Learning Representations","author":"Yang H.","year":"2024"},{"key":"e_1_2_11_32_1","volume-title":"Temporal Graph Learning Workshop@ NeurIPS 2023","author":"Nath P.","year":"2023"},{"key":"e_1_2_11_33_1","first-page":"856","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML\u201003)","author":"Yu L.","year":"2003"},{"key":"e_1_2_11_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2020.113346"},{"key":"e_1_2_11_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2022.104337"},{"key":"e_1_2_11_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.03.011"},{"key":"e_1_2_11_37_1","doi-asserted-by":"publisher","DOI":"10.21314\/JCR.2017.237"},{"key":"e_1_2_11_38_1","doi-asserted-by":"publisher","DOI":"10.21314\/JCR.2025.019"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T04:48:15Z","timestamp":1768193295000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.70498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1002\/cpe.70498"],"URL":"https:\/\/doi.org\/10.1002\/cpe.70498","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"2025-08-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70498"}}