P-Rank: a comprehensive structural similarity measure over information networks
Citations
998 citations
Cites background from "P-Rank: a comprehensive structural ..."
...rting from the two nodes are expected to meet each other by randomly walking “backwards” in the graph. Several variants of SimRank are also proposed by [Antonellis et al., 2008, Chen and Giles, 2013, Zhao et al., 2009]. Finally, many link prediction approaches essentially quantify the similarity or closeness of pairs of nodes in the graph. Several such measures of varying computational complexity exist. The simple...
[...]
...Several variants of SimRank are also proposed by [Antonellis et al., 2008, Chen and Giles, 2013, Zhao et al., 2009]....
[...]
703 citations
594 citations
Cites background from "P-Rank: a comprehensive structural ..."
...Current research has focused on either pre-defined feature vectors [42] or sophisticated graph-based algorithms [48] to solve the underlying tasks....
[...]
237 citations
Cites background from "P-Rank: a comprehensive structural ..."
...Other several network similarity measures such as the vertex similarity, graphlet degree distribution or P-Rank were not included [53]–[55]....
[...]
220 citations
Cites methods from "P-Rank: a comprehensive structural ..."
...applied to scientic publication network analysis [17, 19, 20, 35], public general social media analysis [14, 33, 34], and document analysis based on knowledge graph [24–27]....
[...]
References
14,696 citations
"P-Rank: a comprehensive structural ..." refers methods in this paper
...[16] proposed a similarity measure based on PageRank score propagation through link paths....
[...]
...SimRank [10, 6, 17], together with its variant [2], is an iterative PageRank-like structural similarity measure for INs....
[...]
...It goes beyond simple CoCitation much as PageRank goes beyond direct linking for computing importance of web pages....
[...]
...Iterative fixed-point algorithms over the web graph, like HITS [14] and PageRank [3], have been studied and applied to compute“importance”scores for Web pages....
[...]
13,327 citations
10,537 citations
"P-Rank: a comprehensive structural ..." refers methods in this paper
...We randomly choose 10 vertices (without replacement) as initial centers of clusters and run the K-Medoids algorithm....
[...]
...We plug P-Rank and SimRank into K-Medoids [12], respectively....
[...]
...At the beginning, we randomly choose 10 author vertices (without replacement) as initial centers of clusters and run the K-Medoids algorithm....
[...]
...We plug P-Rank and SimRank respectively as underlying similarity functions into K-Medoids (K = 10)....
[...]
9,011 citations
8,328 citations