Frequent Closed Itemset Mining Using Prefix Graphs

@inproceedings{Moonesinghe2006FrequentCI,
  title={Frequent Closed Itemset Mining Using Prefix Graphs},
  author={H. D. K. Moonesinghe and Samah Jamal Fodeh and Pang-Ning Tan},
  year={2006}
}
This paper presents PGMiner, a novel graph-based algorithm for mining frequent closed itemsets. Our approach consists of constructing a prefix graph structure and decomposing the database to variable length bit vectors, which are assigned to nodes of the graph. The main advantage of this representation is that the bit vectors at each node are relatively shorter than those produced by existing vertical mining methods. This facilitates fast frequency counting of itemsets via intersection… CONTINUE READING