Fast direction-aware proximity for graph mining

@inproceedings{Tong2007FastDP,
  title={Fast direction-aware proximity for graph mining},
  author={Hanghang Tong and Christos Faloutsos and Yehuda Koren},
  booktitle={KDD},
  year={2007}
}
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in several graph mining tasks, including clustering, link prediction and connection subgraph discovery. Our proximity measure is based on the conceptof escape probability. This way, we strive to summarize the multiple facets of nodes-proximity, while avoiding some of the pitfalls to which alternative proximity measures are… CONTINUE READING
Highly Cited
This paper has 136 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 64 extracted citations

137 Citations

01020'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 137 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.