A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs
Yun Wang, Chrysanthi Kosyfaki, Sihem Amer-Yahia, Reynold Cheng
摘要
Hypothesis testing is a statistical method used to draw conclusions about populations from sample data, typically represented in tables. With the prevalence of graph representations in real-life applications, hypothesis testing on graphs is gaining importance. In this work, we formalize node, edge, and path hypotheses on attributed graphs. We develop a sampling-based hypothesis testing framework, which can accommodate existing hypothesis-agnostic graph sampling methods. To achieve accurate and time-efficient sampling, we then propose a Path-Hypothesis-Aware SamplEr, PHASE, an m -dimensional random walk that accounts for the paths specified in the hypothesis. We further optimize its time efficiency and propose PHASE opt . Experiments on three real datasets demonstrate the ability of our framework to leverage common graph sampling methods for hypothesis testing, and the superiority of hypothesis-aware sampling methods in terms of accuracy and time efficiency.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- Memory-Aware Framework for Efficient Second-Order Random Walk on Large GraphsYingxia Shao, Shiyue Huang, Xupeng Miao, Bin Cui 等SIGMOD 2020 · 被引用 19 次
- Efficiently Sampling and Estimating Hypergraphs By Hybrid Random WalkLingling Zhang, Zhiwei Zhang, Guoren Wang, Ye YuanICDE 2023 · 被引用 5 次
- Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware SamplingYuxiang Wang, Arijit Khan, Xiaoliang Xu, Jiahui Jin 等ICDE 2022 · 被引用 20 次
- Social Graph Restoration via Random Walk SamplingKazuki Nakajima, Kazuyuki ShudoICDE 2022 · 被引用 6 次
- MiDaS: Representative Sampling from Real-world HypergraphsMinyoung Choe, Jaemin Yoo, Geon Lee, Woonsung Baek 等WWW 2022 · 被引用 7 次
