A new method for mining maximal frequent itemsets

Citation

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. .

Abstract

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.

Download File

Preview

Text (Abstract)
A new method for mining maximal frequent itemsets.pdf
Download (33kB) | Preview

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Computer Science and Information Technology
DOI Number:	https://doi.org/10.1109/ITSIM.2008.4631691
Publisher:	IEEE
Keywords:	Mining maximal frequent itemsets; PC_Tree; PC_Miner algorithm
Depositing User:	Nabilah Mustapa
Date Deposited:	10 Jun 2019 02:45
Last Modified:	10 Jun 2019 02:45
Altmetrics:	http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1109/ITSIM.2008.4631691
URI:	http://psasir.upm.edu.my/id/eprint/68672
Statistic Details:	View Download Statistic

Actions (login required)

View Item