Hiroki Arimura, Takeaki Uno. An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. In Stefan Kramer, Bernhard Pfahringer, editors, Inductive Logic Programming, 15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings. Volume 3625 of Lecture Notes in Computer Science, pages 1-19, Springer, 2005. [doi]
@inproceedings{ArimuraU05,
title = {An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees},
author = {Hiroki Arimura and Takeaki Uno},
year = {2005},
doi = {10.1007/11536314_1},
url = {http://dx.doi.org/10.1007/11536314_1},
researchr = {https://researchr.org/publication/ArimuraU05},
cites = {0},
citedby = {0},
pages = {1-19},
booktitle = {Inductive Logic Programming, 15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings},
editor = {Stefan Kramer and Bernhard Pfahringer},
volume = {3625},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-28177-0},
}