EigenCrime: An Algorithm for Criminal Network Mining Based on Trusted Computing

The searches on criminal network have become a key issue recent years, as the criminal activities are becoming grouping and networking. Most researches mainly focus on network of criminals, few on network of suspects and the traditional method is studying the static structure of the network, without explaining the behaviours among the nodes. In this paper, we are motivated by the ideal of EigenTrust algorithm to calculate the suspicion score of every member in the network of suspects and figure out the activists in the network by the score, supporting decision making for the police. Experiment results show high rank of criminals and low rank of innocents in a practical suspect network and prove the efficiency and accuracy of EigenCrime.

[1]  Stephanie Forrest,et al.  A sense of self for Unix processes , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[2]  Zou Peng,et al.  A Recommendation-Based Peer-to-Peer Trust Model , 2004 .

[3]  Hsinchun Chen,et al.  Criminal network analysis and visualization , 2005, CACM.

[4]  Hsinchun Chen,et al.  COPLINK: managing law enforcement data and knowledge , 2003, CACM.

[5]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[6]  Jianhua Ma,et al.  Dual-EigenRep: A Reputation-Based Trust Model for P2P File-Sharing Networks , 2010, 2010 7th International Conference on Ubiquitous Intelligence & Computing and 7th International Conference on Autonomic & Trusted Computing.

[7]  Lada A. Adamic,et al.  Computational Social Science , 2009, Science.

[8]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[9]  Valdis E. Krebs,et al.  Mapping Networks of Terrorist Cells , 2001 .