Patents by Inventor Yong Kun LI

Yong Kun LI has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Graph centrality calculation method and apparatus, and storage medium
    Patent number: 10936765
    Abstract: A graph centrality determining method includes sampling, at least twice, nodes that are sequentially-connected and connection edges between the nodes, in an original graph representing a network structure, to obtain sampled sub-graphs, determining an influence of each of nodes in the sampled sub-graphs, forming a graph centrality determining result of each of the sampled sub-graphs, based on the influence of each of the nodes in the sampled sub-graphs, determining result of each of the sampled sub-graphs, to the original graph, to obtain an influence of each of the nodes in the original graph, clustering the influence of each of the nodes in the original graph, sorting the influence of each of the nodes in the original graph in descending order of a result of the clustering, and obtaining a predetermined quantity of nodes having influences that are top-ranked, in the original graph.
    Type: Grant
    Filed: December 20, 2018
    Date of Patent: March 2, 2021
    Assignee: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED
    Inventors: Rui Wang, Jun Yin, Yong Kun Li, Wei Chen
  • GRAPH CENTRALITY CALCULATION METHOD AND APPARATUS, AND STORAGE MEDIUM
    Publication number: 20190121926
    Abstract: A graph centrality determining method includes sampling, at least twice, nodes that are sequentially-connected and connection edges between the nodes, in an original graph representing a network structure, to obtain sampled sub-graphs, determining an influence of each of nodes in the sampled sub-graphs, forming a graph centrality determining result of each of the sampled sub-graphs, based on the influence of each of the nodes in the sampled sub-graphs, determining result of each of the sampled sub-graphs, to the original graph, to obtain an influence of each of the nodes in the original graph, clustering the influence of each of the nodes in the original graph, sorting the influence of each of the nodes in the original graph in descending order of a result of the clustering, and obtaining a predetermined quantity of nodes having influences that are top-ranked, in the original graph.
    Type: Application
    Filed: December 20, 2018
    Publication date: April 25, 2019
    Applicant: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED
    Inventors: Rui WANG, Jun YIN, Yong Kun LI, Wei CHEN