Exercise 5.3.1 : Compute the topic-sensitive PageRank for the graph of Fig. 5.15, assuming the teleport set is:
(a) A only.
M = matrix(c(0, 1/3 ,1/3 ,1/3,
1/2,0,0,1/2,
1,0,0,0,
0, 1/2 , 1/2, 0),nrow = 4)
r = matrix(c(1/4,1/4,1/4,1/4))
beta = 0.8
es = matrix(c(1,0,0,0),nrow=4)
s = 1
pre_r = r
r = (beta*M)%*%r + (1-beta)/s * es
while(pre_r != r ){
pre_r = r
r = (beta*M)%*%r + (1-beta)/s * es
}
r
(b) A and C.
M = matrix(c(0, 1/3 ,1/3 ,1/3,
1/2,0,0,1/2,
1,0,0,0,
0, 1/2 , 1/2, 0),nrow = 4)
r = matrix(c(1/4,1/4,1/4,1/4))
beta = 0.8
es = matrix(c(1,0,1,0),nrow=4)
s = 2
pre_r = r
r = (beta*M)%*%r + (1-beta)/s * es
while(pre_r != r ){
pre_r = r
r = (beta*M)%*%r + (1-beta)/s * es
}
r
'데이터마이닝' 카테고리의 다른 글
[데이터마이닝] 5.링크분석(Link analysis) 5.5절 연습문제(Exercise 5.5) (0) | 2020.05.19 |
---|---|
[데이터마이닝] 5.링크분석(Link analysis) 5.4절 연습문제(Exercise 5.4 ) (0) | 2020.05.16 |
[데이터마이닝] 5.링크분석(Link analysis) 5.2절 연습문제(Exercise 5.2.1 ) (0) | 2020.05.12 |
[데이터마이닝] 3. 유사항목 찾기(Finding Similar Items) - 3.3연습문제 (0) | 2020.05.05 |
[데이터마이닝] 3. 유사항목 찾기(Finding Similar Items) -3 민해싱 실제 구현은? Minhashing (0) | 2020.05.05 |