Sampling Subgraphs with Guaranteed Treewidth for Accurate and Efficient Graphical Inference-Reference-Cited by-同舟云学术

Sampling Subgraphs with Guaranteed Treewidth for Accurate and Efficient Graphical Inference

Published:2020-01-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 13th International Conference on Web Search and Data Mining
language:
Short-container-title:

Author:

Yoo Jaemin¹,Kang U¹,Scanagatta Mauro²,Corani Giorgio³,Zaffalon Marco³

Affiliation:

1. Seoul National University, Seoul, Republic of Korea

2. Fondazione Bruno Kessler, Trento, Italy

3. IDSIA (Istituto Dalle Molle di Studi sull'Intelligenza Artificiale), Lugano, Switzerland

Funder

The Swiss NSF grant

The National Research Foundation of Korea (NRF) funded by MSIT

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3336191.3371815

Reference40 articles.

1. Lada A. Adamic and Natalie S. Glance. 2005. The political blogosphere and the 2004 U.S. election: divided they blog. In LinkKDD . 36--43. Lada A. Adamic and Natalie S. Glance. 2005. The political blogosphere and the 2004 U.S. election: divided they blog. In LinkKDD . 36--43.

2. Network Sampling

3. Leman Akoglu. 2014. Quantifying Political Polarity Based on Bipartite Opinion Networks. In ICWSM . Leman Akoglu. 2014. Quantifying Political Polarity Based on Bipartite Opinion Networks. In ICWSM .

4. Complexity of Finding Embeddings in a k-Tree

5. Erman Ayday and Faramarz Fekri. 2010. A belief propagation based recommender system for online services. In RecSys . 217--220. Erman Ayday and Faramarz Fekri. 2010. A belief propagation based recommender system for online services. In RecSys . 217--220.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Representative and Back-In-Time Sampling from Real-world Hypergraphs;ACM Transactions on Knowledge Discovery from Data;2024-04-26

2. Efficiently Sampling and Estimating Hypergraphs By Hybrid Random Walk;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

3. Graph-based PU learning for binary and multiclass classification without class prior;Knowledge and Information Systems;2022-06-30

4. Accurate Graph-Based PU Learning without Class Prior;2021 IEEE International Conference on Data Mining (ICDM);2021-12