Explaining Missing Data in Graphs: A Constraint-based Approach
Conference
·
OSTI ID:1821698
- Amazon.com
- Washington State University
- Case Western Reserve University
Abstract: This paper introduces a constraint-based approach to clarify missing values in graphs. Our method capitalizes on a set S of graph data constraints. An explanation is a sequence of operational enforcement of S towards the recovery of interested yet missing data (e.g., attribute values, edges). We show that constraint-based approach helps us to understand not only why a value is missing, but also how to recover the missing value. We study S-explanation problem, which is to compute the optimal explanations with guarantees on the informativeness and conciseness. We show the problem is in ?P^2 for established graph data constraints such as graph keys and graph association rules. We develop an efficient bidirectional algorithm to compute optimal explanations, without enforcing S on the entire graph. We also show our algorithm can be easily extended to support graph refinement within limited time, and to explain missing answers. Using real-world graphs, we experimentally verify the effectiveness and efficiency of our algorithms.
- Research Organization:
- Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1821698
- Report Number(s):
- PNNL-SA-159919
- Country of Publication:
- United States
- Language:
- English
Similar Records
GRIP: Constraint-based Explanation of Missing Answers for Graph Queries
Near-Optimal and Practical Algorithms for Graph Scan Statistics with Connectivity Constraints
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Conference
·
Mon Aug 02 00:00:00 EDT 2021
·
OSTI ID:1819693
Near-Optimal and Practical Algorithms for Graph Scan Statistics with Connectivity Constraints
Journal Article
·
Thu Apr 25 20:00:00 EDT 2019
· ACM Transactions on Knowledge Discovery from Data
·
OSTI ID:1524293
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Journal Article
·
Sun Jan 03 19:00:00 EST 2021
· ACM Transactions on Parallel Computing
·
OSTI ID:1769153