The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Metadata Harvesting (OAI2)
  • Digital Archiving Policy

IJACSA

  • About the Journal
  • Call for Papers
  • Author Guidelines
  • Fees/ APC
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Editors
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving
  • Editorial Board

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors

Computing Conference 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys) 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC) 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future of Information and Communication Conference (FICC) 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Guidelines
  • Fees
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Editors
  • Reviewers
  • Subscribe

Article Details

Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules

Author 1: Ahmed Abdul-WahabAl-Opahi
Author 2: Basheer Mohamad Al-Maqaleh

Download PDF

Digital Object Identifier (DOI) : 10.14569/IJACSA.2015.060623

Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 6 Issue 6, 2015.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

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.

Keywords: Association rule mining; negative rule and positive rules; frequent and infrequent pattern set; apriori algorithm

Ahmed Abdul-WahabAl-Opahi and Basheer Mohamad Al-Maqaleh, “An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules” International Journal of Advanced Computer Science and Applications(IJACSA), 6(6), 2015. http://dx.doi.org/10.14569/IJACSA.2015.060623

@article{Abdul-WahabAl-Opahi2015,
title = {An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2015.060623},
url = {http://dx.doi.org/10.14569/IJACSA.2015.060623},
year = {2015},
publisher = {The Science and Information Organization},
volume = {6},
number = {6},
author = {Ahmed Abdul-WahabAl-Opahi and Basheer Mohamad Al-Maqaleh}
}


IJACSA

Upcoming Conferences

Future of Information and Communication Conference (FICC) 2021

29-30 April 2021

  • Virtual

Computing Conference 2021

15-16 July 2021

  • London, United Kingdom

IntelliSys 2021

2-3 September 2021

  • Amsterdam, The Netherlands

Future Technologies Conference (FTC) 2021

28-29 October 2021

  • Vancouver, Canada
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© 2018 The Science and Information (SAI) Organization Limited. Registered in England and Wales. Company Number 8933205. All rights reserved. thesai.org