Graph-based semi-supervised and active learning for edge flows

Conference item

We present a graph-based semi-supervised learning (SSL) method for learning edge flows defined on a graph. Specifically, given flow measurements on a subset of edges, we want to predict the flows on the remaining edges. To this end, we develop a computational framework that imposes certain constraints on the overall flows, such as (approximate) flow conservation. These constraints render our approach different from classical graph-based SSL for vertex labels, which posits that tightly connected nodes share similar labels and leverages the graph structure accordingly to extrapolate from a few vertex labels to the unlabeled vertices. We derive bounds for our method's reconstruction error and demonstrate its strong performance on synthetic and real-world flow networks from transportation, physical infrastructure, and the Web. Furthermore, we provide two active learning algorithms for selecting informative edges on which to measure flow, which has applications for optimal sensor deployment. The first strategy selects edges to minimize the reconstruction error bound and works well on flows that are approximately divergence-free. The second approach clusters the graph and selects bottleneck edges that cross cluster-boundaries, which works well on flows with global trends.

Authors: Jia, J; Schaub, M; Segarra, S; Benson, A

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for Computing Machinery
• Host title: KDD '19 Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
• Journal: 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining(KDD ’19)
• Pages: 761-771
• Publication date: 2019-07-25
• Acceptance date: 2019-05-17
• DOI: 10.1145/3292500.3330872
• ISBN: 9781450362016