公开(公告)号：US11797607B2

公开(公告)日：2023-10-24

申请号：US17211612

申请日：2021-03-24

Applicant: BEIJING BAIDU NETCOM SCIENCE AND TECHNOLOGY CO., LTD.

Inventor： Huan Liu ,  Mingquan Cheng ,  Kunbin Chen ,  Zhun Liu ,  Bolei He ,  Wei He

IPC: G06F16/901 ,  G06F18/21 ,  G06F18/25 ,  G06F18/2132 ,  G06F40/30 ,  G06T7/00 ,  G06V30/413 ,  G06V30/40 ,  G06V30/18 ,  G06V30/19 ,  G06V10/82 ,  G06V30/10

CPC classification number: G06F16/901 ,  G06F18/217 ,  G06F18/253 ,  G06F40/30 ,  G06T7/0002 ,  G06V10/82 ,  G06V30/18057 ,  G06V30/19173 ,  G06V30/40 ,  G06V30/413 ,  G06F18/2132 ,  G06T2207/30168 ,  G06T2207/30176 ,  G06V30/10

Abstract: Embodiments of the present disclosure disclose a method and apparatus for constructing a quality evaluation model, an electronic device and a computer-readable storage medium. A specific implementation mode of the method comprises: acquiring samples of knowledge contents; extracting statistical features, semantic features, and image features respectively from the samples of knowledge contents; and constructing a quality evaluation model for knowledge according to the statistical features, the semantic features, and the image features. On the basis of the prior art, this implementation mode additionally uses semantic features and image features of knowledge contents to construct a more accurate quality evaluation model based on multi-dimensional features that characterize the actual quality of a knowledge, which may well discover some brief but very useful summary knowledge in an enterprise and may recommend high-quality knowledge more accurately for employees in the enterprise.

公开(公告)号：US11657091B2

公开(公告)日：2023-05-23

申请号：US16986120

申请日：2020-08-05

Applicant: BEIJING BAIDU NETCOM SCIENCE AND TECHNOLOGY CO., LTD.

Inventor： Le Deng ,  Kunbin Chen ,  Jun Fang

IPC: G06F16/901 ,  G06F16/2455 ,  G06F16/28

CPC classification number: G06F16/9024 ,  G06F16/24558 ,  G06F16/288

Abstract: The present disclosure provides a method and an apparatus for querying the shortest path of a graph, and a storage medium. The method includes: performing a breadth-first search in a distributed graph database with a start entity to be searched and an end entity to be searched as root nodes respectively, and obtaining a layer of new entities for each search; performing an intersection checking on the new entities and entities of the highest layer from a search set on an opposite side, so as to determine whether an intersection between the new entities and the entities of the highest layer exists; and when the intersection exists, determining intersection points, and performing path backtracking through the intersection points to find the shortest path from the start entity to the end entity.