-
公开(公告)号：US12277397B2
公开(公告)日：2025-04-15
申请号：US17564369
申请日：2021-12-29
Inventor： Chao Ma , Jingshuai Zhang , Qifan Huang , Kaichun Yao , Peng Wang , Hengshu Zhu
Abstract: A method of training a model, a method of determining a word vector, a device, a medium, and a product are provided, which may be applied to fields of natural language processing, information processing, etc. The method includes: acquiring a first word vector set corresponding to a first word set; and generating a reduced-dimensional word vector for each word vector in the first word vector set based on a word embedding model, generating, for other word vector in the first word vector set, a first probability distribution in the first word vector set based on the reduced-dimensional word vector, and adjusting a parameter of the word embedding model so as to minimize a difference between the first probability distribution and a second probability distribution for the other word vector determined by a number of word vector in the first word vector set.
-
Patent Agency Ranking
公开(公告)号：US12265950B2
公开(公告)日：2025-04-01
申请号：US17564363
申请日：2021-12-29
Inventor： Jingshuai Zhang , Qifan Huang , Chao Ma , Hengshu Zhu , Peng Wang , Kaichun Yao , Jing Wang
IPC: G06Q10/1053 , G06N3/08
Abstract: The present disclosure provides a method and an apparatus of matching data, a device and a computer-readable storage medium, which are related to the field of artificial intelligence technology, and in particularly to the field of intelligent search and deep learning. The specific implementation solution includes: obtaining a first instance of a resume and a second instance of a job profile; determining, for a meta path, a resume feature data of the first instance and a profile feature data of the second instance, the meta path is a knowledge graph path from the resume to the job profile; and applying a classification model to the resume feature data of the first instance and the profile feature data of the second instance to determine a matching result between the first instance and the second instance.
-
3.发明授权公开(公告)号：US12038989B2
公开(公告)日：2024-07-16
申请号：US18148775
申请日：2022-12-30
Inventor： Zheng Dong , Peng Wang , Xin Song , Hengshu Zhu , Kaichun Yao
IPC: G06F16/00 , G06F16/9536 , G06N3/092
CPC classification number: G06F16/9536 , G06N3/092
Abstract: A method for community search is performed by an electronic device. The method includes: obtaining graph data to be processed, in which the graph data includes a plurality of nodes and a plurality of connection edges between the nodes; determining a query node from the plurality of nodes based on the graph data, and determining a target community to which the query node belongs by performing a community search for the query node, in which the target community includes the query node, and at least one node other than the query node in the plurality of nodes; and determining the query node and performing the community search for the query node repeatedly until the community to which each node included in the graph data belongs is determined.
-
4.发明授权公开(公告)号：US11989962B2
公开(公告)日：2024-05-21
申请号：US17559643
申请日：2021-12-22
Inventor： Chao Ma , Jingshuai Zhang , Qifan Huang , Kaichun Yao , Peng Wang , Hengshu Zhu
IPC: G06V30/00 , G06V30/148 , G06V30/18 , G06V30/262 , G06V30/41
CPC classification number: G06V30/153 , G06V30/18181 , G06V30/274 , G06V30/41
Abstract: A method, an apparatus, a device, a storage medium and a program product of performing a text matching are provided, which relate to a field of a computer technology, and in particular to natural language processing and deep learning technologies. The method includes: determining a word set and a plurality of semantic units from a text set, the word set is associated with a first predetermined attribute, and the text set contains a plurality of first texts indicating an object information and a plurality of second texts indicating an object demand information; generating a graph; and generating a final feature representation associated with the text set and the word set based on the graph and a graph convolution model, so as to perform the text matching.
-
公开(公告)号：US20230140148A1
公开(公告)日：2023-05-04
申请号：US18148775
申请日：2022-12-30
Inventor： Zheng Dong , Peng Wang , Xin Song , Hengshu Zhu , Kaichun Yao
IPC: G06F16/9536
Abstract: A method for community search is performed by an electronic device. The method includes: obtaining graph data to be processed, in which the graph data includes a plurality of nodes and a plurality of connection edges between the nodes; determining a query node from the plurality of nodes based on the graph data, and determining a target community to which the query node belongs by performing a community search for the query node, in which the target community includes the query node, and at least one node other than the query node in the plurality of nodes; and determining the query node and performing the community search for the query node repeatedly until the community to which each node included in the graph data belongs is determined.
-
公开(公告)号：US20220414689A1
公开(公告)日：2022-12-29
申请号：US17900649
申请日：2022-08-31
Inventor： Qi Zhang , Hengshu Zhu , Peng Wang , Hao Liu , Hui Xiong
Abstract: A method and an apparatus for training a path representation model are provided. The method may include: acquiring at least one trajectory point of at least one user, where each trajectory point of each user includes a place passed by the user, a start time and a duration; inputting the at least one trajectory point of the at least one user into a pre-trained model to obtain a trajectory representation of each user; obtaining, for each user, a position of each trajectory point from the trajectory representation of the user by searching according to the start time and the duration of each trajectory point of the user; and adjusting a network parameter of the pre-trained model according to a difference between the place passed by each user and the position of each trajectory point obtained by searching, to obtain a path representation model.
-
-
-
-
-
Search Results
6
records
(took 0.018 seconds)
