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

CHUR > College Computer Science and Informatics > Department of Computer Science and Information Engineering > Seminar Papers > Item 987654321/32725

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/32725

Title:	An OpenCL Candidate Slicing Frequent Pattern Mining Algorithm on Graphic Processing Units
Authors:	歐陽雯 Ouyang, Wen
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	frequent pattern mining;parallel processing;graphic processing unit (GPU);OpenCL
Date:	2011
Issue Date:	2014-06-27 02:02:23 (UTC+8)
Abstract:	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
Appears in Collections:	[Department of Computer Science and Information Engineering] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_e331_0631.pdf		29Kb	Adobe PDF	90	View/Open