Prabhu, H.R.S. and Wei, H.L. orcid.org/0000-0002-4704-7346 (2017) Preprocessing graphs for network inference applications. In: Gusikhin, O. and Madani, K., (eds.) Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics. ICINCO 2017, 36-28 Jul 2017, Madrid, Spain. SciTePress , pp. 406-413. ISBN 9789897582639
Abstract
The problem of network inference can be solved as a constrained matrix factorization problem where some sparsity constraints are imposed on one of the matrix factors. The solution is unique up to a scaling factor when certain rank conditions are imposed on both the matrix factors. Two key issues in factorising a matrix of data from some netwrok are that of establishing simple identifiability conditions and decomposing a network into identifiable subnetworks. This paper solves both the problems by introducing the notion of an ordered matching in a bipartite graphs. Novel and simple graph theoretical conditions are developed which can replace the aforementioned computationally intensive rank conditions. A simple algorithm to reduce a bipartite graph and a graph preprocessing algorithm to decompose a network into a set of identifiable subsystems is proposed.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2017 SciTePress. |
Keywords: | Bipartite Graphs; Reduced Graphs; Ordered Matching; Rank; Subnetworks |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 31 Jul 2019 14:31 |
Last Modified: | 31 Jul 2019 14:31 |
Status: | Published |
Publisher: | SciTePress |
Refereed: | Yes |
Identification Number: | 10.5220/0006401104060413 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:146956 |