EFFICIENT CALCULATION OF ALL-PAIR PATH-BASED DISTANCE MEASURES

摘要

A method is disclosed for computing a path-based distance between a pair of nodes in an undirected graph comprising a set of nodes and a set of edges connecting pairs of nodes in the undirected graph with each edge having an edge weight. The method includes: computing a minimum spanning tree (MST) over the undirected graph; computing a path-based distance between the pair of nodes in the MST; and setting the path-based distance between the pair of nodes in the undirected graph equal to the path-based distance between the pair of nodes in the MST. The path-based distance between the pair of nodes in the MST is computed as the largest edge weight along the only path between the pair of nodes in the minimum spanning tree. A similarity matrix may be constructed from the path-based distances, and used for spectral clustering.