Efficient Parallel Algorithm for Optimal DAG Structure Search on Parallel Computer with Torus Network

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10048)

Abstract

The optimal directed acyclic graph search problem constitutes searching for a DAG with a minimum score, where the score of a DAG is defined on its structure. This problem is known to be NP-hard, and the state-of-the-art algorithm requires exponential time and space. It is thus not feasible to solve large instances using a single processor. Some parallel algorithms have therefore been developed to solve larger instances. A recently proposed parallel algorithm can solve an instance of 33 vertices, and this is the largest solved size reported thus far. In the study presented in this paper, we developed a novel parallel algorithm designed specifically to operate on a parallel computer with a torus network. Our algorithm crucially exploits the torus network structure, thereby obtaining good scalability. Through computational experiments, we confirmed that a run of our proposed method using up to 20,736 cores showed a parallelization efficiency of 0.94 as compared to a 1296-core run. Finally, we successfully computed an optimal DAG structure for an instance of 36 vertices, which is the largest solved size reported in the literature.

Keywords

Optimal DAG structure Optimal bayesian network structure Parallel algorithm Distributed algorithm Torus network 

References

  1. 1.
    Fujitsu. http://www.fujitsu.com/global/. Accessed 01 11 2015
  2. 2.
    Information Technology Center, the University of Tokyo. http://www.cc.u-tokyo.ac.jp/. Accessed 01 11 2015
  3. 3.
    Chaiken, R., Jenkins, B., Larson, P.A., Ramsey, B., Shakib, D., Weaver, S., Zhou, J.: SCOPE: easy and efficient parallel processing of massive data sets. Proc. VLDB Endow. 1(2), 1265–1276 (2008)CrossRefGoogle Scholar
  4. 4.
    Cheng, J., Bell, D.A., Liu, W.: Learning belief networks from data: an information theory based approach. In: Proceedings of the Sixth International Conference on Information and Knowledge Management CIKM 1997, NY, USA, pp. 325–331. ACM, New York (1997)Google Scholar
  5. 5.
    Chickering, D.M., Geiger, D., Heckerman, D.: Learning Bayesian networks is NP-Hard. Technical report, Citeseer (1994)Google Scholar
  6. 6.
    Friedman, N., Goldszmidt, M.: Learning Bayesian networks with local structure. In: Jordan, M.I. (ed.) Learning in Graphical Models, vol. 89, pp. 421–459. Springer, Netherlands (1998)CrossRefGoogle Scholar
  7. 7.
    Friedman, N., Linial, M., Nachman, I., Pe’er, D.: Using Bayesian networks to analyze expression data. J. Comput. Biol. 7(3–4), 601–620 (2000)CrossRefGoogle Scholar
  8. 8.
    Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Mach. Learn. 20(3), 197–243 (1995)MATHGoogle Scholar
  9. 9.
    Imoto, S., Goto, T., Miyano, S.: Estimation of genetic networks and functional structures between genes by using Bayesian networks and nonparametric regression. In: Pacific symposium on Biocomputing, vol. 7, pp. 175–186. World Scientific (2002)Google Scholar
  10. 10.
    Italiano, G.F.: Finding paths and deleting edges in directed acyclic graphs. Inf. Process. Lett. 28(1), 5–11 (1988)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Kramer, R., Gupta, R., Soffa, M.L.: The combining DAG: a technique for parallel data flow analysis. IEEE Trans. Parallel Distrib. Syst. 5(8), 805–813 (1994)CrossRefGoogle Scholar
  12. 12.
    Lecca, P.: Methods of biological network inference for reverse engineering cancer chemoresistance mechanisms. Drug Discov. Today 19(2), 151–163 (2014). http://www.sciencedirect.com/science/article/pii/S1359644613003930, system BiologyMathSciNetCrossRefGoogle Scholar
  13. 13.
    Nikolova, O., Zola, J., Aluru, S.: Parallel globally optimal structure learning of Bayesian networks. J. Parallel Distrib. Comput. 73(8), 1039–1048 (2013)CrossRefMATHGoogle Scholar
  14. 14.
    Ott, S., Imoto, S., Miyano, S.: Finding optimal models for small gene networks. In: Pacific Symposium on Biocomputing. vol. 9, pp. 557–567. World Scientific (2004)Google Scholar
  15. 15.
    Tamada, Y., Imoto, S., Miyano, S.: Parallel algorithm for learning optimal Bayesian network structure. J. Mach. Learn. Res. 12, 2437–2459 (2011)MathSciNetMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Graduate School of Information Science and TechnologyThe University of TokyoTokyoJapan

Personalised recommendations