%0 Conference Paper %1 conf/ilp/ArimuraU05 %A Arimura, Hiroki %A Uno, Takeaki %B ILP %D 2005 %E Kramer, Stefan %E Pfahringer, Bernhard %I Springer %K dblp %P 1-19 %T An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. %U http://dblp.uni-trier.de/db/conf/ilp/ilp2005.html#ArimuraU05 %V 3625 %@ 3-540-28177-0

@inproceedings{conf/ilp/ArimuraU05, added-at = {2019-06-02T00:00:00.000+0200}, author = {Arimura, Hiroki and Uno, Takeaki}, biburl = {https://www.bibsonomy.org/bibtex/20790b6113c9b075f5cc39a2ba13e0065/dblp}, booktitle = {ILP}, crossref = {conf/ilp/2005}, editor = {Kramer, Stefan and Pfahringer, Bernhard}, ee = {https://www.wikidata.org/entity/Q59278893}, interhash = {0198dc39a674bdd7803f0bf6e5d9205a}, intrahash = {0790b6113c9b075f5cc39a2ba13e0065}, isbn = {3-540-28177-0}, keywords = {dblp}, pages = {1-19}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-06-04T14:03:24.000+0200}, title = {An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.}, url = {http://dblp.uni-trier.de/db/conf/ilp/ilp2005.html#ArimuraU05}, volume = 3625, year = 2005 }