公开(公告)号：US11250088B2

公开(公告)日：2022-02-15

申请号：US17222968

申请日：2021-04-05

Applicant: Advanced New Technologies Co., Ltd.

Inventor： Xiaofu Chang ,  Jianfeng Wen ,  Xuqin Liu ,  Le Song ,  Yuan Qi

IPC: G06F16/90 ,  G06F16/9536 ,  G06F16/901

Abstract: Computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media for processing interaction sequence data are disclosed. One computer-implemented method includes: obtaining a dynamic interaction graph is obtained, where the dynamic interaction graph is constructed based on a dynamic interaction sequence, including a plurality of interactions arranged in a chronological order, where each interaction includes two objects involved in the interaction and a time of the interaction. In the dynamic interaction graph, a sub-graph corresponding to a target node is determined, where nodes in the sub-graph comprise the target node and connection nodes connected to the target node through a predetermined amount of edges originating from the target node. A feature vector corresponding to the target node is determined based on a node feature of each of the nodes of the sub-graph and directions of edges of the sub-graph.

公开(公告)号：US20210224347A1

公开(公告)日：2021-07-22

申请号：US17222968

申请日：2021-04-05

Applicant: Advanced New Technologies Co., Ltd.

Inventor： Xiaofu Chang ,  Jianfeng Wen ,  Xuqin Liu ,  Le Song ,  Yuan Qi

IPC: G06F16/9536 ,  G06F16/901

Abstract: Computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media for processing interaction sequence data are disclosed. One computer-implemented method includes: obtaining a dynamic interaction graph is obtained, where the dynamic interaction graph is constructed based on a dynamic interaction sequence, including a plurality of interactions arranged in a chronological order, where each interaction includes two objects involved in the interaction and a time of the interaction. In the dynamic interaction graph, a sub-graph corresponding to a target node is determined, where nodes in the sub-graph comprise the target node and connection nodes connected to the target node through a predetermined amount of edges originating from the target node. A feature vector corresponding to the target node is determined based on a node feature of each of the nodes of the sub-graph and directions of edges of the sub-graph.

公开(公告)号：US10970350B2

公开(公告)日：2021-04-06

申请号：US16813627

申请日：2020-03-09

Applicant: Advanced New Technologies Co., Ltd.

Inventor： Xiaofu Chang ,  Jianfeng Wen ,  Xuqin Liu ,  Le Song ,  Yuan Qi

IPC: G06F16/90 ,  G06F16/9536 ,  G06F16/901

Abstract: Computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media for processing interaction sequence data are disclosed. One computer-implemented method includes: obtaining a dynamic interaction graph is obtained, where the dynamic interaction graph is constructed based on a dynamic interaction sequence, including a plurality of interactions arranged in a chronological order, where each interaction includes two objects involved in the interaction and a time of the interaction. In the dynamic interaction graph, a sub-graph corresponding to a target node is determined, where nodes in the sub-graph comprise the target node and connection nodes connected to the target node through a predetermined amount of edges originating from the target node. A feature vector corresponding to the target node is determined based on a node feature of each of the nodes of the sub-graph and directions of edges of the sub-graph.

公开(公告)号：US20210049225A1

公开(公告)日：2021-02-18

申请号：US16813627

申请日：2020-03-09

Applicant: Advanced New Technologies Co., Ltd.

Inventor： Xiaofu Chang ,  Jianfeng Wen ,  Xuqin Liu ,  Le Song ,  Yuan Qi

IPC: G06F16/9536 ,  G06N3/04 ,  G06K9/62 ,  G06F16/901

Abstract: Computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media for processing interaction sequence data are disclosed. One computer-implemented method includes: obtaining a dynamic interaction graph is obtained, where the dynamic interaction graph is constructed based on a dynamic interaction sequence, including a plurality of interactions arranged in a chronological order, where each interaction includes two objects involved in the interaction and a time of the interaction. In the dynamic interaction graph, a sub-graph corresponding to a target node is determined, where nodes in the sub-graph comprise the target node and connection nodes connected to the target node through a predetermined amount of edges originating from the target node. A feature vector corresponding to the target node is determined based on a node feature of each of the nodes of the sub-graph and directions of edges of the sub-graph.