Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (17): 179-181.

• 数据库与信息处理 • Previous Articles     Next Articles

Research on implementation algorithm of fuzzy concept lattices based on different implication operator

LIU Rui-xin1,SUN Shi-bao2,3,QIN Ke-yun2   

  1. 1.Department of Information Engineering,Yellow River Conservancy Technical Institute,Kaifeng,Henan 475000,China
    2.Intelligent Control Development Center,Southwest Jiaotong University,Chengdu 610031,China
    3.Electronic Information Engineering College,Henan University of Science and Technology,Luoyang,Henan 471003,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-11 Published:2007-06-11
  • Contact: LIU Rui-xin

基于不同蕴涵算子的模糊概念格建格算法研究

刘瑞新1,孙士保2,3,秦克云2   

  1. 1.黄河水利职业技术学院 信息工程系,河南 开封 475000
    2.西南交通大学 智能控制开发中心,成都 610031
    3.河南科技大学 电子信息工程学院,河南 洛阳 471003
  • 通讯作者: 刘瑞新

Abstract: The concept lattice is an efficient tool for analyzing dada and the fuzzy set is an efficient approach of data processing,so fuzzy concept lattice has important theoretical and practical application value.But the structure and properties of fuzzy concept lattice depend on the choice of implication operator,thus residuated implication operator which is generated by lower semi-continuous triangular norm and the operator and definitions of fuzzy concept lattice are discussed.The constructing algorithm of fuzzy concept lattices based on different residuated implication operator is proposed.The performances of this algorithm like complexity are analyzed.Finally,constructing methods of fuzzy concept lattices based on Godel implication and Lukasiewicz implication are illustrated through examples.

摘要: 概念格是进行数据分析的有力工具,模糊集是数据处理的有效方法之一,模糊概念格有重要的理论与应用价值,但它的结构与性质依赖于蕴涵算子的选择,基于此,介绍了基于下半连续三角模生成的剩余蕴涵以及模糊概念格的算子和定义,提出了基于不同蕴涵算子的模糊概念格的实现算法,分析了算法的复杂度等性能,最后通过实例说明了基于Godel 蕴涵和Lukasiewicz 蕴涵的模糊概念格的建格方法。