发明名称 |
Direction-aware proximity for graph mining |
摘要 |
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.
|
申请公布号 |
US2009204554(A1) |
申请公布日期 |
2009.08.13 |
申请号 |
US20080069500 |
申请日期 |
2008.02.11 |
申请人 |
KOREN YEHUDA;FALOUTSOS CHRISTOS;TONG HANGHANG |
发明人 |
KOREN YEHUDA;FALOUTSOS CHRISTOS;TONG HANGHANG |
分类号 |
G06F15/18 |
主分类号 |
G06F15/18 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|