Abstract
Reverse engineering of gene regulatory networks is a key issue for functional genomic. Indeed, unraveling complex interactions among genes is a crucial step in order to understand their role in cellular processes. High-throughput technologies such as DNA microarrays or ChIP on chip have in principle opened the door to network inference from data. However the size of available data is still limited compared to their dimension. Machine learning methods have thus to be worked out in order to respond to this challenge. In this work we focused our attention on modeling gene regulatory networks with Bayesian networks. Bayesian networks offer a probabilistic framework for the reconstruction of biological interactions networks using data, but the structure learning problem is still a bottleneck. In this paper, we use evolutionary algorithms to stochastically evolve a set of candidate Bayesian networks structures and find the model that best explains the small number of available observational data. We propose different kinds of recombination strategies and an appropriate technique of niching that ensure diversity among candidate solutions. Tests are carried out on simulated data drawn from a biorealistic network. The effect of deterministic crowding, a niching method, is compared to mutation for different kinds of recombination strategies and is shown to improve significantly the performances. Enhanced by deterministic crowding, our evolutionary approach outperforms K2, Greedy-search and MCMC, for training sets whose size is small compared to the standard in machine learning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1988)
Jensen, F.V.: Bayesian Networks and Decision Graphs. Springer-Verlag New York, Inc., Secaucus, NJ, USA (2001)
Chickering, D.M., D.G., Heckermann, D.: Learning bayesian networks is np-complete. In: Fisher, D., Lenz, H.J. (eds.) Learning from data: AI and Statistics, New York NY, vol. 5, pp. 121–130. Springer-Verlag, Heidelberg (1996)
Friedman, K.: Being bayesian about network structure: A bayesian approach to structure discovery in bayesian networks. Machine Learning 50, 95–126 (2003)
Le, P.P., Bahl, A., Ungar, L.H.: Using prior knowledge to improve genetic network reconstruction from microarray data. Silico Biology 4(2) (2004)
Wong, M.L., Lam, W., Leung, K.S.: Using evolutionary programming and minimum description length principle for data mining of bayesian networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 21(2), 174–178 (1999)
Schwarz, G.: Estimating the dimension of a model. The Annals of Statistics 6(2), 461–464 (1978)
Hsu, W.H., Guo, H., Perry, B.B., Stilson, J.A.: A permutation genetic algorithm for variable ordering in learning bayesian networks from data. In: GECCO 2002. Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, CA, USA, pp. 383–390. Morgan Kaufmann Publishers Inc, Seattle, Washington, USA (2002)
Larranaga, P., Kuijpers, C., Murga, R., Yurramendi, Y.: Learning bayesian network structures by searching for the best ordering with genetic algorithms (1996)
Cooper, G.F., Herskovits, E.: A bayesian method for the induction of probabilistic networks from data. Mach. Learn. 9(4), 309–347 (1992)
Larranaga, P., Poza, M., Yurramendi, Y., Murga, R.H., Kuijpers, C.M.H.: Structure learning of bayesian networks by genetic algorithms: A performance analysis of control parameters. IEEE Trans. Pattern Anal. Mach. Intell. 18(9), 912–926 (1996)
Etxeberria, R., Larranaga, P., Picaza, J.M.: Analysis of the behaviour of genetic algorithms when learning bayesian network structure from data. Pattern Recogn. Lett. 18(11-13), 1269–1273 (1997)
Myers, J.W., Laskey, K.B., DeJong, K.A.: Learning bayesian networks from incomplete data using evolutionary algorithms 1 (13-17) 458–465 (1999)
Cotta, C., Muruzabal, J.: Towards a more efficient evolutionary induction of bayesian networks. In: PPSN VII. Proceedings of the 7th International Conference on Parallel Problem Solving from Nature, pp. 730–739. Springer-Verlag, London, UK (2002)
Mahfoud, S.W.: Niching methods for genetic algorithms. PhD thesis, Champaign, IL, USA (1995)
Verma, T., Pearl, J.: Equivalence and Synthesis of Causal Models. Elsevier Science, New York (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Auliac, C., d’Alché–Buc, F., Frouin, V. (2007). Learning Transcriptional Regulatory Networks with Evolutionary Algorithms Enhanced with Niching. In: Masulli, F., Mitra, S., Pasi, G. (eds) Applications of Fuzzy Sets Theory. WILF 2007. Lecture Notes in Computer Science(), vol 4578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73400-0_78
Download citation
DOI: https://doi.org/10.1007/978-3-540-73400-0_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73399-7
Online ISBN: 978-3-540-73400-0
eBook Packages: Computer ScienceComputer Science (R0)