http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2019118388-A1

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_d9ae7582c5f887bc2e8f656b4e0fc52a
classificationCPCAdditional http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N3-084
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N3-045
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-951
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-90335
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N20-20
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-9024
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2365
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24542
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06Q50-01
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-9536
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-56
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-901
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-9536
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06N3-08
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-33
filingDate 2018-12-11-04:00^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_d156e6bc7c74c2bfdb55fb599e41fbb0
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_6767a9cfc823a92886f88e7d2e8daa3d
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_8157252186398d1d07d0e8cd41600e14
publicationDate 2019-06-20-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber WO-2019118388-A1
titleOfInvention Fast indexing with graphs and compact regression codes on online social networks
abstract In one embodiment, a method Includes receiving a query comprising a query content object and constraints, generating a feature vector representing the query content object accessing a sparse graph comprising nodes corresponding to candidate content objects represented by compact codes and links connecting the nodes, selecting an entry node, selecting similar content objects iteratively by identifying linked nodes of the entry node, decompressing the compact codes representing candidate content objects to generate feature vectors, selecting zero or more similar content objects based on a comparison between the feature vector representing the query content object and the feature vectors representing the candidate content objects, returning the selected similar content objects if a completion condition is satisfied, else repeating the iterative selection by rising a linked node corresponding to a most similar content object as the entry node, and sending instructions for presenting one or more of the selected similar content objects.
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2021159681-A1
priorityDate 2017-12-11-04:00^^<http://www.w3.org/2001/XMLSchema#date>
type http://data.epo.org/linked-data/def/patent/Publication

Incoming Links

Predicate Subject
isDiscussedBy http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419533778
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID2118
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ8WZ42
http://rdf.ncbi.nlm.nih.gov/pubchem/gene/GID22138
http://rdf.ncbi.nlm.nih.gov/pubchem/gene/GID38590
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID3486
http://rdf.ncbi.nlm.nih.gov/pubchem/gene/GID7273
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419506932
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID19518
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID3957
http://rdf.ncbi.nlm.nih.gov/pubchem/anatomy/ANATOMYID3486
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ01819
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCA2ASS6
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID51239
http://rdf.ncbi.nlm.nih.gov/pubchem/anatomy/ANATOMYID9929
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID453499720
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID9929
http://rdf.ncbi.nlm.nih.gov/pubchem/anatomy/ANATOMYID51239

Total number of triples: 45.