期刊
INFORMATION SCIENCES
卷 556, 期 -, 页码 341-360出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2020.10.005
关键词
Link analysis; Graph mining; Network data analysis; Complex networks; Network science; Distances between nodes
资金
- Immediate project - InnovIris (Brussels region)
- Brufence project - InnovIris (Brussels region)
This study extends the randomized shortest paths model by introducing the net flow RSP and adding capacity constraints on edge flows. Experimental comparisons show that the net flow RSP dissimilarity is competitive with other state-of-the-art methods.
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a random-walk and a shortest-path behavior (Kivimaki et al., 2014; Saerens et al., 2009; Yen et al., 2008). The framework assumes a unit flow injected into a source node and collected from a target node with flows minimizing the expected transportation cost, together with a relative entropy regularization term. In this context, the present work first develops the net flow RSP model considering that edge flows in opposite directions neutralize each other (as in electric networks), and proposes an algorithm for computing the expected routing costs between all pairs of nodes. This quantity is called the net flow RSP dissimilarity measure between nodes. Experimental comparisons on node clustering tasks indicate that the net flow RSP dissimilarity is competitive with other state-of-the-art dissimilarities. In the second part of the paper, it is shown how to introduce capacity constraints on edge flows, and a procedure is developed to solve this constrained problem by exploiting Lagrangian duality. These two extensions should improve significantly the scope of applications of the RSP framework. (C) 2020 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据