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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Informa UK Limited
2003
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/115364/ |
| _version_ | 1848866757555519488 |
|---|---|
| author | Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. |
| author_facet | Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. |
| author_sort | Mustapha, N. |
| building | UPM Institutional Repository |
| collection | Online Access |
| 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. |
| first_indexed | 2025-11-15T14:25:41Z |
| format | Article |
| id | upm-115364 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T14:25:41Z |
| publishDate | 2003 |
| publisher | Informa UK Limited |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-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 |
| spellingShingle | Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. Fast discovery of long patterns for association rules |
| title | 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_short | Fast discovery of long patterns for association rules |
| title_sort | fast discovery of long patterns for association rules |
| url | http://psasir.upm.edu.my/id/eprint/115364/ http://psasir.upm.edu.my/id/eprint/115364/ http://psasir.upm.edu.my/id/eprint/115364/ |