【24h】

The Rough Set-Based Algorithm for Two Steps

机译:基于粗糙集的两步算法

获取原文

摘要

The previous research in mining association rules pays no attention to finding rules from imprecise data, and the traditional data mining cannot solve the multi-policy-making problem. Furthermore, in this research, we incorporate association rules with rough sets and promote a new point of view in applications. The new approach can be applied for finding association rules, which has the ability to handle uncertainty combined with rough set theory. In the research, first, we provide new algorithms modified from Apriori algorithm and then give an illustrative example. Finally, give some suggestion based on knowledge management as a reference for future research.
机译:以往关于挖掘关联规则的研究并不关注从不精确的数据中查找规则,而传统的数据挖掘无法解决多策略制定问题。此外,在这项研究中,我们将关联规则与粗糙集结合在一起,并在应用程序中推广了新的观点。该新方法可用于找到关联规则,该规则具有结合粗糙集理论处理不确定性的能力。在研究中,我们首先提供了从Apriori算法修改而来的新算法,然后给出了一个说明性的例子。最后,提出一些基于知识管理的建议,作为以后研究的参考。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号