conference-paper Open access

Minimum Monotonous Constraint Closure Hadoop Parallel Association Rules Under Big Data Environment

Research footprint

At a glance

Citations
0
References
4
Comments
0
Paper overview

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.

Record transparency

Publication details

DOI
10.2991/iccmcee-15.2015.144
OpenAlex
W2175250400
Document type
conference-paper
Language
EN
Last metadata update
Community

Comments

Log in to join the discussion.

  1. No comments yet. Start the discussion.