Qibing Qin

  • Citations Per Year
Learn More
N-list and B-list have simply been proven to be highly effective for mining frequent itemsets. The main problem of the two novel structures is that they both need to encode each node of pre-order (or start order) and post-order (or finish order) code. This causes excessive memory consumption to mine frequent itemsets. In this paper, we propose SO-Sets based(More)
  • 1