Association rule mining is one of the most significant tasks in data mining. The essential concept of association rule is to mine the positive patterns from transaction database. But mining the negative patterns has also received the interest of publishers in this region. This paper shows an efficient algorithm (IMLMS-GA) for mining both positive and negative association rules in transaction databases. The goal of this study is to build up a new model for mining negative and positive (PR & NR) association rules out of transaction data sets. The proposed model is based on two models, the MLMS model and the Interesting Multiple Level Minimum Supports (IMLMS) model. This paper proposes a new approach (IMLMS-GA) for mining both negative and positive association rules. The interesting frequent patterns and infrequent patterns mined by the IMLMS-GA algorithm. This algorithm is accomplished in two phase: a. First phase find all frequent patterns & infrequent patterns b. Second phase efficiently generate positive and negative association rule by using useful frequent pattern set. The experimental results prove that the IMLMS-GA can remove the scale of uninteresting association rules and generates better results than the previous positive and negative association rule mining algorithm.
Abstract-Association Rule mining is very efficient technique for finding strong relation between correlated data. The correlation of data gives meaning full extraction process. For the mining of positive and negative rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. A number of algorithms are wonder performance but produce large number of negative association rule and also suffered from multi-scan problem. The idea of this paper is to eliminate these problems and reduce large number of negative rules. Hence we proposed an improved approach to mine interesting positive and negative rules based on genetic and MLMS algorithm. In this method we used a multi-level multiple support of data table as 0 and 1. The divided process reduces the scanning time of database. The proposed algorithm is a combination of MLMS and genetic algorithm. This paper proposed a new algorithm (MIPNAR_GA) for mining interesting positive and negative rule from frequent and infrequent pattern sets. The algorithm is accomplished in to three phases: a).Extract frequent and infrequent pattern sets by using apriori method b).Efficiently generate positive and negative rule. c).Prune redundant rule by applying interesting measures. The process of rule optimization is performed by genetic algorithm and for evaluation of algorithm conducted the real world dataset such as heart disease data and some standard data used from UCI machine learning repository.
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.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.