• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International conference on advanced data mining and applications >TKS: Efficient Mining of Top-K Sequential Patterns
【24h】

TKS: Efficient Mining of Top-K Sequential Patterns

机译：TKS：Top-K顺序模式的有效挖掘

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Sequential pattern mining is a well-studied data mining task with wide applications. However, fine-tuning the minsup parameter of sequential pattern mining algorithms to generate enough patterns is difficult and time-consuming. To address this issue, the task of top-k sequential pattern mining has been defined, where k is the number of sequential patterns to be found, and is set by the user. In this paper, we present an efficient algorithm for this problem named TKS (Top-K Sequential pattern mining). TKS utilizes a vertical bitmap database representation, a novel data structure named PMAP (Precedence Map) and several efficient strategies to prune the search space. An extensive experimental study on real datasets shows that TKS outperforms TSP, the current state-of-the-art algorithm for top-k sequential pattern mining by more than an order of magnitude in execution time and memory.
机译：顺序模式挖掘是一项经过广泛研究的数据挖掘任务，具有广泛的应用。但是，微调顺序模式挖掘算法的minsup参数以生成足够的模式既困难又耗时。为了解决这个问题，已经定义了前k个顺序模式挖掘的任务，其中k是要找到的顺序模式的数量，由用户设置。在本文中，我们提出了一个针对该问题的有效算法，称为TKS（Top-K顺序模式挖掘）。 TKS利用垂直位图数据库表示形式，名为PMAP（优先级映射）的新颖数据结构和几种有效的策略来修剪搜索空间。在真实数据集上进行的广泛实验研究表明，TKS在执行时间和内存上比TSP（用于top-k顺序模式挖掘的当前最新算法）的性能高出一个数量级。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号