%0 Conference Paper %1 conf/pkdd/KibriyaR12 %A Kibriya, Ashraf M. %A Ramon, Jan %B ECML/PKDD (1) %D 2012 %E Flach, Peter A. %E Bie, Tijl De %E Cristianini, Nello %I Springer %K dblp %P 426-441 %T Nearly Exact Mining of Frequent Trees in Large Networks. %U http://dblp.uni-trier.de/db/conf/pkdd/pkdd2012-1.html#KibriyaR12 %V 7523 %@ 978-3-642-33459-7

@inproceedings{conf/pkdd/KibriyaR12, added-at = {2018-06-26T00:00:00.000+0200}, author = {Kibriya, Ashraf M. and Ramon, Jan}, biburl = {https://www.bibsonomy.org/bibtex/21cf30bd80c6db05a34dd26235c8ea174/dblp}, booktitle = {ECML/PKDD (1)}, crossref = {conf/pkdd/2012-1}, editor = {Flach, Peter A. and Bie, Tijl De and Cristianini, Nello}, ee = {https://doi.org/10.1007/978-3-642-33460-3_33}, interhash = {abfab842c26cbb36744148c778c41e22}, intrahash = {1cf30bd80c6db05a34dd26235c8ea174}, isbn = {978-3-642-33459-7}, keywords = {dblp}, pages = {426-441}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:10:00.000+0200}, title = {Nearly Exact Mining of Frequent Trees in Large Networks.}, url = {http://dblp.uni-trier.de/db/conf/pkdd/pkdd2012-1.html#KibriyaR12}, volume = 7523, year = 2012 }