Second-order random walk-based proximity measures in graph analysis: formulations and algorithms

Measuring the proximity between different nodes is a fundamental problem in graph analysis. Random walk-based 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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The VLDB journal 2018-02, Vol.27 (1), p.127-152
Hauptverfasser:	Wu, Yubao, Zhang, Xiang, Bian, Yuchen, Cai, Zhipeng, Lian, Xiang, Liao, Xueting, Zhao, Fengpan
Format:	Artikel
Sprache:	eng
Schlagworte:	Clustering Computer Science Computer simulation Database Management Formulations Markov analysis Markov chains Monte Carlo simulation Performance enhancement Proximity Random walk Random walk theory Regular Paper Transition probabilities
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!