http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-115359844-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_5f2c23a543ebe192f369de8d3d8d9180 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G16B30-20 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G16B30-10 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G16B40-00 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G16B40-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G16B30-20 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G16B30-10 |
| filingDate | 2022-04-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_49db3b104935f066c0dad178760b6424 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_32a4ccda6d3681f9037e38c547621c82 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_788c8303f607700234200e01a5dc5af7 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_75d1b01bae3e6233ca3ba1b9c51badf8 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_eab411299538984d80e2111a9730e5ee http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_47ed8c673ba90ec7decb0e9fc1a3bd15 |
| publicationDate | 2022-11-18-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-115359844-A |
| titleOfInvention | Negative Sequence Pattern Mining Method with No Overlapping Condition |
| abstract | The invention is a negative sequence pattern mining method without overlapping conditions. The mining method uses pattern growth to reduce the negative candidate pattern search space, uses the network tree to calculate the support degree of the negative candidate sequence pattern with gap constraints without overlapping conditions, and adopts depth-first and backtracking strategy to reduce time complexity and space complexity; negative sequence mode needs to meet two conditions: first, no continuous negative elements are allowed; second, the beginning and end elements cannot be negative elements. This method realizes the mining of negative sequence patterns without overlapping conditions. Through the effective pruning strategy, it not only overcomes the problem of high computational complexity of the support degree of negative sequence candidate patterns, but also overcomes the problem that the search space of negative sequence candidate patterns is too large. problems and ensure the completeness of the algorithm. |
| priorityDate | 2021-04-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/substance/SID408106478 http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID13214 |
Total number of triples: 22.