Abstract—Claim prediction is an important process in the insurance industry to prepare the right type of insurance policy for each potential policyholder. The frequency of claim predictions is highly increasing that head the problem of big data in terms of both the number of features and the number of policyholders. One of machine learning paradigms to handle the problem of the big data is dimensionality reduction by using a feature selection method. In this paper, we examine a new feature selection method for claim prediction using Gram-Schmidt Orthogonalization. In this method, the next features are iteratively selected based on the farthest distance to space spanned by the current features. Therefore, the advantage of the Gram-Schmidt Orthogonalization method is that it can provide a subset of the feature ranking without ordering all features. Our simulation shows that by using only about 26% of features, the predictor can reach comparable accuracy when it uses all features. It means that the Gram-Schmidt Orthogonalization-based feature selection method may need memory usage of about 26%, which is very significant in the context of the Big Data problem.
Index Terms—Feature ranking, feature selection, Gram-Schmidt orthogonalization, big data, claim prediction.
Yuni Rosita Dewi is with Department of Mathematics, Universitas Indonesia, Indonesia (e-mail: yuni.rosita@sci.ui.ac.id).
Cite: Yuni Rosita Dewi, Hendri Murfi, and Yudi Satri, "Gram-Schmidt Orthogonalization for Feature Ranking and Selection — A Case Study of Claim Prediction," International Journal of Machine Learning and Computing vol. 10, no. 1, pp. 57-62, 2020.
Copyright © 2020 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).