Ordinal Pairwise Partitioning (OPP) Approach to Neural Networks Training in Bond rating

Abstract

Statistical classification methods such as multivariate discriminant analysis have been widely used in bond rating classification in spite of the limitations of the methodology. Recently, neural networks have emerged as new methods for business classification. This approach to neural networks training is to categorize a new instance as one of the predefined bond classes. Such a conventional approach has limitations in dealing with the ordinal nature of bond rating. In addition, most of the prior studies have used sample data which are evenly divided among the classes. However, the natural population in real application is usually unevenly divided among the classes. Under such circumstances, it is hard to achieve good predictive performance. As the number of classes to be recognized increases, the predictive performance decreases. In this article, to increase the predictive performance in real-world bond rating, we propose the ordinal pairwise partitioning (OPP) approach to backpropagation neural networks training. The main idea of the OPP approach is to partition the data set in the ordinal and pairwise manner according to the output classes. Then, each backpropagation neural networks model is trained by using each partitioned data set and is separately used for classification. Experimental results show that the predictive performance of the proposed OPP approach can be significantly enhanced, when compared to the conventional neural networks modeling approach as well as multivariate discriminant analysis. The OPP approach has two computation methods, and we discuss under which circumstances one method performs better than the other. We also show the generalizability of the OPP approach. © 1997 by John Wiley & Sons, Ltd.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 67 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.