首页> 外文会议>International Conference on Applications and Techniques in Cyber Intelligence >An Efficient Weighted Negative Sequence Pattern Mining Algorithm with Multiple Minimum Support
【24h】

An Efficient Weighted Negative Sequence Pattern Mining Algorithm with Multiple Minimum Support

机译:具有多个最小支持的有效加权负序模式挖掘算法

获取原文

摘要

The traditional negative sequence pattern mining algorithm is based on the same importance and probability of occurrence of each item, but it is different in the actual database. Based on the Neg-GSP algorithm, this paper proposes a weighted negative sequence pattern mining algorithm based on multiple minimum support. In the negative sequence pattern mining, different weights are set for the item, and multiple minimum support is introduced to mine the weighted frequently negative sequence patterns. The experiment uses the UCI data set to prove the accuracy and effectiveness of the algorithm, and has some improvements in the negative sequence patterns mining.
机译:传统的负序列模式挖掘算法基于每个项目的相同重要性和概率,但在实际数据库中是不同的。基于NEG-GSP算法,本文提出了一种基于多个最小支持的加权负序模式挖掘算法。在负序列模式挖掘中,为该项目设置不同的权重,并引入多个最小支持以挖掘加权频繁的负序列模式。实验使用UCI数据集来证明算法的准确性和有效性,并且对负序列模式采集的一些改进。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号