Terrorist Organization Behavior Prediction Algorithm Based on Context Subspace
- 1.3k Downloads
Researchers have developed methods to predict a terrorist organization’s probable actions (such as bombings or kidnappings). The terrorist organization’s actions can be affected by the context of the organization. Thus, the organization’s context variables can be used to improve the accuracy of forecasting the terrorist behavior. Those algorithms based on context similarity suffer a serious drawback that it can result in the algorithm’s fluctuation and reduce the prediction accuracy if not all the attributes are detected. A prediction algorithm PBCS (Prediction Based on Context Subspace) based on context subspace is proposed in this paper. The proposed algorithm first extracts the context subspace according to the association between the context attributes and the behavior attributes. Then, it predicts the terrorist behavior based on the extracted context subspace. The proposed algorithm uses the improved spectral clustering method to obtain the context subspace. It concerns the distribution of the data samples, the label information and the local similarity of the data in the process of extracting the subspace. Experimental results on the artificial dataset and the MAROB dataset show that the prediction method proposed in this paper can not only improve the prediction accuracy but also reduce the prediction fluctuation.
Keywordsterrorism behavior prediction context knowledge context subspace spectral analysis
Unable to display preview. Download preview PDF.
- 6.Samir, K., Martinez, V., Nau, D., et al.: Finding Most Probable Worlds of Probabilistic Logic Programs. In: 1st International Conference on Scalable Uncertainty Management, pp. 45–57. IEEE Press, Washington DC (2007)Google Scholar
- 9.Daoqiang, Z., Songcan, C.: High-dimensional Data Reduction Methods. Communications of the CCF 5(8), 15–22 (2009) (in Chinese)Google Scholar
- 13.Xiaoyan, C., Guanzhong, D., Libin, Y.: Survey on Spectral Clustering Algorithm. Computer Science 35(7), 14–18 (2008) (in Chinese)Google Scholar
- 14.Minorities at Risk Project, http://www.cidcm.umd.edu/mar
- 18.Qiu, X., Wu, L.: Stepwise Nearest Neighbor Discriminate Analysis. In: IJCAI, pp. 829–834. Morgan Kaufmann Press, San Francisco (2005)Google Scholar
- 19.Haw-Ren, F., Sophia, S., Yousef, S.: Multilevel Manifold Learning with Application to Spectral Clustering. In: CIKM 2010, pp. 419–428. ACM Press, New York (2010)Google Scholar
- 20.Donghui, Y., Ling, H., Jordan, M.: Fast Approximate Spectral Clustering. In: 15th ACM Conference on Knowledge Discovery and Data Mining, pp. 907–915. ACM Press, New York (2010)Google Scholar