Minimum Monotonous Constraint Closure Hadoop Parallel Association Rules Under Big Data Environment
PROCEEDINGS OF THE 2015 4TH INTERNATIONAL CONFERENCE ON COMPUTER, MECHATRONICS, CONTROL AND ELECTRONIC ENGINEERING (ICCMCEE 2015)(2015)
Abstract
Aiming at the lager rule redundancy problems in traditional association rules, this article proposes minimum monotonous constraint closure Hadoop parallel association rules. First, basing on closure operator constraint rule equivalence relation set, this article gives satisfying minimum monotonous constraint rule set which can effectively divide the constraint rule set into disjoint equivalence rule class to reduce the rate of redundancy rule. Second, aiming at the big data problems, this article adopts Mapreduce parallel computation model under Hadoop framework to realize the parallelization computation of minimum monotonous constraint association rules which effectively promote the expansibility of algorithm to big data treatment. At last, through experimental comparison on standard test set, this article shows the effectiveness of the proposed algorithm.
MoreTranslated text
Key words
Big Data,Closure Operator,Minimum Monotonous Constraint,Hadoop Framework
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined