| 基于概念格的关联规则挖掘 |
| |
| 引用本文： | 谢福鼎,王照飞.基于概念格的关联规则挖掘[J].计算机工程与应用,2007,43(33):170-172. |
| |
| 作者姓名： | 谢福鼎 王照飞 |
| |
| 作者单位： | 辽宁师范大学 计算机信息与技术学院，辽宁 大连 116029 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划)
,
辽宁省教育厅资助科研课题 |
| |
| 摘 要： | 关联规则的挖掘是知识发现领域重要的研究方向之一，因此开展这方面的研究是很有意义的。论文给出了一种基于概念格的关联规则的算法，该算法首先通过约化形式背景，然后通过给定的阈值在约简的背景上建格，最后在格上提取符合条件的关联规则。例子说明了该算法的可行性和有效性。
|
| 关 键 词： | 概念格 关联规则 支持度 数据挖掘 |
| 文章编号： | 1002-8331(2007)33-0170-03 |
| 修稿时间： | 2007年9月1日 |
Association rules mining based on concept lattice |
| |
| XIE Fu-ding,WANG Zhao-fei.Association rules mining based on concept lattice[J].Computer Engineering and Applications,2007,43(33):170-172. |
| |
| Authors: | XIE Fu-ding WANG Zhao-fei |
| |
| Affiliation: | Department of Computer and Information Technology，Liaoning Normal University，Dalian，Liaoning 116029，China |
| |
| Abstract: | One of the important research branches in KDD is the association rules mining.It is therefore significant to investigate this problem.In this paper,an algorithm based on concept lattice is presented. The formal context is first reduced,and then the concept lattice is built in terms of threshold.Finally,some association rules which satisfy the conditions are obtained by concept lattice.The example shows the feasibility and validity of this method. |
| |
| Keywords: | concept lattice association rules support degree data mining |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
