Hashing for Financial Credit Risk Analysis
Hashing techniques have recently become the trend for accessing complex content over large data sets. With the overwhelming financial data produced today, binary embeddings are efficient tools of indexing big datasets for financial credit risk analysis. The rationale is to find a good hash function such that similar data points in Euclidean space preserve their similarities in the Hamming space for fast data retrieval. In this paper, first we use a semi-supervised hashing method to take into account the pairwise supervised information for constructing the weight adjacency graph matrix needed to learn the binarised Laplacian EigenMap. Second, we train a generalised regression neural network (GRNN) to learn the k-bits hash code. Third, the k-bits code for the test data is efficiently found in the recall phase. The results of hashing financial data show the applicability and advantages of the approach to credit risk assessment.
Keywordshashing method financial credit risk generalised regression neural network k-bits hash code
Unable to display preview. Download preview PDF.
- 6.Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Trans. on Intelligent Systems and Technology 2, 27:1–27:27 (2011), http://www.csie.ntu.edu.tw/~cjlin/libsvm
- 7.Chung, F.: Spectral Graph Theory. American Mathematical Society (1997)Google Scholar
- 10.Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: 30th STOC, pp. 604–613. ACM Press (1998)Google Scholar
- 11.Nene, S.A., Nayar, S.K.: A simple algorithm for nearest neighbor search in high dimensions. Tech. Rep. CUCS-030-95, CS Dep, University of Columbia, USA (1995)Google Scholar
- 12.Raginsky, M., Lazebnik, S.: Locality sensitive binary codes from shift-invariant kernels. In: Adv. in Neural Information Proc. Sys. (NIPS), pp. 1509–1517 (2009)Google Scholar
- 13.Ribeiro, B., Chen, N.: Graph weighted subspace learning models in bankruptcy. In: Proc. of Int. J. Conf. on Neural Networks (IJCNN), pp. 2055–2061. IEEE (2011)Google Scholar
- 16.Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Adv. in Neural Information Proc. Sys. 21 (NIPS), pp. 1753–1760 (2009)Google Scholar
- 17.Zhang, D., Wang, J., Cai, D., Lu, J.: Self-taught hashing for fast similarity search. In: Proc. of the 33rd Int. ACM SIGIR Conf. on Research and Development in Information Retrieval, pp. 18–25. ACM (2010)Google Scholar