首页> 外文会议>Conceptual structures: From information to intelligence >Granular Reduction of Property-Oriented Concept Lattices
【24h】

Granular Reduction of Property-Oriented Concept Lattices

机译:面向属性的概念格的粒度约简

获取原文
获取原文并翻译 | 示例

摘要

Konwledge reduction on concept lattices is an important research topic in formal concept analysis, and there are some different meanings and methods. This paper mainly studies the granular reduction of property-oriented concept lattices which can preserve the property-oriented concepts, which is called granules in this paper. Firstly, the granules of a property-oriented concept lattice is presented, and it is proven that each extension of property-oriented concepts can be constructed by the granules. Then, the granular reduction of a property-oriented concept lattice is proposed, and the granular discernibility attribute matrix and the granular discernibility attribute function are respectively employed to determine granular consistent sets and calculate granular reducts. Finally, the relation between a granular consistent set and a lattice consistent set of a property-oriented concept lattice is discussed.
机译:概念格上的Konwledge约简是形式概念分析中的重要研究课题,其含义和方法不同。本文主要研究可以保留属性导向概念的属性导向概念格的粒度约简,即颗粒。首先,提出了面向属性概念格的颗粒,并证明了可以用颗粒构造面向属性概念的每个扩展。然后,提出了面向属性的概念格的粒度约简,并分别采用粒度可辨属性矩阵和粒度可辨属性函数确定粒度一致性集并计算粒度约简。最后,讨论了面向属性的概念格的粒度一致性集和网格一致性集之间的关系。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号