首页> 外文期刊>Soft computing: A fusion of foundations, methodologies and applications >Updating generalized association rules with evolving fuzzy taxonomies
【24h】

Updating generalized association rules with evolving fuzzy taxonomies

机译:用演化的模糊分类法更新广义关联规则

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

摘要

Mining generalized association rules with fuzzy taxonomic structures has been recognized as an important extension of generalized associations mining problem. To date most work on this problem, however, required the taxonomies to be static, ignoring the fact that the taxonomies of items cannot necessarily be kept unchanged. For instance, some items may be reclassified from one hierarchy tree to another for more suitable classification, abandoned from the taxonomies if they will no longer be produced, or added into the taxonomies as new items. Additionally, the membership degrees expressing the fuzzy classification may also need to be adjusted. Under these circumstances, effectively updating the discovered generalized association rules is a crucial task. In this paper, we examine this problem and propose two novel algorithms, called FDiff_ET and FDiff_ET*, to update the discovered generalized frequent itemsets. Empirical evaluations show that our algorithms can maintain their performance even in high degree of taxonomy evolution, and are significantly faster than applying the contemporary fuzzy generalized association mining algorithm FGAR to the database with evolving taxonomy.
机译:具有模糊分类学结构的广义关联规则的挖掘已被认为是广义关联挖掘问题的重要扩展。迄今为止,有关此问题的大多数工作都要求分类法是静态的,而忽略了项目分类法不一定必须保持不变的事实。例如,某些项目可能会从一个层次结构树重新分类到另一棵树,以进行更合适的分类;如果不再生产它们,则从分类法中放弃;或者作为新项目添加到分类法中。另外,表达模糊分类的隶属度也可能需要调整。在这种情况下,有效地更新发现的广义关联规则是至关重要的任务。在本文中,我们研究了这个问题,并提出了两种新颖的算法FDiff_ET和FDiff_ET *,以更新发现的广义频繁项集。实证评估表明,即使在高度分类学发展的情况下,我们的算法也可以保持其性能,并且比将当代模糊广义关联挖掘算法FGAR应用于具有不断发展的分类学的数据库要快得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号