216 Hits in 7.8 sec

Relaxed Marginal Consistency for Differentially Private Query Answering [article]

Ryan McKenna, Siddhant Pradhan, Daniel Sheldon, Gerome Miklau
2021 arXiv   pre-print
Our new approach works with many existing private query answering algorithms and improves scalability or accuracy with no privacy cost.  ...  This provides consistent query answers and reduces error, but often requires space that grows exponentially with dimension.  ...  a gift to the University of Massachusetts Amherst in support of academic research.  ... 
arXiv:2109.06153v2 fatcat:inoiryfdtrhm3dbomz37avs42m

Ontology Query Answering on Databases [chapter]

Jing Mei, Li Ma, Yue Pan
2006 Lecture Notes in Computer Science  
As such, SPARQL query answering on OWL ontologies could be solved in databases.  ...  This paper addresses ontology query answering on databases by means of Datalog programs.  ...  Magic Set [3] and Tabling [1] , scalable ontology query answering is hopeful. SPARQL Queries SPARQL is a query language for obtaining information from RDF graphs.  ... 
doi:10.1007/11926078_32 fatcat:fq7fotzxlja2hmfiix3hhbr36u

Parallel Abductive Query Answering in Probabilistic Logic Programs

Gerardo I. Simari, John P. Dickerson, Amy Sliva, V. S. Subrahmanian
2013 ACM Transactions on Computational Logic  
P., Sliva, A., and Subrahmanian, V. S. 2013. Parallel abductive query answering in probabilistic logic programs.  ...  We first formally define and study an exact (intractable) approach to CBQA, and then go on to propose a more efficient algorithm for a specific subclass of ap-programs that builds on the results for the  ...  The authors gratefully acknowledge funding support for this work provided to the Lab for Computational Cultural Dynamics (LCCD) by the Army Research Office under grants W911NF0910206 and W911NF1110344,  ... 
doi:10.1145/2480759.2480764 fatcat:x6crdgb76vexrodq5zua5sc37i

GPU-based Commonsense Paradigms Reasoning for Real-Time Query Answering and Multimodal Analysis [article]

Nguyen Ha Tran, Erik Cambria
2018 arXiv   pre-print
Our approach takes advantages of the massively parallel processing power of modern GPUs to enhance the performance of feature extraction from different modalities.  ...  In addition, in order to ex- tract important textual features from multimodal sources we generate domain-specific graphs based on commonsense knowledge and apply GPU-based graph traversal for fast feature  ...  Then, the model parameters are updated to fit the new search shape. Finally, the shapes are conformed by the parameters.  ... 
arXiv:1807.08804v1 fatcat:xu5m2oh55ndahct7rtrbecjz3m

Relational Kernel Machines for Learning from Graph-Structured RDF Data [chapter]

Veli Bicer, Thanh Tran, Anna Gossen
2011 Lecture Notes in Computer Science  
Then, a composite kernel is obtained from a set of clause kernels derived from components of the hypothesis. The learning of the hypothesis and kernel(s) is performed in an interleaving fashion.  ...  Further, combining several kernels can help to deal with efficiency and data sparsity but creates the additional challenge of identifying and joining different subsets of features or kernels, respectively  ...  In [7] the authors propose the use of existing SRL approaches and their integration into SPARQL such that both deductive and inductive reasoning can be employed for query answering.  ... 
doi:10.1007/978-3-642-21034-1_4 fatcat:7orx2wn7bnguleijf2sdyhjul4

Beta Probabilistic Databases

Niccolo' Meneghetti, Oliver Kennedy, Wolfgang Gatterbauer
2017 Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17  
We introduce Beta Probabilistic Databases (B-PDBs), a generalization of TI-PDBs designed to support both (i) belief updating and (ii) parameter learning in a principled and scalable way.  ...  We show how this simple expedient enables both belief updating and parameter learning in a principled way, without imposing any burden on regular query processing.  ...  This work was supported by a gift from Oracle, NPS Award #N00244-16-1-0022, and NSF Awards SaTC-1409551 and CAREER IIS-1553547.  ... 
doi:10.1145/3035918.3064026 dblp:conf/sigmod/MeneghettiKG17 fatcat:yc6mvudslzdqdi7ijy5e5vb62u

Protection of Database Security via Collaborative Inference Detection

Yu Chen, W.W. Chu
2008 IEEE Transactions on Knowledge and Data Engineering  
For multi-user cases, the users may share their query answers to increase the inference probability.  ...  Based on data dependency, database schema and semantic knowledge, we constructed a semantic inference model (SIM) that represents the possible inference channels from any attribute to the pre-assigned  ...  Acknowledgements The authors wish to thank the anonymous reviewers for their helpful comments and suggestions. These have led to valuable improvements to this paper.  ... 
doi:10.1109/tkde.2007.190642 fatcat:7s4yl2gotzdihpfkxn2mep4na4

Neural Belief Reasoner [article]

Haifeng Qian
2020 arXiv   pre-print
Its implementation consists of neural networks, fuzzy-set operations and belief-function operations, and query-answering, sample-generation and training algorithms are presented.  ...  This paper proposes a new generative model called neural belief reasoner (NBR). It differs from previous models in that it specifies a belief function rather than a probability distribution.  ...  Query Answering The general form of a query is a conditional belief function given a condition function C (z) which outputs a scalar in range [0, 1].  ... 
arXiv:1909.04719v2 fatcat:i5ynnidzzjcnhbzcqjfv6vli74

Graphical-model based estimation and inference for differential privacy [article]

Ryan McKenna, Daniel Sheldon, Gerome Miklau
2019 arXiv   pre-print
We show that our approach is far more efficient than existing estimation techniques from the privacy literature and that it can improve the accuracy and scalability of many state-of-the-art mechanisms.  ...  Many privacy mechanisms reveal high-level information about a data distribution through noisy measurements. It is common to use this information to estimate the answers to new queries.  ...  Their problem formulation requires a known model parameterization and a prior distribution over the parameter space.  ... 
arXiv:1901.09136v1 fatcat:4b6akzyidng7bnadokttrurvzy

Disentangled Variational Autoencoder based Multi-Label Classification with Covariance-Aware Multivariate Probit Model

Junwen Bai, Shufeng Kong, Carla Gomes
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
The decoder of MPVAE takes in the samples from the embedding spaces and models the joint distribution of output targets under a Multivariate Probit model by learning a shared covariance matrix.  ...  MPVAE is further shown to remain robust under noisy settings. Lastly, we demonstrate the interpretability of the learned covariance by a case study on a bird observation dataset.  ...  Query Answering The general form of a query is a conditional belief function given a condition function C (z) which outputs a scalar in range [0, 1].  ... 
doi:10.24963/ijcai.2020/590 dblp:conf/ijcai/Qian20 fatcat:2rxtc4lki5hz7jf3n3dbtl75c4

Abstracts of Recent PhDs

2008 Knowledge engineering review (Print)  
'environment' and a number of strategic tradeoffs.  ...  The variety of different auction rules, the restrictions in supply or demand, and the agents' combinatorial preferences for the different commodities, have led to the creation of a very complex multi-agent  ...  Consistent query answers are characterized as ordinary answers obtained from every minimally repaired and consistent version of the database.  ... 
doi:10.1017/s0269888908001331 fatcat:lil6wn52szbdjklbdqa3m4durq

From P2P to reliable semantic P2P systems

Abdul-Rahman Mawlood-Yunis, Michael Weiss, Nicola Santoro
2010 Peer-to-Peer Networking and Applications  
As a result of their lack of resilience to temporary mapping faults, SP2P systems can suffer from disconnection failures.  ...  To identify the problem, we will use a simulation model of SP2P systems.  ...  When newly retrieved query answers differ from the predicted answers, an alert about a potentially broken map is sent to the system administrator. this paper is relevant to our study but differs in approach  ... 
doi:10.1007/s12083-009-0066-2 fatcat:bxur7m63kbhn7at4eczqyibeqi

Robust Conversational AI with Grounded Text Generation [article]

Jianfeng Gao, Baolin Peng, Chunyuan Li, Jinchao Li, Shahin Shayandeh, Lars Liden, Heung-Yeung Shum
2020 arXiv   pre-print
This article presents a hybrid approach based on a Grounded Text Generation (GTG) model to building robust task bots at scale.  ...  GTG is pre-trained on large amounts of raw text and human conversational data, and can be fine-tuned to complete a wide range of tasks.  ...  [31] propose to learn θ using weakly supervised learning on query-answer pairs without ground-truth parses. This is challenging because the supervision signals (rewards) are delayed and sparse.  ... 
arXiv:2009.03457v1 fatcat:2462mlxn7fg3zgw5mwknoqngaa

An SQL Domain Ontology Learning for Analyzing Hierarchies of Structures in Pre-Learning Assessment Agents

Kennedy E. Ehimwenma, Paul Crowther, Martin Beer, Safiya Al-Sharji
2020 SN Computer Science  
In a formal school curriculum, modules of learning are inter-dependent. So, teaching and learning follows an ordered sequence of learning from lower-level module(s) to higher-level ones.  ...  To describe an SQL ontology and its representation for a multi-agent based system application, this paper uses a description logic language to present the organization of learning modules into DesiredConcept  ...  OWL2-QL: Based on DL-Lite (NLogSpace-complete) [14] , OWL2-QL is geared towards scalable query answering in an ABox (when dealing with lots of instance data and a relatively simple TBox).  ... 
doi:10.1007/s42979-020-00338-1 fatcat:tfy4aa4pqzhlxpx4nr3l3fxqiy

Stochastic data acquisition for answering queries as time goes by

Zheng Li, Tingjian Ge
2016 Proceedings of the VLDB Endowment  
We propose two approaches to solve this problem using reinforcement learning and tailored locality-sensitive hashing.  ...  A systematic empirical study using two real-world datasets shows that our approaches are effective and efficient.  ...  This work was supported in part by the NSF, under the grants IIS-1149417, IIS-1319600, and IIS-1633271.  ... 
doi:10.14778/3021924.3021942 fatcat:m7z3sftomvec7igt7nuztmomkm
« Previous Showing results 1 — 15 out of 216 results