【24h】

Approximate clustering in association rules

机译:关联规则中的近似聚类

获取原文

摘要

Data mining holds the promise of extracting unsuspected information from very large databases. One difficulty is that discovery techniques are often drawn from methods in which the amount of work increases geometrically with data quantity. Consequentially, the use of these methods is problematic in very large databases. Categorically based association rules are a linearly complex data mining methodology. Unfortunately, rules formed from categorical data often generate many fine grained rules. The concern is how fine grained rules might be aggregated and the role that non-categorical data might have. It appears that soft computing techniques may be useful.
机译:数据挖掘有望从大型数据库中提取出可疑信息。一个困难是发现技术通常是从工作量随数据量几何增加的方法中汲取的。因此,在非常大的数据库中使用这些方法是有问题的。基于分类的关联规则是线性复杂的数据挖掘方法。不幸的是,由分类数据形成的规则通常会生成许多细粒度的规则。令人担忧的是细粒度的规则可能如何聚合以及非分类数据可能扮演的角色。看来软计算技术可能是有用的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号