A Comparative Study of FP-growth Variations
Finding frequent itemsets in databases is crucial in data mining for purpose of extracting association rules. Many algorithms were developed to find those frequent itemsets. This paper presents a summarization and a comparative study of the available FP-growth algorithm variations produced for minin...
| Main Authors: | , , |
|---|---|
| Format: | Citation Index Journal |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/794/ http://scholars.utp.edu.my/id/eprint/794/1/20090535.pdf |
| _version_ | 1848659039654772736 |
|---|---|
| author | Aiman Moyaid, Said P.D.D., Dominic Azween, Abdullah |
| author_facet | Aiman Moyaid, Said P.D.D., Dominic Azween, Abdullah |
| author_sort | Aiman Moyaid, Said |
| building | UTP Institutional Repository |
| collection | Online Access |
| description | Finding frequent itemsets in databases is crucial in data mining for purpose of extracting association rules. Many algorithms were developed to find those frequent itemsets. This paper presents a summarization and a comparative study of the available FP-growth algorithm variations produced for mining frequent itemsets showing their capabilities and efficiency in terms of time and memory consumption. |
| first_indexed | 2025-11-13T07:24:05Z |
| format | Citation Index Journal |
| id | oai:scholars.utp.edu.my:794 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:24:05Z |
| publishDate | 2009 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:7942017-01-19T08:25:35Z http://scholars.utp.edu.my/id/eprint/794/ A Comparative Study of FP-growth Variations Aiman Moyaid, Said P.D.D., Dominic Azween, Abdullah QA75 Electronic computers. Computer science Finding frequent itemsets in databases is crucial in data mining for purpose of extracting association rules. Many algorithms were developed to find those frequent itemsets. This paper presents a summarization and a comparative study of the available FP-growth algorithm variations produced for mining frequent itemsets showing their capabilities and efficiency in terms of time and memory consumption. 2009 Citation Index Journal PeerReviewed application/pdf en cc_public_domain http://scholars.utp.edu.my/id/eprint/794/1/20090535.pdf Aiman Moyaid, Said and P.D.D., Dominic and Azween, Abdullah (2009) A Comparative Study of FP-growth Variations. [Citation Index Journal] |
| spellingShingle | QA75 Electronic computers. Computer science Aiman Moyaid, Said P.D.D., Dominic Azween, Abdullah A Comparative Study of FP-growth Variations |
| title | A Comparative Study of FP-growth Variations |
| title_full | A Comparative Study of FP-growth Variations |
| title_fullStr | A Comparative Study of FP-growth Variations |
| title_full_unstemmed | A Comparative Study of FP-growth Variations |
| title_short | A Comparative Study of FP-growth Variations |
| title_sort | comparative study of fp-growth variations |
| topic | QA75 Electronic computers. Computer science |
| url | http://scholars.utp.edu.my/id/eprint/794/ http://scholars.utp.edu.my/id/eprint/794/1/20090535.pdf |