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

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_8bb531ac161ea927fd276b48f26bc7af
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-2431
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2458
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-213
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-251
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N20-00
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06Q30-02
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2474
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-22
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-23213
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-2163
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06Q30-0202
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N5-01
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06Q30-02
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-2458
filingDate 2018-05-10-04:00^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_fff2c68e2f9969f355e8bbd336ee1332
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_6f9cefa15db7d08f63f0a22bdabd58c8
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_53b9307daf6f412665353490918eaf6c
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_27c1e3be46b147275222f053c63e41f1
publicationDate 2019-07-16-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber CN-110019420-A
titleOfInvention A kind of data sequence prediction method and computing device
abstract Embodiments of the present invention provide a data sequence prediction method and computing device, the method comprising: calculating a similarity distance between each of the N objects according to historical data sequences of N objects, to obtain a similarity distance set, Wherein, the similarity distance is used to represent the similarity degree of two objects, the historical data sequence includes a plurality of data arranged according to a preset rule, and N is a positive integer greater than 1; according to the similarity distance set, clustering The algorithm divides the N objects into K prediction object classes, where K is a positive integer, and K≤N; and predicts the future data sequence of objects included in at least one prediction object class in the K prediction object classes. By implementing the embodiment of the present invention, the prediction object class is automatically defined through the clustering algorithm, which is efficient and more accurate.
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111210071-A
priorityDate 2018-05-10-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/anatomy/ANATOMYID99490
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID99490
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID4235
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419493476

Total number of triples: 31.