2013
DOI: 10.5120/13555-1393
|View full text |Cite
|
Sign up to set email alerts
|

Mining Positive and Negative Association Rule from Frequent and Infrequent Pattern based on IMLMS_GA

Abstract: 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 rule… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…W 1 and W 2 are weights. By swapping out certain transactions for their offspring that have the most accessible data items, the system reduces the amount of lost rules and ghost rules [46][47][48][49]. Additional details on the use of machine learning methods for privacy-preserving data mining in IoTbased healthcare applications and vehicular cloud network settings are provided in the most recent references [50][51][52][53][54][55][56][57][58][59].…”
Section: Genetic Algorithm-based Data Sanitizationmentioning
confidence: 99%
“…W 1 and W 2 are weights. By swapping out certain transactions for their offspring that have the most accessible data items, the system reduces the amount of lost rules and ghost rules [46][47][48][49]. Additional details on the use of machine learning methods for privacy-preserving data mining in IoTbased healthcare applications and vehicular cloud network settings are provided in the most recent references [50][51][52][53][54][55][56][57][58][59].…”
Section: Genetic Algorithm-based Data Sanitizationmentioning
confidence: 99%
“…The fitness function should be tailored to the particular search areas; consequently, the fitness function used is critical for obtaining the required results. It is well established that the rule is more effective when 𝑁𝑁 π‘Žπ‘Ž and 𝑁𝑁 𝑑𝑑 are greater than 𝑁𝑁 𝑏𝑏 and 𝑁𝑁 𝑐𝑐 [42] [46].…”
Section: Phase 1: Extracting Optimized Negative Rulesmentioning
confidence: 99%
“…𝐢𝐢𝐢𝐢𝐢𝐢𝐢𝐢 = {𝑁𝑁 π‘Žπ‘Ž /(𝑁𝑁 π‘Žπ‘Ž + 𝑁𝑁 𝑏𝑏 )} (5) Fitness = (CF * 𝐢𝐢𝐢𝐢𝐢𝐢𝐢𝐢) (6) In this scenario, the system encodes the rules using the same form as in [46]. The best of the new solutions is then chosen for further testing using Tabu restrictions and aspiration criteria.…”
Section: Phase 1: Extracting Optimized Negative Rulesmentioning
confidence: 99%
See 1 more Smart Citation