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 122
- Downloads 0
Using FDD for Small Project: An Empirical Case Study
Empirical analysis evaluates the proposed system via practical experience and reveals its pros and cons. Such type of evaluation is one of the widely used validation approach in software engineering. Conventional softwar...
Double Authentication Model using Smartphones to Enhance Student on-Campus Network Access
Computers are widely used by all universities to provide network access to students. Therefore, the securities of these computers play a major role in protecting the network. In light of that, a strong access control is...
Expectation-Maximization Algorithms for Obtaining Estimations of Generalized Failure Intensity Parameters
This paper presents several iterative methods based on Stochastic Expectation-Maximization (EM) methodology in order to estimate parametric reliability models for randomly lifetime data. The methodology is related to Max...
Flow-Length Aware Cache Replacement Policy for Packet Processing Cache
Recent core routers are required to process packets not only at high throughput but also with low power consumption due to the increase in the network traffic amount. Packet processing cache (PPC) is one of the effective...
Containing a Confused Deputy on x86: A Survey of Privilege Escalation Mitigation Techniques
The weak separation between user- and kernelspace in modern operating systems facilitates several forms of privilege escalation. This paper provides a survey of protection techniques, both cutting-edge and time-tested, u...