首页> 外文会议>Systems and Informatics (ICSAI), 2012 International Conference on >Mining positive and negative fuzzy association rules with multiple minimum supports
【24h】

Mining positive and negative fuzzy association rules with multiple minimum supports

机译:挖掘具有多个最小支持的正负模糊关联规则

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

摘要

Association rules mining is an important research topic in data mining and knowledge discovery. Traditional algorithms for mining association rules are built on the binary attributes databases, which has three limitations. Firstly, it can not concern quantitative attributes; secondly, only the positive association rules are discovered; thirdly, it treat each item with the same frequency although different item may have different frequency. In this paper, we put forward a discovery algorithm for mining positive and negative fuzzy association rules to resolve these three limitations
机译:关联规则挖掘是数据挖掘和知识发现中的重要研究课题。用于挖掘关联规则的传统算法是建立在二进制属性数据库上的,它具有三个限制。首先,它不能考虑数量属性。其次,只发现正关联规则。第三,尽管不同的物品可能具有不同的频率,但是它以相同的频率对待每个物品。本文提出了一种挖掘正负模糊关联规则的发现算法来解决这三个局限性

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号