EFFICIENT PROCESSING OF NEIGHBORHOOD DATA
    1.
    发明申请

    公开(公告)号:US20190286754A1

    公开(公告)日:2019-09-19

    申请号:US16178443

    申请日:2018-11-01

    Abstract: Systems and methods for generating embeddings for nodes of a corpus graph are presented. More particularly, operations for generation of an aggregated embedding vector for a target node is efficiently divided among operations on a central processing unit and operations on a graphic processing unit. With regard to a target node within a corpus graph, processing by one or more central processing units (CPUs) is conducted to identify the target node's relevant neighborhood (of nodes) within the corpus graph. This information is prepared and passed to one or more graphic processing units (GPUs) that determines the aggregated embedding vector for the target node according to data of the relevant neighborhood of the target node.

    GENERATING NEIGHBORHOOD CONVOLUTIONS WITHIN A LARGE NETWORK

    公开(公告)号:US20190286658A1

    公开(公告)日:2019-09-19

    申请号:US16273939

    申请日:2019-02-12

    Abstract: Systems and methods for generating embeddings for nodes of a corpus graph are presented. More particularly, operations for generation of an aggregated embedding vector for a target node is efficiently divided among operations on a central processing unit and operations on a graphic processing unit. With regard to a target node within a corpus graph, processing by one or more central processing units (CPUs) is conducted to identify the target node's relevant neighborhood (of nodes) within the corpus graph. This information is prepared and passed to one or more graphic processing units (GPUs) that determines the aggregated embedding vector for the target node according to data of the relevant neighborhood of the target node.

    EFFICIENT CONVOLUTIONAL NETWORK FOR RECOMMENDER SYSTEMS

    公开(公告)号:US20190286752A1

    公开(公告)日:2019-09-19

    申请号:US16101184

    申请日:2018-08-10

    Abstract: Systems and methods for generating embeddings for nodes of a corpus graph are presented. The embeddings correspond to aggregated embedding vectors for nodes of the corpus graph. Without processing the entire corpus graph to generate all aggregated embedding vectors, a relevant neighborhood of nodes within the corpus graph are identified for a target node of the corpus graph. Based on embedding information of the target node's immediate neighbors, and also upon neighborhood embedding information from the target node's relevant neighborhood, an aggregated embedding vector can be generated for the target node that comprises both an embedding vector portion corresponding to the target node, as well as a neighborhood embedding vector portion, corresponding to embedding information of the relevant neighborhood of the target node. Utilizing both portions of the aggregated embedding vector leads to improved content recommendation to a user in response to a query.

Patent Agency Ranking