计算机科学 ›› 2011, Vol. 38 ›› Issue (9): 142-145.

• 数据库与数据挖掘 • 上一篇    下一篇

模糊Horn子句规则挖掘算法研究

刘东波,卢正鼎   

  1. (华中科技大学计算机科学与技术学院 武汉 430074);(中国电子设备系统工程研究所 北京 100141)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Research on Algorithms for Mining Fuzzy Horn Clause Rules

LIU Dong-bo,LU Zheng-ding   

  • Online:2018-11-16 Published:2018-11-16

摘要: 模糊关联规则可以用自然语言来表达人类知识,受到数据挖掘与知识发现研究人员的广泛关注。但是,目前大多数模糊关联规则挖掘方法仍然基于经典关联规则的支持度和可信度测度。从模糊蕴涵的观点出发,定义了模糊Horn子句规则、支持度、蕴涵强度以及相关概念,提出了模糊Horn子句规则挖掘算法。该算法可以分解为3个步骤。首先,将定量数据库转换为模糊数据库。其次,挖掘模糊数据库中所有支持度不小于指定最小支持度阂值的频繁项目集。一旦得到了所有频繁项目集,就可以用一种直接的方法生成所有蕴涵强度不小于指定最小蕴涵强度阂值的模糊Horn子句规则。

关键词: 模糊关联规则,模糊Horn子句规则,支持度,蕴涵强度,定量数据库,模糊数据库

Abstract: Fuzzy association rules can be used to represent human knowledge in terms of natural language, and has attraded a growing amount of attention from the communities of Data Mining and Knowledge Discovery. However, so far, most approaches of mining fuzzy association rules arc based on the measures of support and confidence for classical association rules. From the viewpoint of fuzzy implications, fuzzy Horn clause rules, degree of support, implication strength and some related concepts were defined, and an algorithm was proposed for mining fuzzy Horn clause rules.This algorithm can be decomposed into three subprocess. First of all, a quantitative database is transformed into a fuzzy database. Secondly, all frequent itemsets in the fuzzy database that arc contained in a sufficient number of transactions above the minimum support threshold are identified. Once all frequent itemsets are obtained, the desired fuzzy Horn clause rules above the minimum implication strength threshold can be generated in a straightforward manner.

Key words: Fuzzy association rules, Fuzzy horn clause rules, Degree of support, Implication strength, Quantitative databases,Fuzzy databases

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!