Probabilistic SimRank computation over uncertain graphs
Abstract
Existing studies on graph-based analysis focus on standard graphs that are precise and complete. However, in many prevalent application domains, such as social, biological, and mobile networks, the existence of an edge in a graph is best captured by a likelihood measure or a probability. This paper investigates the problem of node similarity computation on large uncertain graphs. We first extend the well-known SimRank to define meaningful...
Paper Details
Title
Probabilistic SimRank computation over uncertain graphs
Published Date
Feb 1, 2015
Journal
Volume
295
Pages
521 - 535
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History