Tracing significant association rules using critical least association rules model
by Zailani Abdullah; Tutut Herawan; Mustafa Mat Deris
International Journal of Innovative Computing and Applications (IJICA), Vol. 5, No. 1, 2013

Abstract: Mining of least association rules from large databases has received a great attention in knowledge discovery. These rules are very useful especially in tracing the unexceptional events or situations. Until this moment, the ratio of studies in this area is still unbalanced as compared to mine frequent rules. The difficulties level of mining these rules as compared to frequent rules are different since it involves with the excessive in computational costs, rather complicated and entailed a dedicated measurement. Therefore, this paper proposed an efficient model called critical least association rule (CLAR) to mine the significant rules so called critical least association rules. Several experiments with real and UCI datasets has shown that the CLAR successfully in producing the critical least association rules, up to 1.5 times faster and less 96% complexity than benchmarked FP-growth algorithm.

Online publication date: Thu, 31-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com