Opening book details…
Can I read Second-order Random Walk-based Proximity Measures in Graph Analysis: Formulations and Algorithms on EtoBox?
Second-order Random Walk-based Proximity Measures in Graph Analysis: Formulations and Algorithms by Yubao Wu; Xiang Zhang; Yuchen Bian; Zhipeng Cai; Xiang Lian; Xueting Liao; Fengpan Zhao is a Computer Science article available to read on EtoBox.
What is Second-order Random Walk-based Proximity Measures in Graph Analysis: Formulations and Algorithms about?
Measuring the proximity between different nodes is a fundamental problem in graph analysis. Random walkbased proximity measures have been shown to be effective and widely used. Most existing random walk measures are based on the first-order Markov model, i.e., they assume that the next step of the random surfer only depends on the current node. However, this assumption neither holds in many real-life applications nor captures the clustering structure in the graph. To address the limitation of the existing firstorder measures, in this paper, we study the second-order random walk measures, which take the previously visited Electronic supplementary material The online version of this article (https://doi.org/10.1007/s00778-017-0490-5) contains supplementary material, which is available to authorized users.
Who reads Second-order Random Walk-based Proximity Measures in Graph Analysis: Formulations and Algorithms?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Yubao Wu; Xiang Zhang; Yuchen Bian; Zhipeng Cai; Xiang Lian; Xueting Liao; Fengpan Zhao
- Publisher
- Springer Science and Business Media LLC
- Published
- 2017
- Language
- EN
- Field
- Computer Science (Physical Sciences)