公开(公告)号：US20230385338A1

公开(公告)日：2023-11-30

申请号：US18364998

申请日：2023-08-03

Applicant: Pinterest, Inc.

Inventor： Chantat Eksombatchai ,  Jurij Leskovec ,  Rahul Sharma ,  Charles Walsh Sugnet ,  Mark Bormann Ulrich

IPC: G06F16/901 ,  G06F16/435 ,  G06Q30/0201 ,  G06F16/2457

CPC classification number: G06F16/9024 ,  G06F16/435 ,  G06Q30/0201 ,  G06F16/24578 ,  G06F16/487

Abstract: 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.

公开(公告)号：US10762134B1

公开(公告)日：2020-09-01

申请号：US15870785

申请日：2018-01-12

Applicant: Pinterest, Inc.

Inventor： Chantat Eksombatchai ,  Jurij Leskovec ,  Rahul Sharma ,  Charles Walsh Sugnet ,  Mark Bormann Ulrich

IPC: G06F7/00 ,  G06F16/901 ,  G06Q30/02 ,  G06F16/2457 ,  G06F16/435 ,  G06F16/487

Abstract: 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.

公开(公告)号：US12277175B2

公开(公告)日：2025-04-15

申请号：US18364998

申请日：2023-08-03

Applicant: Pinterest, Inc.

Inventor： Chantat Eksombatchai ,  Jurij Leskovec ,  Rahul Sharma ,  Charles Walsh Sugnet ,  Mark Bormann Ulrich

IPC: G06F7/00 ,  G06F16/2457 ,  G06F16/435 ,  G06F16/901 ,  G06F16/958 ,  G06F18/23 ,  G06Q30/0201 ,  G06F16/487

Abstract: 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.

公开(公告)号：US11762908B1

公开(公告)日：2023-09-19

申请号：US17003851

申请日：2020-08-26

Applicant: Pinterest, Inc.

Inventor： Chantat Eksombatchai ,  Jurij Leskovec ,  Rahul Sharma ,  Charles Walsh Sugnet ,  Mark Bormann Ulrich

IPC: G06F7/00 ,  G06F16/901 ,  G06Q30/0201 ,  G06F16/2457 ,  G06F16/435 ,  G06F16/487

CPC classification number: G06F16/9024 ,  G06F16/24578 ,  G06F16/435 ,  G06Q30/0201 ,  G06F16/487

Abstract: 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.