关键词: 数据挖掘, 否定粗糙关联规则, MapReduce, Apriori算法

Abstract: To solve the problem that a large number of candidate item sets were generated when dealing with the big data of Apriori association rules,and the negative relationships behind frequent items could not be given in big data,By combining with the principle of Boolean matrix and applying classification of rough set and MapReduce parallel programming model,an algorithm for rough association rules with negation using MapReduce was put forward to deal with negative relation of the massive data .The experimental results demonstrated that the proposed parallel algorithm was effective and fits to reveal the negative relationships behind the massive data.

Key words: data mining, rough association rules with negation, MapReduce, Apriori algorithm