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 Press
2002
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/34764/ http://psasir.upm.edu.my/id/eprint/34764/1/Compact%20structure%20representation%20in%20discovering%20frequent%20patterns%20for%20association%20rules.pdf |
| _version_ | 1848847864962220032 |
|---|---|
| author | Mustapha, Norwati Sulaiman, Md. Nasir Othman, Mohamed Selamat, Mohd Hasan |
| author_facet | Mustapha, Norwati Sulaiman, Md. Nasir Othman, Mohamed Selamat, Mohd Hasan |
| author_sort | Mustapha, Norwati |
| building | UPM Institutional Repository |
| collection | Online Access |
| 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 | 2025-11-15T09:25:23Z |
| format | Article |
| id | upm-34764 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T09:25:23Z |
| publishDate | 2002 |
| publisher | Universiti Utara Malaysia Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-347642016-10-10T04:29:07Z http://psasir.upm.edu.my/id/eprint/34764/ Compact structure representation in discovering frequent patterns for association rules Mustapha, Norwati Sulaiman, Md. Nasir Othman, Mohamed Selamat, Mohd Hasan 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 Press 2002 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/34764/1/Compact%20structure%20representation%20in%20discovering%20frequent%20patterns%20for%20association%20rules.pdf Mustapha, Norwati and Sulaiman, Md. Nasir and Othman, Mohamed and Selamat, Mohd Hasan (2002) Compact structure representation in discovering frequent patterns for association rules. Journal of Information and Communication Technology, 1 (1). pp. 19-31. ISSN 1675-414X; ESSN: 2180-3862 http://www.jict.uum.edu.my/index.php/previous-issues/127-vol-1-no-1-june-2002 |
| spellingShingle | Mustapha, Norwati Sulaiman, Md. Nasir Othman, Mohamed Selamat, Mohd Hasan 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 |
| url | http://psasir.upm.edu.my/id/eprint/34764/ http://psasir.upm.edu.my/id/eprint/34764/ http://psasir.upm.edu.my/id/eprint/34764/1/Compact%20structure%20representation%20in%20discovering%20frequent%20patterns%20for%20association%20rules.pdf |