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...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.展开更多
基金Supported by the National Natural Science Foundation of China (Nos. 10871038, 10926186, 11025102, 11071026 and 11101052)the Jilin Project (No. 20100401)
文摘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.
