计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (33): 170-172.

• 数据库与信息处理 • 上一篇    下一篇

基于概念格的关联规则挖掘

谢福鼎,王照飞   

  1. 辽宁师范大学 计算机信息与技术学院,辽宁 大连 116029
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-21 发布日期:2007-11-21
  • 通讯作者: 谢福鼎

Association rules mining based on concept lattice

XIE Fu-ding,WANG Zhao-fei   

  1. Department of Computer and Information Technology,Liaoning Normal University,Dalian,Liaoning 116029,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-21 Published:2007-11-21
  • Contact: XIE Fu-ding

摘要: 关联规则的挖掘是知识发现领域重要的研究方向之一,因此开展这方面的研究是很有意义的。论文给出了一种基于概念格的关联规则的算法,该算法首先通过约化形式背景,然后通过给定的阈值在约简的背景上建格,最后在格上提取符合条件的关联规则。例子说明了该算法的可行性和有效性。

关键词: 概念格, 关联规则, 支持度, 数据挖掘

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.

Key words: concept lattice, association rules, support degree, data mining