Finding Reliable Subgraphs from Large Probabilistic Graphs

Cite

Text

Hintsanen and Toivonen. "Finding Reliable Subgraphs from Large Probabilistic Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008. doi:10.1007/978-3-540-87479-9_13

Markdown

[Hintsanen and Toivonen. "Finding Reliable Subgraphs from Large Probabilistic Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008.](https://mlanthology.org/ecmlpkdd/2008/hintsanen2008ecmlpkdd-finding/) doi:10.1007/978-3-540-87479-9_13

BibTeX

@inproceedings{hintsanen2008ecmlpkdd-finding,
  title     = {{Finding Reliable Subgraphs from Large Probabilistic Graphs}},
  author    = {Hintsanen, Petteri and Toivonen, Hannu},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2008},
  pages     = {15},
  doi       = {10.1007/978-3-540-87479-9_13},
  url       = {https://mlanthology.org/ecmlpkdd/2008/hintsanen2008ecmlpkdd-finding/}
}