Abstract
In many signal processing and data mining applications, we need to approximate a given matrix Y with a low-rank product Y≈AX. Both matrices A and X are to be determined, but we assume that from the specifics of the application we have an important piece of a-priori knowledge: A must have zeros at certain positions.
In general, different AX factorizations approximate a given Y equally well, so a fundamental question is whether the known zero pattern of A contributes to the uniqueness of the factorization. Using the notion of structural rank, we present a combinatorial characterization of uniqueness up to diagonal scaling (subject to a mild non-degeneracy condition on the factors), called structural identifiability of the model.
Next, we define an optimization problem that arises in the need for efficient experimental design. In this context, Y contains sensor measurements over several time samples, X contains source signals over time samples and A contains the source-sensor mixing coefficients. Our task is to monitor the signal sources with the cheapest subset of sensors, while maintaining structural identifiability. Firstly, we show that this problem is NP-hard. Secondly, we present a mixed integer linear program for its exact solution together with two practical incremental approaches. We also propose a greedy approximation algorithm. Finally, we perform computational experiments on simulated problem instances of various sizes.
Similar content being viewed by others
References
Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43, 842–844 (1957)
Boscolo, R., Sabatti, C., Liao, J.C., Roychowdhury, V.P.: A generalized framework for network component analysis. IEEE Trans. Comput. Biol. Bioinform. 2(4), 289–301 (2005)
Brunet, J.-P., Tamayo, P., Golub, T.R., Mesirov, J.P.: Metagenes and molecular pattern discovery using matrix factorization. Proc. Natl. Acad. Sci. 101(12), 4164–4169 (2004)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2005)
Fritzilas, E., Rahmann, S., Rios-Solis, Y.A.: Structural identifiability in low-rank matrix factorization. In: Hu, X., Wang, J. (eds.) Computing and Combinatorics. LNCS, vol. 5092, pp. 140–148. Springer, Berlin (2008). Proceedings of the 14th International Conference COCOON 2008, Dalian, China
Fujishige, S.: Submodular Functions and Optimization. Elsevier, Amsterdam (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225–231 (1973)
Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)
Liao, J.C., Boscolo, R., Yang, Y.-L., Tran, L.M., Sabatti, C., Roychowdhury, V.P.: Network component analysis: reconstruction of regulatory signals in biological systems. Proc. Natl. Acad. Sci. 100(26), 15522–15527 (2003)
Lin, C.-J.: Projected gradient methods for non-negative matrix factorization. Neural Comput. 19, 2756–2779 (2007)
Lovász, L., Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)
Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)
Narasimhan, S., Rengaswamy, R., Vadigepalli, R.: Structural properties of gene regulatory networks: Definitions and connections. IEEE Trans. Comput. Biol. Bioinform. 6(1), 158–170 (2009)
Narayanan, H.: Submodular Functions and Electrical Networks. Elsevier, Amsterdam (1997)
Papadimitriou, C.H., Stieglitz, K.: Combinatorial Optimization. Dover, New York (1998)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: STOC, pp. 475–484 (1997)
Sard, A.: The measure of the critical values of differentiable maps. Bull. Am. Math. Soc. 48(12), 883–890 (1942)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2004)
Shahnaz, F., Berry, M.W., Pauca, V.P., Plemmons, R.J.: Document clustering using nonnegative matrix factorization. Inf. Proc. Manag. 42(2), 373–386 (2006)
Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2004)
Wang, H., Hubbell, E., Hu, J., Mei, G., Cline, M., Lu, G., Clark, T., Siani-Rose, M.A., Ares, M., Kulp, D.C., Haussler, D.: Gene structure-based splice variant deconvolution using a microarray platform. Bioinformatics 19, i315–i322 (2003)
Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385–393 (1982)
Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fritzilas, E., Milanič, M., Rahmann, S. et al. Structural Identifiability in Low-Rank Matrix Factorization. Algorithmica 56, 313–332 (2010). https://doi.org/10.1007/s00453-009-9331-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-009-9331-2