http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-103559016-B
Outgoing Links
Predicate | Object |
---|---|
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-38 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-50 |
filingDate | 2013-10-23-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2016-09-07-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationDate | 2016-09-07-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | CN-103559016-B |
titleOfInvention | A kind of Frequent tree mining method for digging based on graphic process unit parallel computation |
abstract | The invention discloses a kind of Frequent tree mining method for digging based on graphic process unit parallel computation, each thread block block is marked off by GPU, frequent limit is evenly distributed and carries out parallel processing to different threads, obtain different extension subgraphs by the rightest extension rightmost, the figure mining data collection that each thread last obtains is returned to each thread block block;Finally, carry out data communication by GPU with internal memory, return result to CPU process.The invention provides a kind of figure method for digging feasible, effective, make the figure under the big data environment of intensity excavate performance to be optimized, improve figure digging efficiency, data message quick, reliable is provided, it is achieved the P mining method on CUDA unified calculation equipment framework for scientific research analysis, market survey etc.. |
priorityDate | 2013-10-23-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: 14.