Compact structure representation in discovering frequent patterns for association rules
Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. Structure used in typical algorithms for solving this problem operate in several database scans and a large number of candidate generation. This pape...
Main Authors: | Mustapha, Norwati, Sulaiman, Md. Nasir, Othman, Mohamed, Selamat, Mohd Hasan |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Utara Malaysia Press
2002
|
Online Access: | http://psasir.upm.edu.my/id/eprint/34764/1/Compact%20structure%20representation%20in%20discovering%20frequent%20patterns%20for%20association%20rules.pdf |
Similar Items
-
COMPACT STRUCTURE REPRESENTATION IN DISCOVERING FREQUENT PATTERNS FOR ASSOCIATION RULES
by: Norwati Mustapha, et al.
Published: (2022-11-01) -
Compact structure representation in discovering frequent patterns for association rules
by: Mustapha, N., et al.
Published: (2002) -
Frequent Lexicographic Algorithm for Mining Association Rules
by: Mustapha, Norwati
Published: (2005) -
A numerical method for frequent pattern mining
by: Mustapha, Norwati, et al.
Published: (2009) -
Efficient prime-based method for interactive mining of frequent patterns.
by: Mohammad Hossein, Nadimi Shahraki, et al.
Published: (2011)