Efficient calculation of all-pair path-based distance measures
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Oct 31, 2017
Issued Date -
N/A
app pub date -
Feb 6, 2015
filing date -
Feb 6, 2015
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully