摘要
在形式概念分析中的概念之间引进了包含度理论,利用包含度理论描述了概念之间的量化关系,对概念格中概念之间的亚概念和超概念进行了刻画。同时,采用包含度在概念格中进行关联规则的提取,给出了由包含度进行无冗余关联规则的提取算法,并由实例验证了该算法是有效的。
Inclusion degree theory was introduced into the concepts of formal concept analysis. In this theory,quantitative relation among concepts was described and the sub-concept and super-concept in concept lattice was depicted. Meanwhile, by using inclusion degree association rules were extracted from the concept lattice, and an algorithm of extracting non-redundant association rules was presented. Finally,an example was given to show that the algorithm is effective.
出处
《计算机科学》
CSCD
北大核心
2009年第2期210-213,219,共5页
Computer Science
基金
国家自然科学基金(60773133
70471003
60573074)
山西省自然科学基金(2007011040)资助
关键词
概念格
包含度
关联规则
Concept lattice, Inclusion degree, Association rules
