Filters








13,715 Hits in 6.7 sec

Querying knowledge Graphs By Example entity tuples

Nandish Jayaram, Arijit Khan, Chengkai Li, Xifeng Yan, Ramez Elmasri
2016 2016 IEEE 32nd International Conference on Data Engineering (ICDE)  
As an initial step toward improving the usability of knowledge graphs, we propose to query such data by example entity tuples, without requiring users to form complex graph queries.  ...  Our system, GQBE (Graph Query By Example), automatically discovers a weighted hidden maximum query graph based on input query tuples, to capture a user's query intent.  ...  Motivated by the aforementioned usability challenge, we build GQBE 1 (Graph Query by Example), a system that queries knowledge graphs by example entity tuples instead of graph queries.  ... 
doi:10.1109/icde.2016.7498391 dblp:conf/icde/JayaramKLYE16 fatcat:x4e4emj2tnbfhpcf4xkalutetq

Querying Knowledge Graphs by Example Entity Tuples

Nandish Jayaram, Arijit Khan, Chengkai Li, Xifeng Yan, Ramez Elmasri
2015 IEEE Transactions on Knowledge and Data Engineering  
Modified laXce with recomputed upper boundary Knowledge Graphs Input: an example of what the user wants to find. Accuracy of GQBE on mul;-tuple queries, k = 25. LaXce nodes evaluated comparison.  ...  q q Query-by-example in relaOonal databases [Zloof'75]. q Keyword search and keyword-based query formulaOon [Chang et al.'11]. q Set expansion [Wang et al.'07].  ... 
doi:10.1109/tkde.2015.2426696 fatcat:3nygndzixbfq5fweic27c2wrha

Querying Knowledge Graphs by Example Entity Tuples [article]

Nandish Jayaram and Arijit Khan and Chengkai Li and Xifeng Yan and Ramez Elmasri
2013 arXiv   pre-print
As an initial step toward improving the usability of knowledge graphs, we propose to query such data by example entity tuples, without requiring users to form complex graph queries.  ...  Our system, GQBE (Graph Query By Example), automatically derives a weighted hidden maximal query graph based on input query tuples, to capture a user's query intent.  ...  Motivated by the aforementioned usability challenge, we build GQBE 1 (Graph Query by Example), a system that queries knowledge graphs by example entity tuples instead of graph queries.  ... 
arXiv:1311.2100v1 fatcat:dtghp4ozizhxhaf2ow3ld4wray

GQBE: Querying knowledge graphs by example entity tuples

Nandish Jayaram, Mahesh Gupta, Arijit Khan, Chengkai Li, Xifeng Yan, Ramez Elmasri
2014 2014 IEEE 30th International Conference on Data Engineering  
Toward better usability of query systems over knowledge graphs, GQBE allows users to query knowledge graphs by example entity tuples without writing complex queries.  ...  We present GQBE, a system that presents a simple and intuitive mechanism to query large knowledge graphs.  ...  GQBE proposes to query knowledge graphs by example entity tuples, where the users do not have to construct any query graph.  ... 
doi:10.1109/icde.2014.6816753 dblp:conf/icde/JayaramGKLYE14 fatcat:64uoub6whfarlm54ggyhm3hxru

Towards a Query-by-Example System for Knowledge Graphs

Nandish Jayaram, Arijit Khan, Chengkai Li, Xifeng Yan, Ramez Elmasri
2014 Proceedings of Workshop on GRAph Data management Experiences and Systems - GRADES'14  
To the best of our knowledge, GQBE is among the first few emerging systems to query knowledge graphs by example entity tuples. 1  ...  As an initial step toward improving the usability of knowledge graphs, we propose to query such data by example entity tuples, without requiring users to write complex graph queries.  ...  The work of Yan was partially supported by the Army Research Laboratory under cooperative agreement W911NF-09-2-0053 (NSCTA).  ... 
doi:10.1145/2621934.2621937 dblp:conf/sigmod/JayaramKLYE14 fatcat:ujm3jkdiprdpxftiat2rsruczq

A2N: Attending to Neighbors for Knowledge Graph Inference

Trapit Bansal, Da-Cheng Juan, Sujith Ravi, Andrew McCallum
2019 Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics  
State-of-the-art models for knowledge graph completion aim at learning a fixed embedding representation of entities in a multirelational graph which can generalize to infer unseen entity relationships  ...  We thus propose a novel attentionbased method to learn query-dependent representation of entities which adaptively combines the relevant graph neighborhood of an entity leading to more accurate KG completion  ...  Introduction Knowledge graphs, such as Freebase (Bollacker et al., 2008) , contain a wealth of structured knowledge in the form of relationships between entities and are useful for numerous end applications  ... 
doi:10.18653/v1/p19-1431 dblp:conf/acl/BansalJRM19 fatcat:5dtcxxykrreobfnyuf5yw36jkm

Bridging Visual Perception with Contextual Semantics for Understanding Robot Manipulation Tasks [article]

Chen Jiang, Martin Jagersand
2020 arXiv   pre-print
(E-R-E) and Entity-Attribute-Value (E-A-V) tuples.  ...  It is essential for intelligent robots to semantically interpret manipulation knowledge by describing entities, relations and attributes in a structural manner.  ...  The final dynamic knowledge graph is completed when all the entities are queried in the set of generated E-R-E tuples and all E-A-V tuples are merged with the E-R-E tuples.  ... 
arXiv:1909.07459v2 fatcat:assvrjoyn5hx5ocdumxwarqugm

Language-model-based ranking in entity-relation graphs

Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
2009 Proceedings of the First International Workshop on Keyword Search on Structured Data - KEYS '09  
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs.  ...  We show the effectiveness of our model through examples.  ...  FRAMEWORK A knowledge base B of entities and relationships is a graph denoted by a set of triples, where a triple is of the form < e1, r, e2 > with entities e1, e2 and relation r.  ... 
doi:10.1145/1557670.1557686 dblp:conf/sigmod/ElbassuoniRW09 fatcat:rmqysrviw5dwnop4jwb6y54zrq

AccKW: An Efficient Access Control Scheme for Keyword-Based Search over RDBMS [chapter]

Vikram Goyal, Ashish Sureka, Sangeeta Lal
2010 Lecture Notes in Computer Science  
An SQL query is allowed or denied access to database according to the specified access control policy.  ...  tuples = prune-key-tuples(key tuples, A, U ) 8. if ∀ k ∈ keywords, k ∈ key tuples then 9. return output queries 10. end if 11. pruned graph = prune-graph(G, A, U ) 12. annotated gr = annotate-graph(pruned  ...  A context based entity constraint defines authorization for a relation by using predicates on attribute's value. As an example, rule (student, select, (faculty,student.instructor id !  ... 
doi:10.1007/978-3-642-12038-1_8 fatcat:mow2rmb22za55houkpx7x32eye

DBrev: Dreaming of a Database Revolution

Gjergji Kasneci, Jurgen Van Gael, Thore Graepel
2011 Conference on Innovative Data Systems Research  
The database community has provided excellent frameworks for efficient querying and online transaction or analytical processing.  ...  Knowledge queries can be expressed through a graph-based query language similar to the one proposed in [3] .  ...  The node labeled with $x represents a variable, which in the answering phase is replaced by entities that satisfy the relationship constraints given by the query graph.  ... 
dblp:conf/cidr/KasneciGG11 fatcat:jfplj5lngzf5zop27k7z5qnghq

Discovering Neighborhood Pattern Queries by sample answers in knowledge base

Jialong Han, Kai Zheng, Aixin Sun, Shuo Shang, Ji-Rong Wen
2016 2016 IEEE 32nd International Conference on Data Engineering (ICDE)  
other entities in the results of relevant queries.  ...  Nevertheless, it remains challenging for ordinary users to fully understand the structure of a knowledge base and to issue structural queries.  ...  Due to the inherent difference between vector-based and graph-based data, our algorithmic details are significantly different. Query by Example Entities & Tuples.  ... 
doi:10.1109/icde.2016.7498309 dblp:conf/icde/HanZSSW16 fatcat:zy5wleg5bbfcbhsenkokjb7zkm

Language-model-based ranking for queries on RDF-graphs

Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Marcin Sydow, Gerhard Weikum
2009 Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09  
Queries can be expressed in the W3C-endorsed SPARQL language or by similarly designed graph-pattern search.  ...  These collections can be viewed as graphs of entities and relationships (ER graphs) and can be represented as a set of subject-property-object (SPO) triples in the Semantic-Web data model RDF.  ...  The presented user-study Figure 1 : 1 Example of an entity-relationship graph (ti|w k ) + (1 − α)P (ti)] (3) Table 1 : 1 A subset of RDF triples for the ER graph in Table 2 : 2 Example query and  ... 
doi:10.1145/1645953.1646078 dblp:conf/cikm/ElbassuoniRSSW09 fatcat:mpsmvzxwirggbf7oyvo7s3z3fm

Towards a Unified Graph Model for Supporting Data Management and Usable Machine Learning

Guoliang Li, Meihui Zhang, Beng Chin Ooi
2017 IEEE Data Engineering Bulletin  
To make machine learning usable, we provide a declarative query language, that extends SQL to support data management and machine learning operators, and provide visualization tools.  ...  In this position paper, we present a preliminary design of a graph model for supporting both data management and usable machine learning.  ...  Conclusion In this position paper, we sketched a unified graph model for supporting both data management and machine learning.  ... 
dblp:journals/debu/0001ZO17 fatcat:as2ebadiz5aerllir3ejbd3y74

SPARQL2OWL: Towards Bridging the Semantic Gap Between RDF and OWL

Mona Alshahrani, Hussein Almashouq, Robert Hoehndorf
2016 International Conference on Biomedical Ontology  
While some approaches combine RDF and OWL, for example for querying, knowledge in RDF and OWL is often expressed differently.  ...  Combined with background knowledge from ontologies, the generated OWL ontologies can be used for expressive queries and quality control of RDF data.  ...  As variables cannot be used for OWL entities in axioms, we define the semantics of the tuple (si, pi) using the set of tuples returned by executing the SPARQL query.  ... 
dblp:conf/icbo/AlshahraniAH16 fatcat:xhnwg6pv4rcyjnowc3mostmfoa

A Novel Time Constraint-Based Approach for Knowledge Graph Conflict Resolution

Yanjun Wang, Yaqiong Qiao, Jiangtao Ma, Guangwu Hu, Chaoqin Zhang, Arun Kumar Sangaiah, Hongpo Zhang, Kai Ren
2019 Applied Sciences  
In this article, we propose a knowledge graph conflict resolution method, knowledge graph evolution algorithm based on deep learning (Kgedl), which can resolve facts confliction with high precision by  ...  Then, the path embedding vector is trained from the graph structures of knowledge graphs, and the time attributes of entities are combined with the semantic and path embedding vectors.  ...  In the prediction model, the tuples in the knowledge graph are updated by events, the changes in the knowledge graph are first reflected in the event tensor, and the prediction of the events is also included  ... 
doi:10.3390/app9204399 fatcat:m3qpv7w47ndkpiei3zjav4oz7m
« Previous Showing results 1 — 15 out of 13,715 results