摘要
目前对关联规则的研究主要集中在对布尔型属性关联规则的挖掘。本文引入基于云模型进行数量型属性关联规则挖掘的方法 ,并定义了云关联规则“如果 X是 A则 Y是 B”,其中 A、B分别是属性 X和 Y中由云模型描述的概念。利用这种方法得到的关联规则更容易让人理解 ,也克服了传统划分边界过硬的问题。在此基础上 ,定义了在挖掘云关联规则中支持率、可信度和相关性的计算公式 ,并阐明了它们的一般性 ,即传统的硬划分及经典的布尔型属性关联规则中支持率。
Data mining is the discovery of previously unknown, potentially useful and hidden knowledge in database. In this paper, mining association rules based on cloud model is introduced and cloud association rules of the form, “If X is A then Y is B ”, is defined to deal with quantitative attributes, where X, Y are sets of attributes and A, B are the concept represented by the cloud model. Based on this model, the calculation of minimum support, minimum confidence and correlation are redefined, and these formulas are also generalized form for calculating these conditions.
出处
《解放军理工大学学报（自然科学版）》
EI
2000年第1期29-34,共6页
Journal of PLA University of Science and Technology(Natural Science Edition)
基金
国家 8 6 3资助项目 !(3 0 6 - ZT0 6 - 0 7- 0 2 )
关键词
数据挖掘
关联规则
云模型
数据库
data mining
association rules
cloud model
cloud association rules
