http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109974732-A

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_a864329f69db5da3ce856121f76fe371
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G01C21-3476
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-901
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-903
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G01C21-34
filingDate 2019-03-28-04:00^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_c9defa4c443c7554e65de8df7fbaeb19
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_0f08791896acd9c8792a55cc35f9015f
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_4e318d7011b944a306c3d7c055edfd5d
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_a2b24856bf5153ec86e47fffb6e28b76
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_fb8d15fdfede05967fa43796f1854702
publicationDate 2019-07-05-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber CN-109974732-A
titleOfInvention A Semantic Awareness-Based Top-k Multi-Request Path Planning Method
abstract The invention discloses a Top-k multi-request path planning method based on semantic perception, which searches the top k shortest paths covering all keywords according to the query keywords of users. This method takes into account the relationship between POI (Point of Interest) and user requests, especially when a single POI can satisfy multiple requests from users; establish a priority relationship for search keywords, and query high-level keywords first. The keywords that do not have a priority relationship are randomly queried, which realizes the overall disordered and partially ordered keyword query and enables the nearest neighbor query. In this process, the semantic difference compensation distance, the actual distance and the possible extension distance in the future are comprehensively considered. A new formula is used to determine the nearest neighbor distance.
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-113361788-B
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-113361788-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-112097782-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-113468293-B
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-113468293-A
priorityDate 2019-03-28-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/SID415713197
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID25572

Total number of triples: 24.