An Automated Framework for Supporting Data-Governance Rule Compliance in
Decentralized MIMO Contexts
- URL: http://arxiv.org/abs/2109.00838v1
- Date: Thu, 2 Sep 2021 10:53:03 GMT
- Title: An Automated Framework for Supporting Data-Governance Rule Compliance in
Decentralized MIMO Contexts
- Authors: Rui Zhao
- Abstract summary: Dr.Aid is a logic-based AI framework for automated compliance checking of data governance rules over data-flow graphs.
Dr.Aid models data rules and flow rules and checks compliance by reasoning about the propagation, combination, modification and application of data rules over the data flow graphs.
- Score: 10.62414957574478
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose Dr.Aid, a logic-based AI framework for automated compliance
checking of data governance rules over data-flow graphs. The rules are modelled
using a formal language based on situation calculus and are suitable for
decentralized contexts with multi-input-multi-output (MIMO) processes. Dr.Aid
models data rules and flow rules and checks compliance by reasoning about the
propagation, combination, modification and application of data rules over the
data flow graphs. Our approach is driven and evaluated by real-world datasets
using provenance graphs from data-intensive research.
Related papers
- Data-driven Bayesian State Estimation with Compressed Measurement of Model-free Process using Semi-supervised Learning [57.04370580292727]
The research topic is: data-driven Bayesian state estimation with compressed measurement.
The underlying dynamical model of the states is assumed to be unknown.
Two existing unsupervised learning-based data-driven methods fail to address the BSCM problem.
arXiv Detail & Related papers (2024-07-10T05:03:48Z) - Unsupervised Domain Adaption for Neural Information Retrieval [18.97486314518283]
We compare synthetic annotation by query generation using Large Language Models or rule-based string manipulation.
We find that Large Language Models outperform rule-based methods in all scenarios by a large margin.
In addition we explore several sizes of open Large Language Models to generate synthetic data and find that a medium-sized model suffices.
arXiv Detail & Related papers (2023-10-13T18:27:33Z) - Relational Action Bases: Formalization, Effective Safety Verification,
and Invariants (Extended Version) [67.99023219822564]
We introduce the general framework of relational action bases (RABs)
RABs generalize existing models by lifting both restrictions.
We demonstrate the effectiveness of this approach on a benchmark of data-aware business processes.
arXiv Detail & Related papers (2022-08-12T17:03:50Z) - Federated Anomaly Detection over Distributed Data Streams [0.0]
We propose an approach to building the bridge among anomaly detection, federated learning, and data streams.
The overarching goal of the work is to detect anomalies in a federated environment over distributed data streams.
arXiv Detail & Related papers (2022-05-16T17:38:58Z) - On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain
Adaptation [6.2200089460762085]
Methods for multi-source-free domain adaptation (MSFDA) typically train a target model using pseudo-labeled data produced by the source models.
We develop an information-theoretic bound on the generalization error of the resulting target model.
We then provide insights on how to balance this trade-off from three perspectives, including domain aggregation, selective pseudo-labeling, and joint feature alignment.
arXiv Detail & Related papers (2022-02-01T22:34:18Z) - Dr.Aid: Supporting Data-governance Rule Compliance for Decentralized
Collaboration in an Automated Way [7.744664716152106]
Dr.Aid is a framework that helps individuals, organisations and federations comply with data rules.
It encodes data-governance rules using a formal language and performs reasoning on data-flow graphs.
We evaluate the model in three aspects by encoding real-life data-use policies from diverse fields.
arXiv Detail & Related papers (2021-10-03T17:59:28Z) - Learning to Limit Data Collection via Scaling Laws: Data Minimization
Compliance in Practice [62.44110411199835]
We build on literature in machine learning law to propose framework for limiting collection based on data interpretation that ties data to system performance.
We formalize a data minimization criterion based on performance curve derivatives and provide an effective and interpretable piecewise power law technique.
arXiv Detail & Related papers (2021-07-16T19:59:01Z) - CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT
(Extended Version) [62.96267257163426]
We introduce the CoCoMoT (Computing Conformance Modulo Theories) framework.
First, we show how SAT-based encodings studied in the pure control-flow setting can be lifted to our data-aware case.
Second, we introduce a novel preprocessing technique based on a notion of property-preserving clustering.
arXiv Detail & Related papers (2021-03-18T20:22:50Z) - How Training Data Impacts Performance in Learning-based Control [67.7875109298865]
This paper derives an analytical relationship between the density of the training data and the control performance.
We formulate a quality measure for the data set, which we refer to as $rho$-gap.
We show how the $rho$-gap can be applied to a feedback linearizing control law.
arXiv Detail & Related papers (2020-05-25T12:13:49Z) - Do We Really Need to Access the Source Data? Source Hypothesis Transfer
for Unsupervised Domain Adaptation [102.67010690592011]
Unsupervised adaptationUDA (UDA) aims to leverage the knowledge learned from a labeled source dataset to solve similar tasks in a new unlabeled domain.
Prior UDA methods typically require to access the source data when learning to adapt the model.
This work tackles a practical setting where only a trained source model is available and how we can effectively utilize such a model without source data to solve UDA problems.
arXiv Detail & Related papers (2020-02-20T03:13:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.