Mining frequent closed graphs on evolving data streams

Albert Bifet, Geoff Holmes, Bernhard Pfahringer, Ricard Gavaldà. Mining frequent closed graphs on evolving data streams. In Chid Apté, Joydeep Ghosh, Padhraic Smyth, editors, Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 21-24, 2011. pages 591-599, ACM, 2011. [doi]

@inproceedings{BifetHPG11,
  title = {Mining frequent closed graphs on evolving data streams},
  author = {Albert Bifet and Geoff Holmes and Bernhard Pfahringer and Ricard Gavaldà},
  year = {2011},
  doi = {10.1145/2020408.2020501},
  url = {http://doi.acm.org/10.1145/2020408.2020501},
  tags = {data-flow, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BifetHPG11},
  cites = {0},
  citedby = {0},
  pages = {591-599},
  booktitle = {Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 21-24, 2011},
  editor = {Chid Apté and Joydeep Ghosh and Padhraic Smyth},
  publisher = {ACM},
  isbn = {978-1-4503-0813-7},
}