首页> 外文会议>Australian Joint Conference on Artificial Intelligence; 20051205-09; Sydney(AU) >On a Mathematical Relationship Between the Fixed Point and the Closed Itemset in Association Rule Mining
【24h】

On a Mathematical Relationship Between the Fixed Point and the Closed Itemset in Association Rule Mining

机译:关联规则挖掘中不动点与闭项集之间的数学关系

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

摘要

Association rule mining is one of important research topics in knowledge discovery and data mining. Recent promising direction of association rule mining is mainly to mine closed itemsets. Based on the Galois closed operators, a mathematical relationship between the fixed point and closed itemset in association rule mining is discussed and several properties are obtained. To mine all frequent closed itemsets is equal to build the fixed point lattice and mine its all points that satisfy support constraints. A new method for visualization of association rules based on the generalized association rule base is also proposed.
机译:关联规则挖掘是知识发现和数据挖掘中的重要研究主题之一。关联规则挖掘的近期有希望的方向主要是挖掘封闭项集。基于伽罗瓦封闭算子,讨论了关联规则挖掘中不动点与封闭项集之间的数学关系,并获得了若干性质。挖掘所有频繁的封闭项目集等于建立定点晶格并挖掘满足支撑约束的所有点。提出了一种基于广义关联规则库的关联规则可视化新方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号