Affinity Measures Based on the Graph Laplacian

  title={Affinity Measures Based on the Graph Laplacian},
  author={Delip Rao and David Yarowsky and Chris Callison-Burch},
Several language processing tasks can be inherently represented by a weighted graph where the weights are interpreted as a measure of relatedness between two vertices. Measuring similarity between arbitary pairs of vertices is essential in solving several language processing problems on these datasets. Random walk based measures perform better than other path based measures like shortest-path. We evaluate several random walk measures and propose a new measure based on commute time. We use the… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…