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...
Saved in:
Main Authors: | Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H. |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Utara Malaysia
2002
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/377/1/N.Mustapha.pdf http://repo.uum.edu.my/377/ http://jict.uum.edu.my |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Compact structure representation in discovering frequent patterns for association rules
by: Mustapha, Norwati, et al.
Published: (2002) -
Features selection and rule removal for frequent association rule based classification
by: Mohd Shaharanee, Izwan Nizal, et al.
Published: (2013) -
An efficient algorithm to discover large and frequent itemset in high dimensional data
by: Zulkurnain, Nurul Fariza
Published: (2019) -
Frequent Lexicographic Algorithm for Mining Association Rules
by: Mustapha, Norwati
Published: (2005) -
Frequent patterns minning of stock data using hybrid clustering association algorithm
by: B., Baharudin, et al.
Published: (2009)