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: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Utara Malaysia
2002
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/377/1/N.Mustapha.pdf |
| _version_ | 1825739672944377856 |
|---|---|
| author | Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. |
| author_facet | Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. |
| author_sort | Mustapha, N. |
| collection | UUM |
| description | 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 paper presents a compact structure representation called Flex-tree in discovering frequent patterns for association rules. Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. Efficiency of mining is achieved with one scan of database instead of repeated database passes done in other methods and avoid the costly generation of large numbers of candidate sets, which dramatically reduces the search space. |
| first_indexed | 2024-07-04T05:13:15Z |
| format | Article |
| id | uum-377 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T05:13:15Z |
| publishDate | 2002 |
| publisher | Universiti Utara Malaysia |
| record_format | eprints |
| spelling | uum-3772010-08-29T04:13:10Z https://repo.uum.edu.my/id/eprint/377/ Compact structure representation in discovering frequent patterns for association rules Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. QA75 Electronic computers. Computer science 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 paper presents a compact structure representation called Flex-tree in discovering frequent patterns for association rules. Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. Efficiency of mining is achieved with one scan of database instead of repeated database passes done in other methods and avoid the costly generation of large numbers of candidate sets, which dramatically reduces the search space. Universiti Utara Malaysia 2002 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/377/1/N.Mustapha.pdf Mustapha, N. and Sulaiman, M.N. and Othman, M. and Selamat, M.H. (2002) Compact structure representation in discovering frequent patterns for association rules. Journal of ICT, 1 (1). pp. 19-31. ISSN 1675-414X http://jict.uum.edu.my |
| spellingShingle | QA75 Electronic computers. Computer science Mustapha, N. Sulaiman, M.N. Othman, M. Selamat, M.H. Compact structure representation in discovering frequent patterns for association rules |
| title | Compact structure representation in discovering frequent patterns for association rules |
| title_full | Compact structure representation in discovering frequent patterns for association rules |
| title_fullStr | Compact structure representation in discovering frequent patterns for association rules |
| title_full_unstemmed | Compact structure representation in discovering frequent patterns for association rules |
| title_short | Compact structure representation in discovering frequent patterns for association rules |
| title_sort | compact structure representation in discovering frequent patterns for association rules |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/377/1/N.Mustapha.pdf |
| work_keys_str_mv | AT mustaphan compactstructurerepresentationindiscoveringfrequentpatternsforassociationrules AT sulaimanmn compactstructurerepresentationindiscoveringfrequentpatternsforassociationrules AT othmanm compactstructurerepresentationindiscoveringfrequentpatternsforassociationrules AT selamatmh compactstructurerepresentationindiscoveringfrequentpatternsforassociationrules |