青岛大学学报（自然科学版）2018，Vol.31Issue(2)：9-13,5.DOI:10.3969/j.issn.1006-1037.2018.05.02
基于链图的最小独立图算法研究
Research on Minimal Independent-map of Chain Graph
摘要
Abstract
In order to study the conditional independence structure,introducing the concept of chain graph and studying optimization of chain graph model.Given a chain graph and a target ordering on its variables,we efficiently derive its minimal I-map whose edges are consistent with the target ordering.This paper reviews the expression of probabilistic graph model,gives the definition of conditional independence on chain graph,and then an algorithm for finding the minimum I-map is obtained,and introduces the application of the algorithm in detail.Finally,the complexity of the algorithm and the prospect of the research are discussed.关键词
链图/条件独立性/最小I-mapKey words
chain graph/conditional independence/minimal I-map分类
数理科学引用本文复制引用
逄潇,许成,韩仃仃..基于链图的最小独立图算法研究[J].青岛大学学报（自然科学版）,2018,31(2):9-13,5.基金项目
山东省自然科学基金项目(批准号:ZR2016AM29)资助. （批准号:ZR2016AM29）
