Tracing Significant Association Rules Using Critical Least Association Rules Model
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 frequen...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Inderscience Publishers
2013
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/6581/1/Tracing_Significant_Association_Rules_Using_Critical_Least_Association_Rules_Model.pdf http://umpir.ump.edu.my/id/eprint/6581/ http://dx.doi.org/10.1504/IJICA.2013.052350 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1831521994016817152 |
|---|---|
| author | Zailani, Abdullah Tutut, Herawan Mustafa, Mat Deris |
| author_facet | Zailani, Abdullah Tutut, Herawan Mustafa, Mat Deris |
| author_sort | Zailani, Abdullah |
| building | UMPSA Library |
| collection | Institutional Repository |
| content_provider | Universiti Malaysia Pahang Al-Sultan Abdullah |
| content_source | UMPSA Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | 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. |
| format | Article |
| id | my.ump.umpir.6581 |
| institution | Universiti Malaysia Pahang |
| language | en |
| publishDate | 2013 |
| publisher | Inderscience Publishers |
| record_format | eprints |
| spelling | my.ump.umpir.65812016-07-14T01:43:29Z http://umpir.ump.edu.my/id/eprint/6581/ Tracing Significant Association Rules Using Critical Least Association Rules Model Zailani, Abdullah Tutut, Herawan Mustafa, Mat Deris QA76 Computer software 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. Inderscience Publishers 2013 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/6581/1/Tracing_Significant_Association_Rules_Using_Critical_Least_Association_Rules_Model.pdf Zailani, Abdullah and Tutut, Herawan and Mustafa, Mat Deris (2013) Tracing Significant Association Rules Using Critical Least Association Rules Model. International Journal of Innovative Computing and Applications, 5 (1). pp. 3-17. ISSN 1751-648X (Print); 1751-6498 (Online). (Published) http://dx.doi.org/10.1504/IJICA.2013.052350 DOI: 10.1504/IJICA.2013.052350 |
| spellingShingle | QA76 Computer software Zailani, Abdullah Tutut, Herawan Mustafa, Mat Deris Tracing Significant Association Rules Using Critical Least Association Rules Model |
| title | Tracing Significant Association Rules Using Critical Least Association Rules Model |
| title_full | Tracing Significant Association Rules Using Critical Least Association Rules Model |
| title_fullStr | Tracing Significant Association Rules Using Critical Least Association Rules Model |
| title_full_unstemmed | Tracing Significant Association Rules Using Critical Least Association Rules Model |
| title_short | Tracing Significant Association Rules Using Critical Least Association Rules Model |
| title_sort | tracing significant association rules using critical least association rules model |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/6581/1/Tracing_Significant_Association_Rules_Using_Critical_Least_Association_Rules_Model.pdf http://umpir.ump.edu.my/id/eprint/6581/ http://dx.doi.org/10.1504/IJICA.2013.052350 |
| url_provider | http://umpir.ump.edu.my/ |