首页> 外文会议>International Confernec on Neural Information Processing >The Rough Set-Based Algorithm for Two Steps
【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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号