http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-106021546-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_b05aae42f79a825a3ccd009bce30bf11 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2453 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-9027 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2272 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2246 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 |
| filingDate | 2016-05-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_3fc65c610edc4a7fa6993ef0bd511c95 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_ea7cb52085715ec8897878f147b5974f http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_446a85366e6ba20315f9ad096563782d http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_6b0c294f533aa2ac2bcb66d3b856ae30 |
| publicationDate | 2016-10-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-106021546-A |
| titleOfInvention | Minimum non-reduction association rule mining method based on item subset example tree |
| abstract | The invention discloses a minimum non-reduction association rule mining method based on an item subset example tree. The method comprises the following steps that in an example item database, an item subset is generated by means of union of sets of a closed item set generated by a single item, and the set is a proper subset of a power set of an item set; by means of the generated item subset, an item subset example tree structure of the example item database is constructed; a closed frequent item set and a minimum generating element thereof are mined in a project subset example tree, and according to the mined closed frequent item set and the minimum generating element thereof, minimum non-reduction association rules are rapidly generated. By means of the closed item set generated by a single item, a plurality of item subsets are obtained, an item subset example tree is constructed, the hierarchical relation and the corresponding support degree thereof of the item subset are described, and the searching frequencies between examples and items are effectively reduced; meanwhile, the storage space is effectively reduced, and the mining speed and efficiency of the minimum non-reduction association rules are improved. |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-108475292-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-108475292-A |
| priorityDate | 2016-05-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 27.