公开(公告)号：US10579703B2

公开(公告)日：2020-03-03

申请号：US15694559

申请日：2017-09-01

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Zhenguo Li ,  Jiefeng Cheng ,  Wei Fan

IPC: G06F17/12 ,  G06F16/951 ,  G06F7/00 ,  G06F17/16 ,  G06F17/10 ,  G06F16/903 ,  G06F7/02 ,  G06Q30/02

Abstract: A similarity measurement method includes: obtaining a directional relationship between nodes in a network, and determining a transition matrix; calculating a constraint matrix according to the transition matrix and an obtained attenuation factor; constructing a system of linear equations, where a coefficient matrix of the system of linear equations is the constraint matrix, and a variable of the system of linear equations is a correction vector; solving the system of linear equations by means of iteration by using a Jacobi method, and determining the correction vector; and calculating similarities between the nodes according to the transition matrix, the attenuation factor, and a diagonal correction matrix that is generated according to the correction vector. In the method, the correction vector is determined by using the Jacobi method, and further the similarities between the nodes may be calculated.

公开(公告)号：US20180276542A1

公开(公告)日：2018-09-27

申请号：US15993288

申请日：2018-05-30

Applicant: Huawei Technologies Co., Ltd.

Inventor： Jiefeng Cheng ,  Zhenguo Li ,  Xiuqiang He ,  Dahua Lin

IPC: G06N3/08 ,  G06N3/04

CPC classification number: G06N3/08 ,  G06F16/9535 ,  G06N3/04 ,  G06N3/0454 ,  G06N3/0472 ,  G06Q30/02 ,  G06Q30/0241 ,  G06Q30/0271

Abstract: A recommendation result generation method, where the method includes obtaining article content information of at least one article and user score information of at least one user, where user score information of a first user of the at least one user includes a historical score of the first user for the at least one article, encoding the article content information and the user score information using an article neural network and a user neural network respectively to obtain a target article latent vector of each of the at least one article and a target user latent vector of each of the at least one user, and calculating a recommendation result for each user according to the article latent vector and the user latent vector.

公开(公告)号：US20170364478A1

公开(公告)日：2017-12-21

申请号：US15694559

申请日：2017-09-01

Applicant: HUAWEI TECHNOLOGIES CO.,LTD.

Inventor： Zhenguo Li ,  Jiefeng Cheng ,  Wei Fan

IPC: G06F17/12 ,  G06F17/30 ,  G06F17/16

CPC classification number: G06F17/12 ,  G06F7/00 ,  G06F7/02 ,  G06F16/903 ,  G06F16/951 ,  G06F17/10 ,  G06F17/16 ,  G06Q30/02

Abstract: A similarity measurement method includes: obtaining a directional relationship between nodes in a network, and determining a transition matrix; calculating a constraint matrix according to the transition matrix and an obtained attenuation factor; constructing a system of linear equations, where a coefficient matrix of the system of linear equations is the constraint matrix, and a variable of the system of linear equations is a correction vector; solving the system of linear equations by means of iteration by using a Jacobi method, and determining the correction vector; and calculating similarities between the nodes according to the transition matrix, the attenuation factor, and a diagonal correction matrix that is generated according to the correction vector. In the method, the correction vector is determined by using the Jacobi method, and further the similarities between the nodes may be calculated.

公开(公告)号：US20170046387A1

公开(公告)日：2017-02-16

申请号：US15339530

申请日：2016-10-31

Applicant: Huawei Technologies Co., Ltd.

Inventor： Jiefeng Cheng ,  Cheng He ,  Wei Fan

IPC: G06F17/30

CPC classification number: G06F16/24542 ,  G06F16/2455 ,  G06F16/9024

Abstract: The present invention discloses a method and apparatus for querying a nondeterministic graph, which are used to implement quick query of a nondeterministic graph, reduce query complexity, and improve query efficiency. The method comprises receiving a query instruction, where the query instruction is used to query a nondeterministic graph for data that satisfies a query condition; determining two vertices in the nondeterministic graph according to the query instruction; determining all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point; calculate a probability of a first event or a second event corresponding to each of the paths; and obtaining, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction.

Abstract translation: 本发明公开了一种查询非确定性图的方法和装置，用于实现非确定性图形的快速查询，减少查询复杂度，提高查询效率。 该方法包括接收查询指令，其中使用查询指令来查询满足查询条件的数据的非确定性图; 根据查询指令确定非确定性图中的两个顶点; 确定使用两个顶点中的一个顶点作为起始点和另一个顶点作为终点的所有可能路径; 计算与每个路径相对应的第一事件或第二事件的概率; 并且根据第一事件的概率或第二事件的概率获得与查询指令相对应的查询结果。

公开(公告)号：US11194861B2

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

申请号：US16405367

申请日：2019-05-07

Applicant: Huawei Technologies Co., Ltd.

Inventor： Zhenguo Li ,  Jiefeng Cheng ,  Zhihong Zhao

IPC: G06F16/00 ,  G06F16/901 ,  G06F16/90

Abstract: The method of the present disclosure includes: after a graph partitioning apparatus extracts an edge, first determining whether an aggregation degree between a currently extracted edge and an allocated edge in a first device satisfies a preset condition; then, when the preset condition is satisfied, determining whether a quantity of allocated edges stored in the first device is less than a first preset threshold; and allocating the currently extracted edge to the first device when the quantity is less than the first preset threshold. In this way, an aggregation degree between allocated edges in each device is relatively high and each device has relatively balanced load. When an edge changes and an edge associated with the particular edge needs to be synchronized, a relatively small quantity of devices need to perform synchronization and update, so that costs of communication between devices are reduced, and distributed graph computing efficiency is improved.

公开(公告)号：US10706049B2

公开(公告)日：2020-07-07

申请号：US15339530

申请日：2016-10-31

Applicant: Huawei Technologies Co., Ltd.

Inventor： Jiefeng Cheng ,  Cheng He ,  Wei Fan

IPC: G06F16/24 ,  G06F16/2453 ,  G06F16/2455 ,  G06F16/901

Abstract: The present invention discloses a method and apparatus for querying a nondeterministic graph, which are used to implement quick query of a nondeterministic graph, reduce query complexity, and improve query efficiency. The method comprises receiving a query instruction, where the query instruction is used to query a nondeterministic graph for data that satisfies a query condition; determining two vertices in the nondeterministic graph according to the query instruction; determining all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point; calculate a probability of a first event or a second event corresponding to each of the paths; and obtaining, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction.