Probabilistic Frequent Subtrees for Efficient Graph Classification and Retrieval

Cite

Text

Welke et al. "Probabilistic Frequent Subtrees for Efficient Graph Classification and Retrieval." Machine Learning, 2018. doi:10.1007/S10994-017-5688-7

Markdown

[Welke et al. "Probabilistic Frequent Subtrees for Efficient Graph Classification and Retrieval." Machine Learning, 2018.](https://mlanthology.org/mlj/2018/welke2018mlj-probabilistic/) doi:10.1007/S10994-017-5688-7

BibTeX

@article{welke2018mlj-probabilistic,
  title     = {{Probabilistic Frequent Subtrees for Efficient Graph Classification and Retrieval}},
  author    = {Welke, Pascal and Horváth, Tamás and Wrobel, Stefan},
  journal   = {Machine Learning},
  year      = {2018},
  pages     = {1847-1873},
  doi       = {10.1007/S10994-017-5688-7},
  volume    = {107},
  url       = {https://mlanthology.org/mlj/2018/welke2018mlj-probabilistic/}
}