【24h】

An Adaptive Sliding Window Algorithm for Mining Frequent Itemsets in Computer Forensics

机译:一种用于计算机取证中频繁项集挖掘的自适应滑动窗口算法

获取原文
获取原文并翻译 | 示例

摘要

Data mining technology is widely utilized in the field of computer criminal forensics. The research of data mining technologies, such as frequent itemset mining, clustering etc., can effectively improve the efficiency of computer forensics. However, data items of streaming data are dynamically changed along with time, which triggers off some new challenges to computer forensics. To address this issue, this paper presents an adaptive sliding window based strategy for mining the main frequent itemsets on streaming data. The key idea is to dynamically adjust the size of sliding window by exploiting the time-varying feature of streaming data, in order to satisfy the concept change that occurs in the streaming data. The experimental results show that compared with the previous work, the proposed algorithm can superiorly adapt to the time-varying feature of streaming data, and dramatically enhance time performance by reducing the data size for mining.
机译:数据挖掘技术已广泛应用于计算机犯罪取证领域。频繁项集挖掘,聚类等数据挖掘技术的研究可以有效地提高计算机取证的效率。但是,流数据的数据项会随着时间动态变化,这引发了计算机取证的一些新挑战。为了解决这个问题,本文提出了一种基于自适应滑动窗口的策略,用于在流数据上挖掘主要的频繁项集。关键思想是通过利用流数据的时变特性来动态调整滑动窗口的大小,以便满足流数据中发生的概念变化。实验结果表明,与以前的工作相比,该算法可以更好地适应流数据的时变特性,并通过减少挖掘的数据量来显着提高时间性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号