Fast discovery of connection subgraphs

@article{Faloutsos2004FastDO,
  title={Fast discovery of connection subgraphs},
  author={C. Faloutsos and K. McCurley and A. Tomkins},
  journal={Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining},
  year={2004}
}
  • C. Faloutsos, K. McCurley, A. Tomkins
  • Published 2004
  • Mathematics, Computer Science
  • Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
  • We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a paradigm for exploration and knowledge discovery in large social networks graphs. We present a formal definition of this problem, and an ideal solution based on electricity analogues. We then show how to accelerate the computations, to produce approximate, but high-quality connection subgraphs in real time on very large… CONTINUE READING
    395 Citations

    Figures, Tables, and Topics from this paper

    Fast Discovery of Reliable Subnetworks
    • 20
    • PDF
    Finding reliable subgraphs from large probabilistic graphs
    • 90
    • Highly Influenced
    • PDF
    Identifying Relevant Subgraphs in Large Networks
    Finding (Short) Paths in Social Networks
    • PDF
    The Most Reliable Subgraph Problem
    • 28
    • PDF
    Discovering informative connection subgraphs in multi-relational graphs
    • 98
    • Highly Influenced
    • PDF
    Spotting Significant Changing Subgraphs in Evolving Graphs
    • 32
    • PDF