Direction-aware proximity for graph mining
AssigneeAT&T Intellectual Property I, L.P.
InventorsYehuda Koren, Christos Faloutsos, Hanghang Tong
Life of this patent
Estimating the term…
Abstract
A method and system for graph mining direction-aware proximity measurements. A directed graph includes nodes and directed edges connecting the nodes. A direction-aware proximity measurement is calculated from a first node to a second node or from a first group of nodes to a second group of nodes. The direction-aware proximity measurement from a first node to second node is based on an escape probability from the first node to the second node. Disclosed herein are methods for efficiently calculating one or multiple direction-aware proximity measurements. The direction-aware proximity measurements can be used in performing various graph mining applications.
Claims25
A method for graph mining a directed graph including a plurality of nodes and a plurality of directed edges, comprising:
- calculating, at a processor, a direction-aware proximity measurement from at least one first node to at least one second node, the direction-aware proximity measurement based on an escape probability from said at least one first node to said at least one second node;
- and
- performing, at a processor, at least one graph mining application using the direction-aware proximity measurement from said at least one first node to said at least one second node.
An apparatus for graph mining a directed graph including a plurality of nodes and a plurality of directed edges, comprising:
- means for calculating a direction-aware proximity measurement from at least one first node to at least one second node, the direction-aware proximity measurement based on an escape probability from said at least one first node to said at least one second node;
- and
- means for performing at least one graph mining application using the direction-aware proximity measurement from said at least one first node to said at least one second node.
A computer readable medium storing computer executable instructions for graph mining a directed graph including a plurality of nodes and a plurality of directed edges, the computer executable instructions defining steps comprising:
- calculating a direction-aware proximity measurement from at least one first node to at least one second node, the direction-aware proximity measurement based on an escape probability from said at least one first node to said at least one second node;
- and
- performing at least one graph mining application using the direction-aware proximity measurement from said at least one first node to said at least one second node.
Dependencies are inferred from the claim text.