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...

Full description

Saved in:
Bibliographic Details
Main Authors: Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H.
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
Be the first to leave a comment!
You must be logged in first