Data Mining helps to reveal very important patterns and associations in large databases. Discovering these associations is very important to decision makers. Many organizations have multiple distributed databases and it is important to discover and maintain its association rule. Any update in the database requires starting the whole mining process again to generate new rules. This requires rescanning the whole database to maintain rules. This paper presents an efficient approach to reduce the time of incremental mining for association rules in distributed databases. The proposed approach is Apriori based distributed formulation on message passing interface. It uses the concept of pre large concept to help in reducing the cost of incremental mining. Experiments prove that our proposed incremental approach is much efficient than existing approaches. We present comparative analysis between the proposed approach and existing approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.