NED: An Inter-Graph Node Metric Based On Edit Distance

@article{Zhu2017NEDAI,
  title={NED: An Inter-Graph Node Metric Based On Edit Distance},
  author={Haohan Zhu and Xianrui Meng and G. Kollios},
  journal={ArXiv},
  year={2017},
  volume={abs/1602.02358}
}
  • Haohan Zhu, Xianrui Meng, G. Kollios
  • Published 2017
  • Computer Science
  • ArXiv
  • Node similarity is a fundamental problem in graph analytics. However, node similarity between nodes in different graphs (inter-graph nodes) has not received a lot of attention yet. The inter-graph node similarity is important in learning a new graph based on the knowledge of an existing graph (transfer learning on graphs) and has applications in biological, communication, and social networks. In this paper, we propose a novel distance function for measuring inter-graph node similarity with edit… CONTINUE READING
    2 Citations
    StructSim: Querying Structural Node Similarity at Billion Scale
    • 5

    References

    SHOWING 1-10 OF 41 REFERENCES
    NED: An Inter-Graph Node Metric on Edit Distance
    • 1
    • PDF
    Approximate graph edit distance computation by means of bipartite graph matching
    • 557
    • PDF
    Comparing Stars: On Approximating Graph Edit Distance
    • 302
    • PDF
    Neighborhood based fast graph search in large networks
    • 131
    • PDF
    NeMa: Fast Graph Search with Label Similarity
    • 121
    • PDF
    Fast Suboptimal Algorithms for the Computation of Graph Edit Distance
    • 178
    • PDF
    A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
    • 413
    • Highly Influential
    • PDF
    Efficiently Indexing Large Sparse Graphs for Similarity Search
    • 71
    More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks
    • 58
    • PDF
    Network similarity via multiple social theories
    • 58
    • PDF