- 专利标题: Node graph traversal methods
-
申请号: US15870785申请日: 2018-01-12
-
公开(公告)号: US10762134B1公开(公告)日: 2020-09-01
- 发明人: Chantat Eksombatchai , Jurij Leskovec , Rahul Sharma , Charles Walsh Sugnet , Mark Bormann Ulrich
- 申请人: Pinterest, Inc.
- 申请人地址: US CA San Francisco
- 专利权人: Pinterest, Inc.
- 当前专利权人: Pinterest, Inc.
- 当前专利权人地址: US CA San Francisco
- 代理机构: Athorus, PLLC
- 主分类号: G06F7/00
- IPC分类号: G06F7/00 ; G06F16/901 ; G06Q30/02 ; G06F16/2457 ; G06F16/435 ; G06F16/487
摘要:
This disclosure describes systems and methods that facilitate the generation of recommendations by traversing a graph. Walks that traverse the graph may be initiated from a plurality of different nodes in the node graph. In order to give greater or lesser weight to particular nodes, the walks may have different lengths depending on the nodes from which they are initiated, or an unequal amount of walks may be distributed between nodes from which walks are initiated. A plurality of walks through a node graph may be tracked, and visit counts or scores for nodes in the node graph may be determined. For example, scores may be increased for nodes that are visited by a walk initiated from a first node and a second walk initiated from a second node, or scores may be decreased for nodes that are not visited by a first walk initiated from a first node and a second walk initiated from a second node. Content corresponding to nodes may be recommended based on the scores or visit counts.
信息查询