首页> 外文会议>International conference on computational collective intelligence >A Novel Method for Mining Class Association Rules with Itemset Constraints
【24h】

A Novel Method for Mining Class Association Rules with Itemset Constraints

机译:具有项目集约束的类关联规则的新方法

获取原文

摘要

Mining class association rules with itemset constraints is very popular in mining medical datasets. For example, when classifying which populations are at high risk for the HIV infection, epidemiologists often concentrate on rules which include demographic information such as sex, age, and marital status in the rule antecedents. However, two existing methods, post-processing and pre-processing, require much time and effort. In this paper, we propose a lattice-based approach for efficiently mining class association rules with itemset constraints. We first build a lattice structure to store all frequent itemsets. We then use paternity relations among nodes to discover rules satisfying the constraint without re-building the lattice. The experimental results show that our proposed method outperforms other methods in the mining time.
机译:具有项目集约束的类关联规则的挖掘在挖掘医学数据集中非常流行。例如,当对哪些人群的HIV感染风险高进行分类时,流行病学家通常会关注规则,这些规则包括人口统计学信息,例如规则中的性别,年龄和婚姻状况。但是,后处理和预处理这两种现有方法需要大量时间和精力。在本文中,我们提出了一种基于格的方法来有效地挖掘具有项集约束的类关联规则。我们首先建立一个网格结构来存储所有频繁的项目集。然后,我们使用节点之间的亲子关系来发现满足约束条件的规则,而无需重新构建晶格。实验结果表明,本文提出的方法在采矿时间上优于其他方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号