Abstract
Bayesian networks are widely used for modelling gene networks. We investigate the problem of expanding a given Bayesian network by adding a hidden node – a node on which no experimental data are given. Finding a good expansion (a new hidden node and its neighborhood) can point to regions where the model is not rich enough, and help locate new, unknown variables that are important for understanding the network. We study the computational complexity of this expansion, show it is hard, and describe an EM based heuristic algorithm for solving it. The algorithm was applied to synthetic datasets and to yeast gene expression datasets, and produces good, encouraging results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chickering, D.M.: Learning bayesian network is NP-complete. In: Fisher, D., Le, H.J. (eds.) Learning from data: AI and statistic V, pp. 121–130. Springer, New York (1996)
Friedman, N.: Inferring cellular networks using probabilistic graphical models. Science, 799–805 (2004)
Friedman, N., Linial, M., Nachman, I., Pe’er, D.: Using bayesian network to analyze expression data. Journal of Computational Biology (7), 601–620 (2000)
Friedman, N., Yakhini, Z.: On the sample complexity of learning bayesian networks. In: Proc. 12th Conf. on Uncertainty in Artificial Intelligence, Portland, OR, pp. 274–282 (1996)
Höffgen, K.L.: Learning and robust learning of product distributions. In: COLT, pp. 77 – 83 (1993)
Hugehes, T.R., Marton, M.J.: Functional discovery via a compendium of expression profiles. Cell 102(1), 109–126 (2000)
Kwoh, C.K., Gillies, D.F.: Using hidden nodes in byesian networks. Artificial Intelligence 88, 1–38 (1996)
Pe’er, D., Regev, A., Elidan, G., Friedman, N.: Inferring subnetworks from perturbed expression profiles. Bioinformatics 1(1), 1–9 (2001)
Rissanen, J.: Modeling by shortest data description. Automatica 14, 465–471 (1978)
Segal, E., Shapira, M., Pe’er, D., Botstein, D., Koller, D., Friedman, N.: Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data. Nature Genetics 34, 166–176 (2003)
Tanay, A., Shamir, R.: Computational expansion of genetic networks. In: ISMB, pp. 1–9 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chor, B., Tuller, T. (2004). Adding Hidden Nodes to Gene Networks. In: Jonassen, I., Kim, J. (eds) Algorithms in Bioinformatics. WABI 2004. Lecture Notes in Computer Science(), vol 3240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30219-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30219-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23018-2
Online ISBN: 978-3-540-30219-3
eBook Packages: Springer Book Archive