Citation
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
Abstract
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.
Download File
Full text not available from this repository.
Official URL or Download Paper: https://www.tandfonline.com/doi/abs/10.1080/002071...
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Computer Science and Information Technology |
| DOI Number: | https://doi.org/10.1080/0020716031000112376 |
| Publisher: | Informa UK Limited |
| Keywords: | Association rules; Data mining; Frequent patterns; Market basket analysis |
| Depositing User: | Ms. Nuraida Ibrahim |
| Date Deposited: | 03 Mar 2025 08:05 |
| Last Modified: | 03 Mar 2025 08:05 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1080/0020716031000112376 |
| URI: | http://psasir.upm.edu.my/id/eprint/115364 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |