摘要
基于有限L_背景的模糊格在扩展和时空复杂度上有局限。该文定义了广义的模糊概念格和其上的截运算以简化格构造,提出了一种模糊格构造算法。在概念格结点级上定义了两个模糊参数α和δ粎,以避免提取因高偏差导致的无效规则。给出一个实例,说明了从模糊概念格提取不确定规则、计算规则支持度、置信度的原则、方法。实现了构造算法与Godin算法的对比实验,结果表明本算法在时空性能上要优于Godin算法。
Fuzzy lattice based on finite L_context has limit on expansion and time and spatial complexity.Fuzzy -attributes concept lattice in common sense and cut calculation on it is defined to simplify lattice construction.A construction algorithm is presented.Two fuzzy parameters andon level of concept lattice node is defined to avoid extracting invalid association rules induced by high abbreviation.A case is given to demonstrate the principles for abstracting indefinite rules and computing support and confidence of them.A comparison experiment between construction algorithm and Godin algorithm is mode.The result show that the construction algorithm is prior to Godin algorithm on time-spatial complexity.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第29期50-53,共4页
Computer Engineering and Applications
基金
国家自然科学基金项目(编号:60275022)资助
关键词
属性模糊概念格
模糊语言变量
知识发现
fuzzy attribute concept lattice,fuzzy language variable,knowledge discovery