A New Algorithm for Decomposition of Graphical Models
查看参考文献31篇
|
文摘
|
In this paper, we combine Leimer’s algorithm with MCS-M algorithm to decompose graphical models into marginal models on prime blocks. It is shown by experiments that our method has an easier and faster implementation than Leimer’s algorithm. |
|
来源
|
Acta Mathematicae Applicatae Sinica-English Series
,2012,28(3):571-582 【核心库】
|
|
DOI
|
10.1007/s10255-012-0170-6
|
|
关键词
|
decomposition
;
graphical models
;
MCS-M algorithm
;
Leimer’s algorithm
;
prime blocks
|
|
地址
|
School of Mathematics and Statistics, Northeast Normal University, Changchun, 130024
|
|
语种
|
英文 |
|
ISSN
|
0168-9673 |
|
学科
|
数学;自动化技术、计算机技术 |
|
基金
|
国家自然科学基金
;
the Jilin Project
|
|
文献收藏号
|
CSCD:4622834
|
参考文献 共
31
共2页
|
|
1.
Berry A. Maximum cardinality search for computing minimal triangulations of graph.
Algorithmica,2004,39:287-298
|
CSCD被引
6
次
|
|
|
|
|
2.
Blair J R S. An introduction to chordal graphs and clique trees.
Graph Theory and Sparse Matrix Computation, IMA Volumes in Mathematics and its Applications, 56,1993:1-30
|
CSCD被引
3
次
|
|
|
|
|
3.
Dempster A P. Covariance selection.
Biometrics,1972,28:157-175
|
CSCD被引
15
次
|
|
|
|
|
4.
Darroch J N. Markov-fields and log-linear models for contingency tables.
Annals of Statistics,1980,8:522-539
|
CSCD被引
1
次
|
|
|
|
|
5.
Flores M J. Triangulation of Bayesian networks by retriangulation.
International Journal of Intelligent Systems,2003,18(2):153-164
|
CSCD被引
2
次
|
|
|
|
|
6.
Friedman N. Inferring cellular networks using probabilistic graphical models.
Science,2004,303:799-805
|
CSCD被引
37
次
|
|
|
|
|
7.
Geng Z. Algorithm AS244: Decomposability and collapsibility for log-linear models.
Applied Statistics,1989,38:189-197
|
CSCD被引
1
次
|
|
|
|
|
8.
Geng Z. Decomposition of search for v-structures in DAGs.
Journal of Multivariate Analysis,2005,96:282-294
|
CSCD被引
5
次
|
|
|
|
|
9.
Jirousek R. On the effective implementation of the iterative proportional fitting procedure.
Computational Statistics & Data Analysis,1995,19:177-189
|
CSCD被引
2
次
|
|
|
|
|
10.
Lauritzen S L.
Graphical Models,1996
|
CSCD被引
45
次
|
|
|
|
|
11.
Lauritzen S L.
Lectures on Contingency Tables,2002
|
CSCD被引
1
次
|
|
|
|
|
12.
Lauritzen S L. Local computations with probabilities on graphical structures and their application to expert systems (with discussion).
Journal of the Royal Statistical Society, Series B,1998,50:157-224
|
CSCD被引
1
次
|
|
|
|
|
13.
Lauritzen S L. Graphical models for associations between variables, some of which are qualitative and some quantitative.
Annals of Statistics,1989,17:31-57
|
CSCD被引
7
次
|
|
|
|
|
14.
Leimer H G. Optimal decomposition by cliques separators.
Discrete Mathematics,1993,113:99-123
|
CSCD被引
4
次
|
|
|
|
|
15.
Liu B H. A note on minimal d-separation trees for structural learning.
Artificial Intelligence,2010,174:442-448
|
CSCD被引
7
次
|
|
|
|
|
16.
Ma S. An Arabidopsis gene network based on the graphical Gaussian model.
Genome Research,2007,17:1614-1625
|
CSCD被引
10
次
|
|
|
|
|
17.
Malvestuto F M. A hypergraph-theoretic analysis of collapsibility and decomposability for extended loglinear models.
Statistics and Computing,2001,11(2):155-169
|
CSCD被引
1
次
|
|
|
|
|
18.
Olesen K. Maximal prime subgraph decomposition of Bayesian networks.
IEEE Transactions on Systems, Man and Cybernetics, B,2002,32:21-31
|
CSCD被引
9
次
|
|
|
|
|
19.
Pearl J.
Causality: Models, Reasoning, and Inference,2000
|
CSCD被引
25
次
|
|
|
|
|
20.
Rose D J. Algorithmic aspects of vertex elimination on graphs.
SIAM Journal on Computing,1976,5:266-283
|
CSCD被引
12
次
|
|
|
|
|
了解气象卫星更多信息，请访问