Abstract
Gradient tree boosting (GTB) is a newly emerging artificial intelligence technique in crime forecasting. GTB is a stage-wise additive framework that adopts numerical optimisation methods to minimise the loss function of the predictive model which later enhances it predictive capabilities. The applied loss function plays critical roles that determine GTB predictive capabilities and performance. GTB uses the least square function as its standard loss function. Motivated by this limitation, the study is conducted to observe and identify a potential replacement for the current loss function in GTB by applying a different existing standard mathematical function. In this study, the crime models are developed based on GTB with a different loss function to compare its forecasting performance. From this case study, it is found that among the tested loss functions, the least absolute deviation function outperforms other loss functions including the GTB standard least square loss function in all developed crime models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ismail, S., Ramli, N.: Short-term crime forecasting in Kedah. Procedia - Soc. Behav. Sci. 91, 654–660 (2013)
Rather, A.M., Sastry, V., Agarwal, A.: Stock market prediction and Portfolio selection models: a survey. OPSEARCH 54, 1–22 (2017)
Alwee, R.: Swarm optimized support vector regression with autoregressive integrated moving average for modeling of crime rate. Unpublished dissertation in partial fulfillment of the requirements for the degree of Doctor of Philosophy, Universiti Teknologi Malaysia, Johor Bahru, Malaysia (2014)
Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29, 1189–1232 (2001)
Chandrasekar, A., Raj, A.S., Kumar, P.: Crime prediction and classification in San Francisco City. CS229 Technical report: Machine Learning. Stanford Computer Science Department: Stanford University (2015)
Nguyen, T.T., Hatua, A., Sung, A.H.: Building a learning machine classifier with inadequate data for crime prediction. J. Adv. Inf. Technol., 8 (2017)
Natekin, A., Knoll, A.: Gradient boosting machines, a tutorial. Front. Neurorobotics 7, 21 (2013)
Guelman, L.: Gradient boosting trees for auto insurance loss cost modeling and prediction. Expert Syst. Appl. 39, 3659–3667 (2012)
Breiman, L.: Arcing the edge. Technical report 486, Statistics Department, University of California, Berkeley (1997)
Freeman, E.A., Moisen, G.G., Coulston, J.W., Wilson, B.T.: Random forests and stochastic gradient boosting for predicting tree canopy cover: comparing tuning processes and model performance. Can. J. For. Res. 46, 323–339 (2015)
Pedregosa, G.V.F., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825–2830 (2011)
Yang, W., Wang, K., Zuo, W.: Neighborhood component feature selection for high-dimensional data. J. Comput. 7, 161–168 (2012)
Castelli, M., Sormani, R., Trujillo, L., Popovič, A.: Predicting per capita violent crimes in urban areas: an artificial intelligence approach. J. Ambient. Intell. Hum. Comput. 8, 29–36 (2017)
Elith, J., Leathwick, J.R., Hastie, T.: A working guide to boosted regression trees. J. Anim. Ecol. 77, 802–813 (2008)
Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 785–794 (2016)
Chen, T., He, T.: Higgs boson discovery with boosted trees. In: NIPS Workshop on High-energy Physics and Machine Learning, pp. 69–80 (2015)
Chen, Y., Jia, Z., Mercola, D., Xie, X.: A gradient boosting algorithm for survival analysis via direct optimization of concordance index. Comput. Math. Methods Med. 2013, 8 (2013)
Ding, F., Ge, Q., Jiang, D., Fu, J., Hao, M.: Understanding the dynamics of terrorism events with multiple-discipline datasets and machine learning approach. PloS One 12 (2017). Article no. e0179057
Dubey, N., Chaturvedi, S.K.: A survey paper on crime prediction technique using data mining. Int. J. Eng. Res. Appl. 4(3), 396–400 (2014)
Acknowledgement
This work was supported by FRGS research grant granted by Malaysian Ministry of Education with grant number R.J130000.7828.4F825 for School of Computing, Universiti Teknologi Malaysia (UTM).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Khairuddin, A.R., Alwee, R., Haron, H. (2020). A Proposed Gradient Tree Boosting with Different Loss Function in Crime Forecasting and Analysis. In: Saeed, F., Mohammed, F., Gazem, N. (eds) Emerging Trends in Intelligent Computing and Informatics. IRICT 2019. Advances in Intelligent Systems and Computing, vol 1073. Springer, Cham. https://doi.org/10.1007/978-3-030-33582-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-33582-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33581-6
Online ISBN: 978-3-030-33582-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)