An OpenCL Candidate Slicing Frequent Pattern Mining Algorithm on Graphic Processing Units

Chung-Hua University Repository > 資訊學院 > 資訊工程學系 > 研討會論文 > Item 987654321/32725

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://chur.chu.edu.tw/handle/987654321/32725

题名:	An OpenCL Candidate Slicing Frequent Pattern Mining Algorithm on Graphic Processing Units
作者:	歐陽雯 Ouyang, Wen
贡献者:	資訊工程學系 Computer Science & Information Engineering
关键词:	frequent pattern mining;parallel processing;graphic processing unit (GPU);OpenCL
日期:	2011
上传时间:	2014-06-27 02:02:23 (UTC+8)
摘要:	Frequent pattern mining (FPM) is important in data mining field with Apriori algorithm to be one of the commonly used approaches to solve it. However, Aprori algorithm encounters an issue that the computation time increases dramatically when data size inc
显示于类别:	[資訊工程學系] 研討會論文

文件中的档案:

档案	描述	大小	格式	浏览次数
s_e331_0631.pdf		29Kb	Adobe PDF	92	检视/开启

在CHUR中所有的数据项都受到原著作权保护.