%0 Conference Paper %1 conf/adma/GuoZZCK05 %A Guo, Ping %A Zhou, Yang %A Zhuang, Jun %A Chen, Ting %A Kang, Yan-Rong %B ADMA %D 2005 %E Li, Xue %E Wang, Shuliang %E Dong, Zhao Yang %I Springer %K dblp %P 96-107 %T An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms. %U http://dblp.uni-trier.de/db/conf/adma/adma2005.html#GuoZZCK05 %V 3584 %@ 3-540-27894-X

@inproceedings{conf/adma/GuoZZCK05, added-at = {2020-08-17T00:00:00.000+0200}, author = {Guo, Ping and Zhou, Yang and Zhuang, Jun and Chen, Ting and Kang, Yan-Rong}, biburl = {https://www.bibsonomy.org/bibtex/2a2e1914ec1fb097d8a3b41b55d8f36d6/dblp}, booktitle = {ADMA}, crossref = {conf/adma/2005}, editor = {Li, Xue and Wang, Shuliang and Dong, Zhao Yang}, ee = {https://doi.org/10.1007/11527503_13}, interhash = {e005baf7b8e488479c32046b778f2d52}, intrahash = {a2e1914ec1fb097d8a3b41b55d8f36d6}, isbn = {3-540-27894-X}, keywords = {dblp}, pages = {96-107}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-08-18T11:51:20.000+0200}, title = {An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms.}, url = {http://dblp.uni-trier.de/db/conf/adma/adma2005.html#GuoZZCK05}, volume = 3584, year = 2005 }