作者: Muhammad Imran Razzak , Muhammad Imran , Guandong Xu
DOI: 10.1007/S00521-019-04095-Y
关键词:
摘要: … To relieve the sequential bottlenecks, parallel frequent-pattern discovery algorithms exploit parallel and distributed computing resources. FP-growth counts item occurrence and stores …