A Compact FP-Tree for Fast Frequent Pattern Retrieval

Tri Thanh Nguyen. A Compact FP-Tree for Fast Frequent Pattern Retrieval. In Proceedings of the 27th Pacific Asia Conference on Language, Information and Computation, PACLIC 27, Taipei, Taiwan, November 21-24, 2013. National Chengchi University, Taiwan, 2013. [doi]

@inproceedings{Nguyen13-19,
  title = {A Compact FP-Tree for Fast Frequent Pattern Retrieval},
  author = {Tri Thanh Nguyen},
  year = {2013},
  url = {http://aclweb.org/anthology/Y/Y13/Y13-1045.pdf},
  researchr = {https://researchr.org/publication/Nguyen13-19},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the 27th Pacific Asia Conference on Language, Information and Computation, PACLIC 27, Taipei, Taiwan, November 21-24, 2013},
  publisher = {National Chengchi University, Taiwan},
}