0


关系结构的生成模型

Generative Models for Relational Structures
课程网址: http://videolectures.net/ssspr2010_hancock_gmr/  
主讲教师: Edwin Hancock
开课单位: 纽约大学
开课时间: 2010-09-13
课程语种: 英语
中文简介:
我们提出了一种通过采用最小描述长度方法来构建图集的生成模型的方法。该方法是在学习生成超图模型方面提出的,通过Gibbs采样可以从中获得新样本。我们首先构建超图上节点和边缘出现的概率分布。我们使用von-Neumann熵编码超图的复杂性。开发EM算法的变体以最小化描述长度标准,其中样本图和超图之间的节点对应被视为缺失数据。最大化步骤涉及使用分级分配来更新节点对应信息和超图的结构。对实际数据的实证评估揭示了我们提出的算法的实际效用,并表明我们的生成模型给出了良好的图分类结果。
课程简介: We present a method for constructing a generative model for sets of graphs by adopting a minimum description length approach. The method is posed in terms of learning a generative supergraph model from which the new samples can be obtained by Gibbs sampling. We commence by constructing a probability distribution for the occurrence of nodes and edges over the supergraph. We encode the complexity of the supergraph using the von-Neumann entropy. A variant of EM algorithm is developed to minimize the description length criterion in which the node correspondences between the sample graphs and the supergraph are treated as missing data.The maximization step involves updating both the node correspondence information and the structure of supergraph using graduated assignment. Empirical evaluations on real data reveal the practical utility of our proposed algorithm and show that our generative model gives good graph classification results.
关 键 词: 关系; 结构; 生成模型
课程来源: 视频讲座网
最后编审: 2020-06-27:zyk
阅读次数: 35