http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11526673-B2

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_53f347c8f604f15767e8e73fec62095a
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N5-022
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F40-237
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N5-01
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F40-295
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N3-045
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F40-30
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N3-048
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F40-279
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N3-044
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F40-295
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06N5-02
filingDate 2021-01-20-04:00^^<http://www.w3.org/2001/XMLSchema#date>
grantDate 2022-12-13-04:00^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_d0946f71f04e2ff129649b0da81b82c3
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_fd9cdbc40967fe5e8989d7adc833a5f6
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_12ea6a4f7422dfa721e3c743305fceb5
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_2dc44005b2075c94344ec15138125862
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_712115f6300cd1da502bfaefe8dafa19
publicationDate 2022-12-13-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber US-11526673-B2
titleOfInvention Named entity disambiguation using entity distance in a knowledge graph
abstract According to an embodiment, a method includes converting a knowledge base into a graph. In this embodiment, the knowledge base contains a plurality of entities and specifies a plurality of relationships among the plurality of entities, and entities in the knowledge base correspond to vertices in the graph, and relationships between entities in the knowledge base correspond to edges between vertices in the graph. The method may also include extracting a plurality of vertex embeddings from the graph. An example vertex embedding of the plurality of vertex embeddings represents, for a particular vertex, a proximity of the particular vertex to other vertices of the graph. Further, the method may include performing, based at least in part on the plurality of vertex embeddings, entity linking between input text and the knowledge base.
priorityDate 2019-04-23-04:00^^<http://www.w3.org/2001/XMLSchema#date>
type http://data.epo.org/linked-data/def/patent/Publication

Incoming Links

Predicate Subject
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11205050-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-10902203-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-2020342055-A1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-2021142008-A1
isDiscussedBy http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID415781046
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID86122

Total number of triples: 31.