Fast discovery of long patterns for association rules
The most time consuming process in discovering association rules is identifying the frequent patterns especially in the cases when the database contains long patterns. An algorithm called Flex for identifying frequent patterns especially efficient when the patterns are long is proposed by successive...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Informa UK Limited
2003
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/115364/ https://www.tandfonline.com/doi/abs/10.1080/0020716031000112376 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Putra Malaysia |
| id |
my.upm.eprints.115364 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.1153642025-03-03T08:05:42Z http://psasir.upm.edu.my/id/eprint/115364/ Fast discovery of long patterns for association rules Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. The most time consuming process in discovering association rules is identifying the frequent patterns especially in the cases when the database contains long patterns. An algorithm called Flex for identifying frequent patterns especially efficient when the patterns are long is proposed by successive construction of the nodes lexicographic tree. The vertical counting strategy to facilitate fast discovery is used in support computation. The experimental result shows that Flex outperform Apriori, a well-known and widely used algorithm for patterns discovery. Informa UK Limited 2003 Article PeerReviewed Mustapha, N. and Sulaiman, M.N. and Othman, M. and Selamat, M.H. (2003) Fast discovery of long patterns for association rules. International Journal of Computer Mathematics, 80 (8). pp. 967-976. ISSN 0020-7160; eISSN: 1029-0265 https://www.tandfonline.com/doi/abs/10.1080/0020716031000112376 10.1080/0020716031000112376 |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| description |
The most time consuming process in discovering association rules is identifying the frequent patterns especially in the cases when the database contains long patterns. An algorithm called Flex for identifying frequent patterns especially efficient when the patterns are long is proposed by successive construction of the nodes lexicographic tree. The vertical counting strategy to facilitate fast discovery is used in support computation. The experimental result shows that Flex outperform Apriori, a well-known and widely used algorithm for patterns discovery. |
| format |
Article |
| author |
Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. |
| spellingShingle |
Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. Fast discovery of long patterns for association rules |
| author_facet |
Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. |
| author_sort |
Mustapha, N. |
| title |
Fast discovery of long patterns for association rules |
| title_short |
Fast discovery of long patterns for association rules |
| title_full |
Fast discovery of long patterns for association rules |
| title_fullStr |
Fast discovery of long patterns for association rules |
| title_full_unstemmed |
Fast discovery of long patterns for association rules |
| title_sort |
fast discovery of long patterns for association rules |
| publisher |
Informa UK Limited |
| publishDate |
2003 |
| url |
http://psasir.upm.edu.my/id/eprint/115364/ https://www.tandfonline.com/doi/abs/10.1080/0020716031000112376 |
| _version_ |
1825810737885347840 |