Research on parallel algorithms for large scale Bayesian network structure search
Project/Area Number |
15K20965
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Computational science
Intelligent informatics
|
Research Institution | The University of Tokyo |
Principal Investigator |
|
Project Period (FY) |
2015-04-01 – 2017-03-31
|
Project Status |
Completed (Fiscal Year 2016)
|
Budget Amount *help |
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2016: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2015: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | ベイジアンネットワーク / グラフ探索アルゴリズム / 並列アルゴリズム / 最適DAG探索アルゴリズム / 大規模並列計算 |
Outline of Final Research Achievements |
We have successfully developed the novel parallel algorithm for searching for the optimal DAG structure using the supercomputer with 2D torus interconnect network. Using this algorithm we have succeeded in searching for the optimal DAG structure of the 36 variables and 200 samples using FX10 4800 computation nodes. This is the first example of searching for the optimal DAG structure with 36 variables in the literature. We have then improved this algorithm and succeeded in the optimal 37 variable DAG search using K computer 20768 computation nodes. Currently we are preparing the submission of the paper of this result.
|
Report
(3 results)
Research Products
(8 results)
-
-
-
-
[Journal Article] Elevated β-catenin pathway as a novel target for patients with resistance to EGF receptor targeting drugs2015
Author(s)
A. Nakata, R. Yoshida, R. Yamaguchi, M. Yamauchi, Y. Tamada, A. Fujita, T. Shimamura, S. Imoto, T. Higuchi, M. Nomura, T. Kimura, H. Nokihara, M. Higashiyama, K. Kondoh, H. Nishihara, A. Tojo, S. Yano, S. Miyano & N. Gotoh
-
Journal Title
Scientific Reports
Volume: 5
Pages: 13076
DOI
Related Report
Peer Reviewed / Open Access
-
-
-
-