Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov. Mining Top-K Frequent Closed Patterns without Minimum Support. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan. pages 211-218, IEEE Computer Society, 2002. [doi]
@inproceedings{HanWLT02,
title = {Mining Top-K Frequent Closed Patterns without Minimum Support},
author = {Jiawei Han and Jianyong Wang and Ying Lu and Petre Tzvetkov},
year = {2002},
url = {http://computer.org/proceedings/icdm/1754/17540211abs.htm},
researchr = {https://researchr.org/publication/HanWLT02},
cites = {0},
citedby = {0},
pages = {211-218},
booktitle = {Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan},
publisher = {IEEE Computer Society},
isbn = {0-7695-1754-4},
}