Efficient approach to mine frequent closed itemsets and their lattice structure.
We propose a new memory efficient dynamic superset bit-vector (DSBV) structure.
New candidate pruning techniques are developed.
DSBV establishes hierarchical subset-superset relationship of itemset lattice.
Extensive experiments to show scalability and supremacy of our proposed approach.