| FP-array在计算机犯罪挖掘中的应用 |
| |
| 引用本文： | 李献礼,陈业纲.FP-array在计算机犯罪挖掘中的应用[J].电子科技大学学报(社会科学版),2009(4). |
| |
| 作者姓名： | 李献礼 陈业纲 |
| |
| 作者单位： | 长江师范学院网络信息中心;长江师范学院计算机科学系; |
| |
| 基金项目： | 重庆市教委科学研究项目(KJ091305) |
| |
| 摘 要： | 针对现代社会计算机犯罪中电子证据的收集难度很大,且海量的电子证据之间的相关性不易分析的问题,对基于FP-Tree的最大频繁模式(FP-Max)挖掘算法的优缺点进行了分析,根据FP-Max算法所存在的缺点并结合实际提出一种通过构建FP矩阵的FP-array的高性能关联规则挖掘算法,并将该算法用于典型的计算机犯罪电子证据的相关性数据挖掘中,可用于成功地挖掘比较常见的五类计算机犯罪数据,挖掘结果可为实际的破案过程提供重要参考。
|
| 关 键 词： | 关联规则 最大频蘩模式 频繁项集 FP-array 最大频繁模式 |
Computer Crime Data Mining Based on FP-array |
| |
| LI Xian-li , CHEN Ye-gang.Computer Crime Data Mining Based on FP-array[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),2009(4). |
| |
| Authors: | LI Xian-li CHEN Ye-gang |
| |
| Institution: | 1. Computer Network Information Center;Yangtze Normal University Fuling Chongqing 408000;2. Department of Computer Science;Yangtze Normal University Fuling Chongqing 408000 |
| |
| Abstract: | Since the electronic evidence is difficult to collect in the computer crime in morden society, a new high-performance algorithm for mining association rules based on the construction of the FP-array is proposed according to the discuss of the maximal frequent patterns (FP-Max) algorithm based on FP-tree. Five kinds of common data of computer-related crime are mined successfully by using the new algorithm. The mining results can provide important reference in actual detection process. |
| |
| Keywords: | association rules data mining frequent item sets FP-array FP-Max |
| 本文献已被 CNKI 等数据库收录！ |
