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

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_5e857fa7cf3d41ba414cf626b8caa8d5
classificationCPCAdditional http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N20-10
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N20-20
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06Q10-04
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-15
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N7-00
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-18
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N5-01
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06Q10-00
filingDate 2016-05-10-04:00^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_46c67ba7ef45ee7b240450266fa50d06
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_833bca8bb8f99f1b58433b903d5535d7
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_0df068bc7002e3da688ac0afea87ff59
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_5479ae769256be51a1b2e39c7f1b0ddc
publicationDate 2017-09-28-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber WO-2017161646-A1
titleOfInvention Method for dynamically selecting optimal model by three-layer association for large data volume prediction
abstract A method for dynamically selecting an optimal model by three-layer association for large data volume prediction, including three layers, namely, a prediction model algorithm library, a weight algorithm library, an optimal weight algorithm selection algorithm, the prediction model algorithm library is the lowest layer, the weight algorithm library is arranged above the prediction algorithm model library, and the optimal weight algorithm selection algorithm is arranged above the weight algorithm library. In the method for dynamically selecting the optimal model by three-layer association for large data volume prediction, the three-layer structure has four features, that is, high expandability, prediction stability, dynamic adjustment of the model, and the non-difference of the predicted data to the model. The method uses an association algorithm to avoid the shortcomings of common algorithms, by using a method of giving a plurality of model weights, a plurality of algorithms are organically combined together, the optimal algorithm is given with a higher weight, and a relatively poor algorithm is given with a lower weight, the method ensures not only the accuracy of data prediction, but also the stability of prediction after the data length increases.
priorityDate 2016-03-23-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/compound/CID4235
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419493476

Total number of triples: 22.