Wednesday 20th of September 2017
 

A new Algorithm for Mining Association Rules Based on Hypothesis Test


Medhat H A Awadalla and Sara G El-Far

Most association rule mining approaches rely on predetermined support and confidence values to find certain relationships among database itemsets. However, specifying minimum support and confidence values of the mined rules in advance often leads to either too many or too few rules, which negatively affects the performance of the overall system. To address this issue, this paper presents a new algorithm based on null hypothesis to find non-coincidental relations among different itemsets in large databases without a prior defined threshold values. Intensive simulated experiments have been performed on different databases to confirm the validity of the suggested algorithm. The obtained results show that there is a significant improvement in the system performance in terms of the number of frequent items used, the number of generated rules, and the run time.

Keywords: Association Rule Mining, Null Hypothesis, Chi Square Test, Non-Coincidental Rules

Download Full-Text


ABOUT THE AUTHORS

Medhat H A Awadalla
SQU/Helwan university

Sara G El-Far
Helwan University


IJCSI Published Papers Indexed By:

 

 

 

 
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »