ACCDS: A Criminal Community Detection System Based on Evolving Social Graphs

  • Xiaoli Wang
  • Meihong WangEmail author
  • Jianshan Han
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11158)


This paper presents an intelligent criminal community detection system, called ACCDS, to support various criminal event detection tasks such as drug abuse behavior discovery and illegal pyramid selling organization detection, based on evolving social graphs. The system contains four main components: data collection, community social graph construction, criminal community detection and data visualization. First, the system collects a large amount of e-government data from several real communities. The raw data consist of demographic data, social relations, house visiting records, and sampled criminal records. To protect the privacy, we desensitize the real data using some data processing techniques, and extract the important features for profiling the human behaviors. Second, we use a large static social graph to model the social relations of all residents and a sequence of time-evolving graphs to model the house visiting data for each house owner. With the graph models, we formulate the criminal community detection tasks as the subgraph mining problem, and implement a subgraph detection algorithm based on frequent pattern mining. Finally, the system provides very user-friendly interfaces to visualize the detected results to the corresponding user.


Evolving social graphs Criminal community detection Subgraph mining Data visualization 



This work is supported by the National Natural Science Foundation of China under Grant No. 61702432, the Fundamental Research Funds for Central Universities of China under Grant No. 20720180070, and the International Cooperation Projects of Fujian Province in China under Grant No. 2018I0016.


  1. 1.
    Gupta, M., Gao, J., Aggarwal, C.C., Han, J.: Outlier Detection for Temporal Data. Synthesis Lectures on Data Mining and Knowledge Discovery. Morgan & Claypool Publishers, San Rafael (2014)CrossRefGoogle Scholar
  2. 2.
    Mannhardt, F., de Leoni, M., Reijers, H.A., van der Aalst, W.M.P.: Data-driven process discovery - revealing conditional infrequent behavior from event logs. In: Dubois, E., Pohl, K. (eds.) CAiSE 2017. LNCS, vol. 10253, pp. 545–560. Springer, Cham (2017). Scholar
  3. 3.
    Akoglu, L., Tong, H., Koutra, D.: Graph based anomaly detection and description: a survey. Data Min. Knowl. Discov. 29(3), 626–688 (2014)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Ranshous, S., Shen, S., Koutra, D., et al.: Anomaly detection in dynamic networks: a survey. Wiley Interdisc. Rev. Comput. Stat. 7(3), 223–247 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Kaur, R., Singh, S.: A survey of data mining and social network analysis based anomaly detection techniques. Egypt. Inform. J. 17(2), 199–216 (2016)CrossRefGoogle Scholar
  6. 6.
    Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: IEEE International Conference on Data Mining, pp. 313–320 (2002)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Software School of Xiamen UniversityXiamenChina

Personalised recommendations