信息的P-依赖与信息P-依赖挖掘-筛选  

Information P-dependence and P-dependence Mining-sieving

作　　者：刘纪芹 张海月 LIU Ji-qin;ZHANG Hai-yue(School of Mathematics and Quantitative Economics,Shandong University of Finance and Economics,Jinan 250014,China)

机构地区：[1]山东财经大学数学与数量经济学院,济南250014

出　　处：《计算机科学》2018年第7期202-206,213,共6页Computer Science

基　　金：山东省自然科学基金资助项目(zr2013aq019)资助

摘　　要：P-集合(packet sets)是一个新的动态模型,它是由内P-集合X^F(internal packet set X^F)与外P-集合X^F(outer packet set X^F)构成的集合对,即(X^F,X^F)是P-集合。P-集合把动态特性引入到有限普通集合X(cantor set X)内,改进了有限普通集合X。文中通过利用P-集合与它的动态特性,给出信息P-依赖(packet dependence)与P-依赖结构,给出信息P-依赖的属性特征,进而给出信息P-依赖挖掘与挖掘定理,以及P-依赖挖掘准则与信息P-依赖挖掘-筛选原理;最后根据这些研究结果给出应用。P-sets（packet sets）is a new dynamic model.It is a set pair composed of the internal P-set X^F（internal packet set X^F）and the outer P-set X^F（outer packet set X^F）,or（X^F,X^F）is a P-sets.P-sets was proposed by introducing dynamic characte-ristics into a finite general set X（cantor set X）and improving X.Using P-sets and its dynamic characteristics,the paper gave the concept of information P-dependence（packet dependence）and its structure,and gave attribute characteristics of information P-dependence.It further presented the concept of information P-dependence mining,mining theorems,information P-dependence mining criterion and P-dependence mining-sieving principle.Using these results,the paper gave an application of information P-dependence mining-sieving.

关 键 词：P-集合 信息P-依赖 P-依赖挖掘定理 挖掘准则 挖掘-筛选原理 应用 

分 类 号：O144[理学—数学]