Abstract: Big data and parallel computation era have come,and it is a trend to convert serial data mine algorithm into parallel algorithm to take advantage of cheap machine．In this paper two main steps,namely support counting and candidate set generation in serial apriori algorithm,were rebuilt parallelly on CUDA architecture．Meanwhile the difference between various implements of parallel apriori was compared to find a better solution．Finally,the experiments indicate that the time of support counting and candidate set generation decreases 16% and 25% respectively on a data set containing 10000 items.

Key words: Data minint,Association rules,Frequent itemset mining,Parallel agorithm