Bayesian learning of structures of ordered block graphical models with an application on multistage manufacturing processes

被引:6
作者
Wang, Chao [1 ]
Zhu, Xiaojin [2 ]
Zhou, Shiyu [3 ]
Zhou, Yingqing [4 ]
机构
[1] Univ Iowa, Dept Ind & Syst Engn, Iowa City, IA 52242 USA
[2] Univ Wisconsin, Dept Comp Sci, 1210 W Dayton St, Madison, WI 53706 USA
[3] Univ Wisconsin, Dept Ind & Syst Engn, Madison, WI 53706 USA
[4] Dimens Control Syst Inc, Troy, MI USA
基金
美国国家科学基金会;
关键词
Graphical models; structure learning; ordered block model; Bayesian score; multistage manufacturing process; NETWORKS; KNOWLEDGE; INFERENCE; SELECTION;
D O I
10.1080/24725854.2020.1786196
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The Ordered Block Model (OBM) is a special form of directed graphical models and is widely used in various fields. In this article, we focus on learning of structures of OBM based on prior knowledge obtained from historical data. The proposed learning method is applied to a multistage car body assembly process to validate the learning efficiency. In this approach, Bayesian score is used to learn the graph structure and a novel informative structure prior distribution is constructed to help the learning process. Specifically, the graphical structure is represented by a categorical random variable and its distribution is treated as the informative prior. In this way, the informative prior distribution construction is equivalent to the parameter estimation of the graph random variable distribution using historical data. Since the historical OBMs may not contain the same nodes as those in the new OBM, the sample space of the graphical structure of the historical OBMs and the new OBM may be inconsistent. We deal with this issue by adding pseudo nodes with probability normalization, then removing extra nodes through marginalization to align the sample space between historical OBMs and the new OBM. The performance of the proposed method is illustrated and compared to conventional methods through numerical studies and a real car assembly process. The results show the proposed informative structure prior can effectively boost the performance of the graph structure learning procedure, especially when the data from the new OBM is small.
引用
收藏
页码:770 / 786
页数:17
相关论文
共 38 条
[1]  
[Anonymous], 2000, P 16 C UNC ART INT
[2]  
[Anonymous], 2012, C UNCERTAINTY ARTIFI
[3]   The intrinsic Bayes factor for model selection and prediction [J].
Berger, JO ;
Pericchi, LR .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1996, 91 (433) :109-122
[4]  
Bernard A., 2004, P BIOC 2005
[5]   A Constrained l1 Minimization Approach to Sparse Precision Matrix Estimation [J].
Cai, Tony ;
Liu, Weidong ;
Luo, Xi .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2011, 106 (494) :594-607
[6]  
de Campos CP, 2011, J MACH LEARN RES, V12, P663
[7]   Independency relationships and learning algorithms for singly connected networks [J].
De Campos, LM .
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 1998, 10 (04) :511-549
[8]   A new approach for learning belief networks using independence criteria [J].
de Campos, LM ;
Huete, JF .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2000, 24 (01) :11-37
[9]  
Friedman N, 1999, UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, P196
[10]  
Geiger D., 1994, P 10 INT C UNCERTAIN, P235