Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/237263 
Year of Publication: 
2021
Citation: 
[Journal:] Financial Innovation [ISSN:] 2199-4730 [Volume:] 7 [Issue:] 1 [Publisher:] Springer [Place:] Heidelberg [Year:] 2021 [Pages:] 1-20
Publisher: 
Springer, Heidelberg
Abstract: 
To solve the high-dimensionality issue and improve its accuracy in credit risk assessment, a high-dimensionality-trait-driven learning paradigm is proposed for feature extraction and classifier selection. The proposed paradigm consists of three main stages: categorization of high dimensional data, high-dimensionality-trait-driven feature extraction, and high-dimensionality-trait-driven classifier selection. In the first stage, according to the definition of high-dimensionality and the relationship between sample size and feature dimensions, the high-dimensionality traits of credit dataset are further categorized into two types: 100 < feature dimensions < sample size, and feature dimensions ≥ sample size. In the second stage, some typical feature extraction methods are tested regarding the two categories of high dimensionality. In the final stage, four types of classifiers are performed to evaluate credit risk considering different high-dimensionality traits. For the purpose of illustration and verification, credit classification experiments are performed on two publicly available credit risk datasets, and the results show that the proposed high-dimensionality-trait-driven learning paradigm for feature extraction and classifier selection is effective in handling high-dimensional credit classification issues and improving credit classification accuracy relative to the benchmark models listed in this study.
Subjects: 
Classifier selection
Credit risk classification
Feature extraction
High dimensionality
Trait-driven learning paradigm
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size
936.99 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.