A Measure of Similarity between Graph Vertices . with Applications to Synonym Extraction and Web Searching

Abstract

Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB similarity matrix S whose real entry sij expresses how similar vertex i (in GA) is to vertex j (in GB) : we say that sij is their similarity score. In the special case where GA… (More)

6 Figures and Tables

Topics

  • Presentations referencing similar topics