Name
Abstract | ||
|---|---|---|
SimRank is a similarity measure between vertices in a graph. Recently, many algorithms have been proposed to efficiently evaluate SimRank similarities. However, the existing algorithms either overlook uncertainty in graph structures or depends on an unreasonable assumption. In this paper, we study SimRank on uncertain graphs. Following the random-walk-based formulation of SimRank on deterministic ... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TKDE.2017.2725275 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | Field | DocType |
Proteins,Uncertainty,Approximation algorithms,Measurement uncertainty,Linear matrix inequalities,Markov processes,Erbium | Data mining,Approximation algorithm,Discrete mathematics,Markov process,Vertex (geometry),Similarity measure,Random walk,Computer science,Markov chain,Theoretical computer science,SimRank,Computation | Journal |
Volume | Issue | ISSN |
29 | 11 | 1041-4347 |
Citations | PageRank | References |
1 | 0.34 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rong Zhu | 1 | 12 | 2.81 |
| Zhaonian Zou | 2 | 331 | 15.78 |
| Jianzhong Li | 3 | 63 | 24.23 |