Sampling Subgraphs with Guaranteed Treewidth for Accurate and Efficient Graphical Inference.
Jaemin Yoo|U Kang|Mauro Scanagatta|Giorgio Corani|Marco Zaffalon
| Anthology ID: | DBLP:conf/wsdm/YooKSCZ20 |
|---|---|
| Volume: | WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020 |
| Year: | 2020 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 708-716 |
| URL: | https://doi.org/10.1145/3336191.3371815 |
| DOI: | https://doi.org/10.1145/3336191.3371815 |
| DBLP: | conf/wsdm/YooKSCZ20 |
| BibTeX: |
@inproceedings{yoo-2020-sampling,
author = {Jaemin Yoo and
U Kang and
Mauro Scanagatta and
Giorgio Corani and
Marco Zaffalon},
editor = {James Caverlee and
Xia Ben Hu and
Mounia Lalmas-Roelleke and
Wei Wang},
title = {{Sampling Subgraphs with Guaranteed Treewidth for Accurate and Efficient Graphical Inference}},
booktitle = {{WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020}},
pages = {708--716},
publisher = {ACM},
year = {2020},
url = {https://doi.org/10.1145/3336191.3371815},
doi = {https://doi.org/10.1145/3336191.3371815}
}