loading
Documents

Research.Publish.Connect.

Paper

Authors: H. R. Sachin Prabhu and Hua-Liang Wei

Affiliation: The University of Sheffield, United Kingdom

ISBN: 978-989-758-263-9

Keyword(s): Bipartite Graphs, Reduced Graphs, Ordered Matching, Rank, Subnetworks.

Related Ontology Subjects/Areas/Topics: Informatics in Control, Automation and Robotics ; Information-Based Models for Control ; Modeling, Analysis and Control of Discrete-event Systems ; Signal Processing, Sensors, Systems Modeling and Control ; Signal Reconstruction ; System Modeling

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.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.234.227.202

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Prabhu, H. and Wei, H. (2017). Preprocessing Graphs for Network Inference Applications.In Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-758-263-9, pages 406-413. DOI: 10.5220/0006401104060413

@conference{icinco17,
author={H. R. Sachin Prabhu. and Hua{-}Liang Wei.},
title={Preprocessing Graphs for Network Inference Applications},
booktitle={Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2017},
pages={406-413},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006401104060413},
isbn={978-989-758-263-9},
}

TY - CONF

JO - Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Preprocessing Graphs for Network Inference Applications
SN - 978-989-758-263-9
AU - Prabhu, H.
AU - Wei, H.
PY - 2017
SP - 406
EP - 413
DO - 10.5220/0006401104060413

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.