Exploiting the Block Structure of Link Graph for Efficient Similarity Computation

@inproceedings{Li2009ExploitingTB,
  title={Exploiting the Block Structure of Link Graph for Efficient Similarity Computation},
  author={Pei Li and Yuanzhe Cai and Hongyan Liu and Jun He and Xiaoyong Du},
  booktitle={PAKDD},
  year={2009}
}
In many real-world domains, link graph is one of the most effective ways to model the relationships between objects. Measuring the similarity of objects in a link graph is studied by many researchers, but an effective and efficient method is still expected. Based on our observation of link graphs from real domains, we find the block structure naturally exists. We propose an algorithm called BlockSimRank, which partitions the link graph into blocks, and obtains similarity of each node-pair in… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS
22 Citations
17 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 17 references

METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System

  • G. Karypis, V. Kumar
  • Technical Report, Department of Computer Science…
  • 1995
Highly Influential
3 Excerpts

Yu

  • X. Yin, J. Han
  • P.S.: Linkclus: Efficient clustering via…
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…