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, N., Sulaiman, M.N., Othman, M., Selamat, M.H. |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Utara Malaysia
2002
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/377/1/N.Mustapha.pdf |
Similar Items
-
Compact structure representation in discovering frequent patterns for association rules
by: Mustapha, Norwati, et al.
Published: (2002) -
A Scalable Algorithm for Constructing Frequent Pattern Tree
by: Noraziah, Ahmad, et al.
Published: (2014) -
Development of a compact linguistic rules-tree (CLR-Tree) : the first phase.
by: Khokhar, Rashid Hafeez, et al.
Published: (2003) -
A simulation study of data discovery mechanism for scientific data grid environment
by: Abdullah, Azizol, et al.
Published: (2004) -
A review on structured scheme representation on data security application
by: Mohd Salleh, Siti Norussaadah, et al.
Published: (2018)