一种从不完备关系数据中学习PRM的方法  

An Approach to Learning PRM from Incomplete Relational Data

作　　者：李小琳[1] 周志华[1] 

机构地区：[1]南京大学计算机软件新技术国家重点实验室,江苏南京210093

出　　处：《软件学报》2008年第1期73-81,共9页Journal of Software

基　　金：Supported by the National Natural Science Foundation of China under Grant Nos.60635030; 60473046 (国家自然科学基金);the China Postdoctoral Science Foundation under Grant No.20060390921 (中国博士后科学基金);the Jiangsu Planned Projects for Postdoctoral Research Funds of China under Grant No.0601017B (江苏省博士后科研资助计划)

摘　　要：现有的关系学习研究都是基于完备数据进行的,而现实问题中,数据通常是不完备的.提出一种从不完备关系数据中学习概率关系模型(probabilistic relational models,简称PRMs)的方法——MLTEC(maximum likelihood tree and evolutionary computing method).首先,随机填充不完备关系数据得到完备关系数据.然后从每个随机填充后的数据样本中分别生成最大似然树并作为初始PRM网络,再利用进化过程中最好的网络结构反复修正不完备数据集,最后得到概率关系模型.实验结果显示,MLTEC方法能够从不完备关系数据中学习到较好的概率关系模型.Existing relational learning approaches usually work on complete relational data. However, in real-world applications, data are often incomplete. This paper proposes the MLTEC （maximum likelihood tree and evolutionary computing method） method to learn structures of the probabilistic relational models （PRMs） from incomplete relational data. The incomplete relational data are filled randomly at first, and a maximum likelihood tree （MLT） is generated from each completed data sample. This population of MLTs is then evolved through an evolutionary computing process, and the incomplete data are modified by using the best evolved structure in each generation. As a result, the probabilistic structure is learned. Experimental results show that the MLTEC method can learn good structures from incomplete relational data.

关 键 词：机器学习 关系学矾不完备数据 概率关系模型 最大似然树 进化计算 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]