Using unique-prime-factorization theorem to mine frequent patterns without generating tree
Problem statement: Ffrequent patterns are patterns that appear in a data set frequently. Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. Approach: Most of the previous studies adopt an Apriorilike approa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Science Publications
2011
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/22476/ http://psasir.upm.edu.my/id/eprint/22476/1/ajebasp.2011.58.65.pdf |
| _version_ | 1848844495048671232 |
|---|---|
| author | Tohidi, Hossein Ibrahim, Hamidah |
| author_facet | Tohidi, Hossein Ibrahim, Hamidah |
| author_sort | Tohidi, Hossein |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Problem statement: Ffrequent patterns are patterns that appear in a data set frequently. Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. Approach: Most of the previous studies adopt an Apriorilike approach. For huge database it may need to generate a huge number of candidate sets. An interest solution is to design an approach that without generating candidate is able to mine frequent patterns. Results: An interesting method to frequent pattern mining without generating candidate pattern is called frequent-pattern growth, or simply FP-growth, which adopts a divide-and-conquer strategy as follows. However, for a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution. In this study we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. Our algorithm works based on prime factorization and is called Prime Factor Miner (PFM). Conclusion/Recommendations: This algorithm is able to achieve low memory order at O(1) which is significantly better than FP-growth. |
| first_indexed | 2025-11-15T08:31:49Z |
| format | Article |
| id | upm-22476 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T08:31:49Z |
| publishDate | 2011 |
| publisher | Science Publications |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-224762016-06-10T08:49:10Z http://psasir.upm.edu.my/id/eprint/22476/ Using unique-prime-factorization theorem to mine frequent patterns without generating tree Tohidi, Hossein Ibrahim, Hamidah Problem statement: Ffrequent patterns are patterns that appear in a data set frequently. Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. Approach: Most of the previous studies adopt an Apriorilike approach. For huge database it may need to generate a huge number of candidate sets. An interest solution is to design an approach that without generating candidate is able to mine frequent patterns. Results: An interesting method to frequent pattern mining without generating candidate pattern is called frequent-pattern growth, or simply FP-growth, which adopts a divide-and-conquer strategy as follows. However, for a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution. In this study we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. Our algorithm works based on prime factorization and is called Prime Factor Miner (PFM). Conclusion/Recommendations: This algorithm is able to achieve low memory order at O(1) which is significantly better than FP-growth. Science Publications 2011 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/22476/1/ajebasp.2011.58.65.pdf Tohidi, Hossein and Ibrahim, Hamidah (2011) Using unique-prime-factorization theorem to mine frequent patterns without generating tree. American Journal of Economics and Business Administration, 3 (1). pp. 58-65. ISSN 1945-5488; ESSN: 1945-5496 http://thescipub.com/html/10.3844/ajebasp.2011.58.65 10.3844/ajebasp.2011.58.65 |
| spellingShingle | Tohidi, Hossein Ibrahim, Hamidah Using unique-prime-factorization theorem to mine frequent patterns without generating tree |
| title | Using unique-prime-factorization theorem to mine frequent patterns without generating tree |
| title_full | Using unique-prime-factorization theorem to mine frequent patterns without generating tree |
| title_fullStr | Using unique-prime-factorization theorem to mine frequent patterns without generating tree |
| title_full_unstemmed | Using unique-prime-factorization theorem to mine frequent patterns without generating tree |
| title_short | Using unique-prime-factorization theorem to mine frequent patterns without generating tree |
| title_sort | using unique-prime-factorization theorem to mine frequent patterns without generating tree |
| url | http://psasir.upm.edu.my/id/eprint/22476/ http://psasir.upm.edu.my/id/eprint/22476/ http://psasir.upm.edu.my/id/eprint/22476/ http://psasir.upm.edu.my/id/eprint/22476/1/ajebasp.2011.58.65.pdf |