摘要
将粒计算引入到形式背景分析中,并在确定算子与可能算子两种运算的基础上提出了确定-可能粒背景N-PGC(Necessi-ty-possibility granular context)算法。通过将属性、对象的相容粒经过确定算子与可能算子的运算得到的结果作为新背景的属性、对象,并分析了新背景与原始形式背景的概念格关系。
In this paper we introduce granular computing into formal context analysis,and based on two operations with necessity operators and possibility operators we put forward the necessity-possibility granular context algorithm.The result derived from computing the compatibility granular of attribute and object with necessity operator and possibility operator is used as the attribute and object of the new context,the relationship of concept lattice between the new context and the originality context is analyzed as well.
出处
《计算机应用与软件》
CSCD
2010年第7期11-13,39,共4页
Computer Applications and Software
基金
国家自然科学基金(60775036)
关键词
确定-可能粒背景
相容粒
概念格
Necessity-possibility granular context Compatibility granular Concept lattice
