首页 | 本学科首页   官方微博 | 高级检索  
     

一种模糊概念格构造算法研究
引用本文:强宇,刘宗田,林炜,时百胜,李云.一种模糊概念格构造算法研究[J].计算机工程与应用,2004,40(29):50-53.
作者姓名:强宇  刘宗田  林炜  时百胜  李云
作者单位:1. 上海大学计算机学院,上海,200072;蚌埠坦克学院,安徽,蚌埠,233013
2. 上海大学计算机学院,上海,200072
基金项目:国家自然科学基金项目(编号:60275022)资助
摘    要:基于有限L_背景的模糊格在扩展和时空复杂度上有局限。该文定义了广义的模糊概念格和其上的截运算以简化格构造,提出了一种模糊格构造算法。在概念格结点级上定义了两个模糊参数α和δ粎,以避免提取因高偏差导致的无效规则。给出一个实例,说明了从模糊概念格提取不确定规则、计算规则支持度、置信度的原则、方法。实现了构造算法与Godin算法的对比实验,结果表明本算法在时空性能上要优于Godin算法。

关 键 词:属性模糊概念格  模糊语言变量  知识发现
文章编号:1002-8331-(2004)29-0050-04

Research on an Algorithm for Fuzzy Concept Lattice Construction
Qiang Yu , Liu Zongtian Lin Wei Shi Baisheng Li Yun.Research on an Algorithm for Fuzzy Concept Lattice Construction[J].Computer Engineering and Applications,2004,40(29):50-53.
Authors:Qiang Yu  Liu Zongtian Lin Wei Shi Baisheng Li Yun
Affiliation:Qiang Yu 1,2 Liu Zongtian 1 Lin Wei 1 Shi Baisheng 1 Li Yun 11
Abstract: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.
Keywords:fuzzy attribute concept  lattice  fuzzy language variable  knowledge discovery  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号