计算机与现代化 ›› 2013, Vol. 1 ›› Issue (1): 1-4.doi:

• 算法设计与分析 •    下一篇

基于聚类分析检索团伙多起犯罪的迭代算法 

杨 静1，王 靖2   

  1. 1.解放军电子工程学院网络系，安徽合肥230037； 2.中国科学技术大学计算机科学与技术学院
  • 收稿日期:2012-09-24 修回日期:1900-01-01 出版日期:2013-02-06 发布日期:2013-02-06

Iterative Algorithm of Searching Gang Several Crimes Based on Clustering Analysis 

YANG Jing1, WANG Jing2   

  1. 1. Network Department， Electronic Engineering Institute of PLA, Hefei 230037, China; 2. College of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China
  • Received:2012-09-24 Revised:1900-01-01 Online:2013-02-06 Published:2013-02-06

摘要：

将数据挖掘技术应用到公安机关侦查犯罪的过程当中，针对危害人民利益的团伙多起犯罪案件，提出一种确定性的算法，该算法基于社会网络理论和层次聚类方法，找出形成团伙多起犯罪的关联关系，用迭代拓展集合的方法将有关联关系的案件分类成一个个子集合，每个子集合中案件进行匹配查找，找出团伙多起犯罪的案件及共同犯罪嫌疑人。本文提出的这种算法相比之前的基本解决方案，大大提高工作效率，降低查询的运行时间。

关键词: 关键词：社会网络, 聚类, 迭代拓展, 团伙多起犯罪案件

Abstract:

The data mining technology is applied to the investigation of a crime process in the public security organs, considering the gang several crime cases is harm to the interests of the people, the paper proposes a kind of definite algorithm which is based on the theory of social network and the method of hierarchical clustering analysis to find out the association rules of the gang several crime cases, then uses iteratively expand set method to classify cases into a child set which has the relationship, it can match and find out the gang several crime cases and joint crime suspect in each subsets of cases. Compare to the old basic solution, the algorithms greatly improve work efficiency, reduce the running time of inquires.

Key words: Key words: social network, cluster, iteratively expand, gang several crime cases

版权所有 © 《计算机与现代化》编辑部
地址：江西省南昌市西湖区井冈山大道1416号　邮编：330003
电话：0791－86490996　 传真：0791-86492535　 Email：jgsdd@163.com
本系统由北京玛格泰克科技发展有限公司设计开发