公开(公告)号：US11468521B2

公开(公告)日：2022-10-11

申请号：US16293109

申请日：2019-03-05

Applicant: Tencent Technology (Shenzhen) Company Limited

Inventor： Pengpeng Zhao ,  Zhiyong Wu ,  Yongkun Li ,  Jun Yin ,  Dafu Deng ,  Longjun Sun ,  Juhong Wang ,  Wei Chen

IPC: G06F16/00 ,  G06Q50/00 ,  G06F16/9535 ,  G06F16/901 ,  H04L67/50

Abstract: This disclosure relates to an account filtering method and apparatus. The method includes obtaining user accounts of a social activity network and user activity information; constructing a hypergraph of the social activity network comprising nodes and hyperedges according to the user accounts and the user activity information, wherein a node in the hypergraph comprises the user account in the social activity network, and a hyperedge in the hypergraph comprises a set of user accounts that participates in a user activity of an activity type, or a friendship relation between one user account and another user account; for each node in the hypergraph, calculating a probability that another node of the hypergraph would walk to the node when performing a random walk along the hyperedge in the hypergraph, and obtaining an influence value of the node in the social activity network according to the probability; and sequentially filtering nodes of the hypergraph to obtain a sequence of nodes having a maximum influence by using an iteration algorithm, to form a seed node set.

公开(公告)号：US20190197633A1

公开(公告)日：2019-06-27

申请号：US16293109

申请日：2019-03-05

Applicant: Tencent Technology (Shenzhen) Company Limited

Inventor： Pengpeng Zhao ,  Zhiyong Wu ,  Yongkun Li ,  Jun Yin ,  Dafu Deng ,  Longjun Sun ,  Juhong Wang ,  Wei Chen

IPC: G06Q50/00 ,  G06F16/901 ,  G06F16/9535 ,  H04L29/08

CPC classification number: G06Q50/01 ,  G06F16/00 ,  G06F16/9024 ,  G06F16/9535 ,  H04L67/22

Abstract: This disclosure relates to an account filtering method and apparatus. The method includes obtaining user accounts of a social activity network and user activity information; constructing a hypergraph of the social activity network comprising nodes and hyperedges according to the user accounts and the user activity information, wherein a node in the hypergraph comprises the user account in the social activity network, and a hyperedge in the hypergraph comprises a set of user accounts that participates in a user activity of an activity type, or a friendship relation between one user account and another user account; for each node in the hypergraph, calculating a probability that another node of the hypergraph would walk to the node when performing a random walk along the hyperedge in the hypergraph, and obtaining an influence value of the node in the social activity network according to the probability; and sequentially filtering nodes of the hypergraph to obtain a sequence of nodes having a maximum influence by using an iteration algorithm, to form a seed node set.