http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-107016131-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_9adacfe05dd84530a11b19b2559d175c |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-90 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06N20-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-214 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-24 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06N99-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06K9-62 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 |
| filingDate | 2017-05-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_a2357c96809b08730c649fc9a05c0234 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_d1e2640ed8aa8f7a33891cd838376595 |
| publicationDate | 2017-08-04-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-107016131-A |
| titleOfInvention | Machine Learning Algorithm Based on Augmented Clustering and Its Application |
| abstract | The invention relates to a machine learning algorithm based on enhanced clustering, comprising the following steps: analyzing the characteristics of basic data, randomly writing a certain number of feature templates; performing classification tests on the written feature templates to the data obtained online sequentially in a working environment ; Statistical classification test results, preset corresponding classification standards, and process the difference between the maximum value and the average value of the feature template matching success rate. If the difference is not greater than the preset classification standard, it is considered that the selection can meet the target requirements; if If the difference is greater than the preset classification standard, the feature templates are screened; the next set of iterative tests are carried out using the better feature templates screened out; until a certain set of feature templates in the test can meet the maximum value of the matching success rate after processing and If the average difference is not greater than the preset classification standard, it is considered that the selected can meet the target requirements. The algorithm is easy to implement and robust, and can be widely used in real-time online optimization of basic data such as images, texts, and audios. |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109299737-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109299737-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2021151337-A1 |
| priorityDate | 2017-05-19-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/CID3496 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419527204 |
Total number of triples: 22.