全覆盖粒计算模型的公理化及其知识约简  

Axiomatization and knowledge reduction of full covering Gr C model

作　　者：秦琴[1] 谢珺[1] 史培林[2] 续欣莹[1] 

机构地区：[1]太原理工大学信息工程学院,太原030024 [2]太原理工大学数学学院,太原030024

出　　处：《计算机应用研究》2016年第8期2339-2344,共6页Application Research of Computers

基　　金：山西省留学回国人员科技活动择优资助项目(2013年度);山西省回国留学人员科研资助项目(2013-033);山西省自然科学基金资助项目(2014011018-2)

摘　　要：部分覆盖是粒计算理论框架下的第二种粒计算模型,全覆盖粒计算是部分覆盖的一种特例。为实现全覆盖粒计算模型中粒的计算,探究了全覆盖粒计算模型中所提逼近算子的公理化系统,提出了粒的中心、全覆盖粒度熵及全覆盖粒族熵的概念,探讨了基本粒和全覆盖粒重要性度量的方法,并提出了相应的约简与核的判定定理。基于所提定义、定理设计了全覆盖粒的约简算法和全覆盖粒族的约简算法,并从理论上分析了两种算法的复杂度。最后以客户根据专家意见购房为例,验证了所提算法的有效性。Full covering is a special case of the partial covering which is the second GrC model under the framework of the GrC theory. In order to realize the computing of granule in full covering GrC model, firstly, this paper explored the axiomatic systems for the interior and closure operators of the full covering GrC model, and defined the center of the granule which was used to define the granularily entropy of a full covering and a family of full coverings. Secondly, it presented the significance measurement of basic granule and full covering granule based on the granularity entropy, and also discussed the theorems for the reduction of the information system which was modeled as a full covering and a family of full coverings; then designed and analyzed the according knowledge reduction algorithms based on the full covering GrC model and their complexity, namely, the reduction of granules in the full covering （ RGFC ） and the reduction of a covering in a family of full coverings （RCFFC）. Fi- nally, the example of experts assessing house for customers show that the proposed algorithms are effective.

关 键 词：粒计算 全覆盖 粒(族)的中心 粒度熵 知识约简 

分 类 号：TP301.5[自动化与计算机技术—计算机系统结构]