For graph mining using random walk with restart (RWR), the formula is (mathbf{r}_{i}=c tilde{W} mathbf{r}_{i}+(1-c) mathbf{e}_{i}), where

Question:

For graph mining using random walk with restart (RWR), the formula is \(\mathbf{r}_{i}=c \tilde{W} \mathbf{r}_{i}+(1-c) \mathbf{e}_{i}\), where the ranking vector \(\mathbf{r}_{i}\) will start the random walk from node \(i, c\) is the restart probability, \(\tilde{W}\) is the normalized weight matrix, and \(\mathbf{e}_{i}\) is the starting vector. Please explain:

a. Why RWR could capture multiple weighted relationship between nodes?

b. What is the similarity and the difference between random walk based graph kernel and RWR?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Data Mining Concepts And Techniques

ISBN: 9780128117613

4th Edition

Authors: Jiawei Han, Jian Pei, Hanghang Tong

Question Posted: