Sign inSign up
Efficient SimRank Computation via Linearization thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Efficient SimRank Computation via Linearization

Published on Oct 07, 20142354 Views

Takanori Maehara

SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for computing SimRank, their c

Research Sessions

Related categories

Data MiningKnowledge Extraction

Chapter list

Efficient SimRank Computation via Linearization00:00
Similarity Search00:14
Similarity Search Problems on Graph Data00:36
SimRank (Jeh and Widom 2002)01:43
Existing Results02:38
Existing Results and Our Contribution03:16
Contents - 103:39
Why SimRank computation is difficult? - 103:53
Why SimRank computation is difficult? - 204:35
SimRank Linearization - 105:05
SimRank Linearization - 205:28
Contents - 206:05
How to use the linearization? - 106:17
How to use the linearization? - 206:38
Contents - 308:33
How to compute D?08:35
Algorithm for estimating D09:22
Contents - 410:08
Experimental Results (single source problem)10:15
Contents - 511:17
Conclusion11:20