首页> 外文会议>2010 IEEE International Conference on Fuzzy Systems >FPrep: Fuzzy clustering driven efficient automated pre-processing for fuzzy association rule mining
【24h】

FPrep: Fuzzy clustering driven efficient automated pre-processing for fuzzy association rule mining

机译:FPrep:用于模糊关联规则挖掘的模糊聚类驱动的高效自动化预处理

获取原文

摘要

Conventional Association Rule Mining (ARM) algorithms usually deal with datasets with binary values, and expect any numerical values to be converted to binary ones using sharp partitions, like Age = 25 to 60. In order to mitigate this constraint, Fuzzy logic is used to convert quantitative values of attributes to binary ones, so as to eliminate any loss of information arising due to sharp partitioning, especially at partition boundaries, and then generate fuzzy association rules. But, before any fuzzy ARM algorithm can be used, the original dataset (with crisp attributes) needs to be transformed into a form with fuzzy attributes. This paper describes a methodology, called FPrep, to do this pre-processing, which first involves using fuzzy clustering to generate fuzzy partitions, and then uses these partitions to get a fuzzy version (with fuzzy records) of the original dataset. Ultimately, the fuzzy data (fuzzy records) are represented in a standard manner such that they can be used as input to any kind of fuzzy ARM algorithm, irrespective of how it works and processes fuzzy data. We also show that FPrep is much faster than other such comparable transformation techniques, which in turn depend on non-fuzzy techniques, like hard clustering (CLARANS and CURE). Moreover, we illustrate the quality of the fuzzy partitions generated using FPrep, and the number of frequent itemsets generated by a fuzzy ARM algorithm when preceded by FPrep.
机译:常规的关联规则挖掘(ARM)算法通常处理具有二进制值的数据集,并期望使用锐度分区(例如Age = 25到60)将任何数值转换为二进制值。将属性的定量值转换为二进制值,以消除因锐利分区(尤其是分区边界)而引起的任何信息丢失,然后生成模糊关联规则。但是,在可以使用任何模糊ARM算法之前,需要将原始数据集(具有清晰属性)转换为具有模糊属性的形式。本文介绍了一种进行此预处理的方法,称为FPrep,该方法首先涉及使用模糊聚类生成模糊分区,然后使用这些分区来获取原始数据集的模糊版本(带有模糊记录)。最终,模糊数据(模糊记录)以标准方式表示,这样它们就可以用作任何种类的模糊ARM算法的输入,而不管其如何工作和处理模糊数据。我们还表明,FPrep比其他此类可比较的转换技术要快得多,后者又依赖于非模糊技术,例如硬聚类(CLARANS和CURE)。此外,我们说明了使用FPrep生成的模糊分区的质量,以及在FPrep之前使用模糊ARM算法生成的频繁项集的数量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号