A new method for mining maximal frequent itemsets
In this paper, we propose a new method for mining maximal frequent itemsets. Our method introduces an efficient database encoding technique, a novel tree structure called PC_Tree and also PC_Miner algorithm. The database encoding technique utilizes Prime number characteristics and transforms each tr...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/68672/ http://psasir.upm.edu.my/id/eprint/68672/1/A%20new%20method%20for%20mining%20maximal%20frequent%20itemsets.pdf |
| _version_ | 1848856193589575680 |
|---|---|
| author | Nadimi-Shahraki, Mohammad-Hossein Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali |
| author_facet | Nadimi-Shahraki, Mohammad-Hossein Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali |
| author_sort | Nadimi-Shahraki, Mohammad-Hossein |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In this paper, we propose a new method for mining maximal frequent itemsets. Our method introduces an efficient database encoding technique, a novel tree structure called PC_Tree and also PC_Miner algorithm. The database encoding technique utilizes Prime number characteristics and transforms each transaction into a positive integer that has all properties of its items. The PC_Tree is a simple tree structure but yet powerful to capture whole of transactions by one database scan. The PC_Miner algorithm traverses the PC_Tree and builds the gcd (greatest common divisor) set of its nodes to mine maximal frequent itemsets. Experiments verify the efficiency and advantages of the proposed method. |
| first_indexed | 2025-11-15T11:37:46Z |
| format | Conference or Workshop Item |
| id | upm-68672 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T11:37:46Z |
| publishDate | 2008 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-686722019-06-10T02:45:50Z http://psasir.upm.edu.my/id/eprint/68672/ A new method for mining maximal frequent itemsets Nadimi-Shahraki, Mohammad-Hossein Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali In this paper, we propose a new method for mining maximal frequent itemsets. Our method introduces an efficient database encoding technique, a novel tree structure called PC_Tree and also PC_Miner algorithm. The database encoding technique utilizes Prime number characteristics and transforms each transaction into a positive integer that has all properties of its items. The PC_Tree is a simple tree structure but yet powerful to capture whole of transactions by one database scan. The PC_Miner algorithm traverses the PC_Tree and builds the gcd (greatest common divisor) set of its nodes to mine maximal frequent itemsets. Experiments verify the efficiency and advantages of the proposed method. IEEE 2008 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/68672/1/A%20new%20method%20for%20mining%20maximal%20frequent%20itemsets.pdf Nadimi-Shahraki, Mohammad-Hossein and Mustapha, Norwati and Sulaiman, Md. Nasir and Mamat, Ali (2008) A new method for mining maximal frequent itemsets. In: 3rd International Symposium on Information Technology (ITSim'08), 26-28 Aug. 2008, Kuala Lumpur, Malaysia. . 10.1109/ITSIM.2008.4631691 |
| spellingShingle | Nadimi-Shahraki, Mohammad-Hossein Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali A new method for mining maximal frequent itemsets |
| title | A new method for mining maximal frequent itemsets |
| title_full | A new method for mining maximal frequent itemsets |
| title_fullStr | A new method for mining maximal frequent itemsets |
| title_full_unstemmed | A new method for mining maximal frequent itemsets |
| title_short | A new method for mining maximal frequent itemsets |
| title_sort | new method for mining maximal frequent itemsets |
| url | http://psasir.upm.edu.my/id/eprint/68672/ http://psasir.upm.edu.my/id/eprint/68672/ http://psasir.upm.edu.my/id/eprint/68672/1/A%20new%20method%20for%20mining%20maximal%20frequent%20itemsets.pdf |