An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2015, Vol 6, Issue 6
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 discovering frequent items and the mining of positive rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. But these algorithms do not consider negation occurrence of the attribute in them and also these rules are not in infrequent form. The discovery of infrequent itemsets is far more difficult than their counterparts, that is, frequent itemsets. These problems include infrequent itemsets discovery and generation of interest negative association rules, and their huge number as compared with positive association rules. The interesting discovery of association rules is an important and active area within data mining research. In this paper, an efficient algorithm is proposed for discovering interesting positive and negative association rules from frequent and infrequent items. The experimental results show the usefulness and effectiveness of the proposed algorithm.
Authors and Affiliations
Ahmed Abdul-WahabAl-Opahi, Basheer Al-Maqaleh
Keywords
Related Articles
- EP ID EP122226
- DOI 10.14569/IJACSA.2015.060623
- Views 84
- Downloads 0
Efficient Load Balancing Algorithm for the Arrangement-Star Network
The Arrangement-Star is a well-known network in the literature and it is one of the promising interconnection networks in the area of super computing, it is expected to be one of the attractive alternatives in the future...
Face Recognition Using Bacteria Foraging Optimization-Based Selected Features
Feature selection (FS) is a global optimization problem in machine learning, which reduces the number of features, removes irrelevant, noisy and redundant data, and results in acceptable recognition accuracy. This paper...
The Throughput Flow Constraint Theorem and its Applications
The paper states and proves an important result related to the theory of flow networks with disturbed flows:“the throughput flow constraint in any network is always equal to the throughput flow constraint in its dual net...
Integration of REST-Based Web Service and Browser Extension for Instagram Spam Detection
In this paper, a REST-based Web Service developed in previous work was integrated with a newly developed browser extension that works in modern browser (Firefox and Google Chrome) using Greasemonkey. It uses previous col...
A Novel Student Clustering Model for the Learning Simplification in Educational Environments
Students’ clustering is considered to be a method of granting students many different ways of being able to learn by taking into account the student’s degree. The definition of clustering can be “a group of steps that di...