Abstract
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity mean that we are provided with a small data set and a high number of unknown components of the system, most of which are zero. Under these circumstances, a model needs to be learned that fits the underlying system, capable of generalization. This corresponds to the student-teacher setting in machine learning. In the first part of this paper we introduce a learning algorithm, based on L 1-minimization, to identify interaction networks from poor data and analyze its dynamics with respect to phase transitions. The efficiency of the algorithm is measured by the generalization error, which represents the probability that the student is a good fit to the teacher. In the second part of this paper we show that from a system with a specific system size value the generalization error of other system sizes can be estimated. A comparison with a set of simulation experiments show a very good fit.
Chapter PDF
Similar content being viewed by others
References
de Jong, H.: Modeling and simulation of genetic regulatory systems: A literature review. Comp. Biol. 9, 67–103 (2002)
Jong, H.d., et al.: Qualitative simulation of genetic regulatory networks using piecewise-linear models. Bulletin of Mathematical Biology 66(2), 301–340 (2004)
Fuchs, J.: More on sparse representations in arbitrary bases. In: Proc. 13th IFAC Symp. on System Identification, pp. 1357–1362 (2003)
Fuchs, J.: On sparse representations in arbitrary redundant bases. IEEE Trans. Infor. Theory 50(6), 1341–1344 (2004)
Glass, L., Kauffman, S.: The logical analysis of continuous non-linear biochemical control networks. J. Theor. Biol. 39(1), 103–129 (1973)
Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)
Novak, B., Tyson, J.: Modeling the control of dna replication in fission yeast. PNAS 94, 9147–9152 (1997)
Peeters, R.L.M., Westra, R.L.: On the identification of sparse gene regulatory networks. In: Proc. of the 16th Intern. Symp. on Math. Theory of Networks and Systems (2004)
Westra, R.L.: Piecewise linear dynamic modeling and identification of gene-protein interaction networks. In: Nisis/JCB Workshop Reverse Engineering (2005)
Westra, R.L., Hollanders, G., Bex, G., Gyssens, M., Tuyls, K.: The identification of dynamic gene-protein networks. In: Tuyls, K., Westra, R., Saeys, Y., Nowé, A. (eds.) KDECB 2006. LNCS (LNBI), vol. 4366, pp. 157–170. Springer, Heidelberg (2007)
Yeung, M.K.S., Tegnér, J., Collins, J.: Reverse engineering gene networks using singular value decomposition and robust regression. PNAS 99(9), 6163–6168 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hollanders, G., Bex, G.J., Gyssens, M., Westra, R.L., Tuyls, K. (2007). On Phase Transitions in Learning Sparse Networks. In: Kok, J.N., Koronacki, J., Mantaras, R.L.d., Matwin, S., Mladenič, D., Skowron, A. (eds) Machine Learning: ECML 2007. ECML 2007. Lecture Notes in Computer Science(), vol 4701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74958-5_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-74958-5_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74957-8
Online ISBN: 978-3-540-74958-5
eBook Packages: Computer ScienceComputer Science (R0)