Kai Chen. Mining Frequent Closed Itemsets Without Candidate Generation. In Yi Pan, Daoxu Chen, Minyi Guo, Jiannong Cao, Jack Dongarra, editors, Parallel and Distributed Processing and Applications, Third International Symposium, ISPA 2005, Nanjing, China, November 2-5, 2005, Proceedings. Volume 3758 of Lecture Notes in Computer Science, pages 668-677, Springer, 2005. [doi]
@inproceedings{Chen05:23,
title = {Mining Frequent Closed Itemsets Without Candidate Generation},
author = {Kai Chen},
year = {2005},
doi = {10.1007/11576235_68},
url = {http://dx.doi.org/10.1007/11576235_68},
researchr = {https://researchr.org/publication/Chen05%3A23},
cites = {0},
citedby = {0},
pages = {668-677},
booktitle = {Parallel and Distributed Processing and Applications, Third International Symposium, ISPA 2005, Nanjing, China, November 2-5, 2005, Proceedings},
editor = {Yi Pan and Daoxu Chen and Minyi Guo and Jiannong Cao and Jack Dongarra},
volume = {3758},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-29769-3},
}