内P-推理信息恢复与属性潜藏推理发现

Internal P-reasoning Information Recovery and Attribute Hiding Reasoning Discovery

P-集合(packet sets)是把动态特性引入到有限普通集合X内,改进有限普通集合X得到的一个动态模型;在一定的条件下,P-集合被还原成有限普通集合X。P-集合由内P-集合XF珚(internal packet set XF珚)与外P-集合XF(outerpacket set XF)构成的集合对;或者,(XF珚,XF)是P-集合。P-推理(packet reasoning)由内P-推理(internal packet rea-soning)与外P-推理(outer packet reasoning)共同构成。利用内P-集合与内P-推理,给出了内P-信息恢复概念与内P-信息恢复特征、内P-信息恢复的内P-推理生成与它的属性潜藏、内P-信息恢复的信息元补充定理、内P-信息恢复的依赖性定理,以及内P-推理信息恢复的属性潜藏定理与属性潜藏发现定理。利用这些理论结果,给出内P-推理信息恢复在信息系统中的应用。

P-sets（packet sets） are a dynamic model obtained by embedding the dynamic characteristics into the finite Cantor set X and improving it. P-sets are a set-pair composed of internal P-set X^F （internal packet set X^F） and outer P- set X^F （outer packet set Xe ）, or （X^F, X^F ） is P-sets. P-reasoning is composed of internal P-reasoning（internal packet reasoning） and outer P-reasoning（outer packet reasoning）. Using internal P-sets and internal P-reasoning, the paper gave the concept and characteristics of internal P-information recovery, internal P-reasoning generation and attribute hiding of internal P-information recovery, information elements supplemented theorem and dependence theorem of inter- nal P-information recovery, attribute hiding theorem and attribute hiding discovery theorem of internal P-reasoning in- formation. Based on the results, the application of internal P-reasoning information recovery in the information system was given.