摘要
该文利用粒网络的概念讨论了信息粒化和划分(覆盖)解粒的关系。主要结论是:在粒网络中最小粒的集合形成论域的一个覆盖;分类的一致性问题也可以作为寻求由属性值集所定义的一个划分或覆盖的模型。
In this paper,the relation of information granulation and partition(covering)solution granular are discussed by the concept of granule network.The main results:the set of smallest granules in the granule network forms a covering of universe,and a consistent problem can be modeled as a search for a partition or a covering defined by a set of at-tribute values.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第2期72-74,共3页
Computer Engineering and Applications
关键词
信息粒
划分(覆盖)解粒
粒网络
information granulation,partition(covering)solution granular,granule network
