Готові списки джерел за темами / Knowledge Graphs (KG)

Добірка наукової літератури з теми "Knowledge Graphs (KG)"

Автор: Grafiati
Опубліковано: 6 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Knowledge Graphs (KG)".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Knowledge Graphs (KG)"

1

Khan, Arijit. "Knowledge Graphs Querying." ACM SIGMOD Record 52, no. 2 (August 10, 2023): 18–29. http://dx.doi.org/10.1145/3615952.3615956.

Повний текст джерела
Анотація:
Knowledge graphs (KGs) such as DBpedia, Freebase, YAGO, Wikidata, and NELL were constructed to store large-scale, real-world facts as (subject, predicate, object) triples - that can also be modeled as a graph, where a node (a subject or an object) represents an entity with attributes, and a directed edge (a predicate) is a relationship between two entities. Querying KGs is critical in web search, question answering (QA), semantic search, personal assistants, fact checking, and recommendation. While significant progress has been made on KG construction and curation, thanks to deep learning recently we have seen a surge of research on KG querying and QA. The objectives of our survey are two-fold. First, research on KG querying has been conducted by several communities, such as databases, data mining, semantic web, machine learning, information retrieval, and natural language processing (NLP), with different focus and terminologies; and also in diverse topics ranging from graph databases, query languages, join algorithms, graph patterns matching, to more sophisticated KG embedding and natural language questions (NLQs). We aim at uniting different interdisciplinary topics and concepts that have been developed for KG querying. Second, many recent advances on KG and query embedding, multimodal KG, and KG-QA come from deep learning, IR, NLP, and computer vision domains. We identify important challenges of KG querying that received less attention by graph databases, and by the DB community in general, e.g., incomplete KG, semantic matching, multimodal data, and NLQs. We conclude by discussing interesting opportunities for the data management community, for instance, KG as a unified data model and vector-based query processing.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Kejriwal, Mayank. "Knowledge Graphs: A Practical Review of the Research Landscape." Information 13, no. 4 (March 23, 2022): 161. http://dx.doi.org/10.3390/info13040161.

Повний текст джерела
Анотація:
Knowledge graphs (KGs) have rapidly emerged as an important area in AI over the last ten years. Building on a storied tradition of graphs in the AI community, a KG may be simply defined as a directed, labeled, multi-relational graph with some form of semantics. In part, this has been fueled by increased publication of structured datasets on the Web, and well-publicized successes of large-scale projects such as the Google Knowledge Graph and the Amazon Product Graph. However, another factor that is less discussed, but which has been equally instrumental in the success of KGs, is the cross-disciplinary nature of academic KG research. Arguably, because of the diversity of this research, a synthesis of how different KG research strands all tie together could serve a useful role in enabling more ‘moonshot’ research and large-scale collaborations. This review of the KG research landscape attempts to provide such a synthesis by first showing what the major strands of research are, and how those strands map to different communities, such as Natural Language Processing, Databases and Semantic Web. A unified framework is suggested in which to view the distinct, but overlapping, foci of KG research within these communities.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Yang, Xu, Ziyi Huan, Yisong Zhai, and Ting Lin. "Research of Personalized Recommendation Technology Based on Knowledge Graphs." Applied Sciences 11, no. 15 (July 31, 2021): 7104. http://dx.doi.org/10.3390/app11157104.

Повний текст джерела
Анотація:
Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs (KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Cao, Keyan, and Chuang Zheng. "TBRm: A Time Representation Method for Industrial Knowledge Graph." Applied Sciences 12, no. 22 (November 8, 2022): 11316. http://dx.doi.org/10.3390/app122211316.

Повний текст джерела
Анотація:
With the development of the artificial intelligence industry, Knowledge Graph (KG), as a concise and intuitive data presentation form, has received extensive attention and research from both academia and industry in recent years. At the same time, developments in the Internet of Things (IoT) have empowered modern industries to implement large-scale IoT ecosystems, such as the Industrial Internet of Things (IIoT). Using knowledge graphs (KG) to process data from the Industrial Internet of Things (IIoT) is a research field worthy of attention, but most of the researched knowledge graph technologies are mainly concentrated in the field of static knowledge graphs, which are composed of triples. In fact, many graphs also contain some dynamic information, such as time changes at points and time changes at edges; such knowledge graphs are called Temporal Knowledge Graphs (TKGs). We consider the temporal knowledge graph based on the projection and change of space. In order to combine the temporal information, we propose a new representation of the temporal knowledge graph, namely TBRm, which increases the temporal dimension of the translational distance model and utilizes relational predicates in time add representation in time dimension. We evaluate the proposed method on knowledge graph completion tasks using four benchmark datasets. Experiments demonstrate the effectiveness of TBRm representation in the temporal dimension. At the same time, it is also practiced on a network security data set of the Industrial Internet of Things. The practical results prove that the TBRm method can achieve good performance in terms of the degree of harm to IIoT network security.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Krinkin, Kirill, Alexander Ivanovich Vodyaho, Igor Kulikov, and Nataly Zhukova. "Deductive Synthesis of Networks Hierarchical Knowledge Graphs." International Journal of Embedded and Real-Time Communication Systems 12, no. 3 (July 2021): 32–48. http://dx.doi.org/10.4018/ijertcs.2021070103.

Повний текст джерела
Анотація:
The article focuses on developing of a deductive synthesis method for building telecommunications networks (TN) hierarchical knowledge graphs (KG). Synthesized KGs can be used to solve search, analytical, and recommendation (forecast) problems. TNs are complex heterogeneous objects. The synthesis of knowledge graphs of such objects requires much computational resources. The proposed method provides a low complexity of the synthesis of KG of TN by taking into account their hierarchical structure. The authors propose to do synthesis by direct downward multilevel inference and reverse multilevel inference. The article analyses existing graph models of TNs and methods for their building. Detailed description of the proposed method of networks hierarchical KGs synthesis is given. In order to evaluate the deductive synthesis method, a prototype of the system is developed. The provided real-world example shows how telecommunications networks hierarchical knowledge graphs are synthesized and used in practice. Finally, conclusions are formulated, and the areas of further research are identified.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Tong, Peihao, Qifan Zhang, and Junjie Yao. "Leveraging Domain Context for Question Answering Over Knowledge Graph." Data Science and Engineering 4, no. 4 (November 4, 2019): 323–35. http://dx.doi.org/10.1007/s41019-019-00109-w.

Повний текст джерела
Анотація:
Abstract With the growing availability of different knowledge graphs in a variety of domains, question answering over knowledge graph (KG-QA) becomes a prevalent information retrieval approach. Current KG-QA methods usually resort to semantic parsing, search or neural matching models. However, they cannot well tackle increasingly long input questions and complex information needs. In this work, we propose a new KG-QA approach, leveraging the rich domain context in the knowledge graph. We incorporate the new approach with question and answer domain context descriptions. Specifically, for questions, we enrich them with users’ subsequent input questions within a session and expand the input question representation. For the candidate answers, we equip them with surrounding context structures, i.e., meta-paths within the targeting knowledge graph. On top of these, we design a cross-attention mechanism to improve the question and answer matching performance. An experimental study on real datasets verifies these improvements. The new approach is especially beneficial for specific knowledge graphs with complex questions.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Hao, Wu, Jiao Menglin, Tian Guohui, Ma Qing, and Liu Guoliang. "R-KG: A Novel Method for Implementing a Robot Intelligent Service." AI 1, no. 1 (March 2, 2020): 117–40. http://dx.doi.org/10.3390/ai1010006.

Повний текст джерела
Анотація:
Aiming to solve the problem of environmental information being difficult to characterize when an intelligent service is used, knowledge graphs are used to express environmental information when performing intelligent services. Here, we specially design a kind of knowledge graph for environment expression referred to as a robot knowledge graph (R-KG). The main work of a R-KG is to integrate the diverse semantic information in the environment and pay attention to the relationship at the instance level. Also, through the efficient knowledge organization of a R-KG, robots can fully understand the environment. The R-KG firstly integrates knowledge from different sources to form a unified and standardized representation of a knowledge graph. Then, the deep logical relationship hidden in the knowledge graph is explored. To this end, a knowledge reasoning model based on a Markov logic network is proposed to realize the self-developmental ability of the knowledge graph and to further enrich it. Finally, as the strength of environment expression directly affects the efficiency of robots performing services, in order to verify the efficiency of the R-KG, it is used here as the semantic map that can be directly used by a robot for performing intelligent services. The final results prove that the R-KG can effectively express environmental information.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Chen, Xuelu, Muhao Chen, Weijia Shi, Yizhou Sun, and Carlo Zaniolo. "Embedding Uncertain Knowledge Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 3363–70. http://dx.doi.org/10.1609/aaai.v33i01.33013363.

Повний текст джерела
Анотація:
Embedding models for deterministic Knowledge Graphs (KG) have been extensively studied, with the purpose of capturing latent semantic relations between entities and incorporating the structured knowledge they contain into machine learning. However, there are many KGs that model uncertain knowledge, which typically model the inherent uncertainty of relations facts with a confidence score, and embedding such uncertain knowledge represents an unresolved challenge. The capturing of uncertain knowledge will benefit many knowledge-driven applications such as question answering and semantic search by providing more natural characterization of the knowledge. In this paper, we propose a novel uncertain KG embedding model UKGE, which aims to preserve both structural and uncertainty information of relation facts in the embedding space. Unlike previous models that characterize relation facts with binary classification techniques, UKGE learns embeddings according to the confidence scores of uncertain relation facts. To further enhance the precision of UKGE, we also introduce probabilistic soft logic to infer confidence scores for unseen relation facts during training. We propose and evaluate two variants of UKGE based on different confidence score modeling strategies. Experiments are conducted on three real-world uncertain KGs via three tasks, i.e. confidence prediction, relation fact ranking, and relation fact classification. UKGE shows effectiveness in capturing uncertain knowledge by achieving promising results, and it consistently outperforms baselines on these tasks.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Monka, Sebastian, Lavdim Halilaj, and Achim Rettinger. "A survey on visual transfer learning using knowledge graphs." Semantic Web 13, no. 3 (April 6, 2022): 477–510. http://dx.doi.org/10.3233/sw-212959.

Повний текст джерела
Анотація:
The information perceived via visual observations of real-world phenomena is unstructured and complex. Computer vision (CV) is the field of research that attempts to make use of that information. Recent approaches of CV utilize deep learning (DL) methods as they perform quite well if training and testing domains follow the same underlying data distribution. However, it has been shown that minor variations in the images that occur when these methods are used in the real world can lead to unpredictable and catastrophic errors. Transfer learning is the area of machine learning that tries to prevent these errors. Especially, approaches that augment image data using auxiliary knowledge encoded in language embeddings or knowledge graphs (KGs) have achieved promising results in recent years. This survey focuses on visual transfer learning approaches using KGs, as we believe that KGs are well suited to store and represent any kind of auxiliary knowledge. KGs can represent auxiliary knowledge either in an underlying graph-structured schema or in a vector-based knowledge graph embedding. Intending to enable the reader to solve visual transfer learning problems with the help of specific KG-DL configurations we start with a description of relevant modeling structures of a KG of various expressions, such as directed labeled graphs, hypergraphs, and hyper-relational graphs. We explain the notion of feature extractor, while specifically referring to visual and semantic features. We provide a broad overview of knowledge graph embedding methods and describe several joint training objectives suitable to combine them with high dimensional visual embeddings. The main section introduces four different categories on how a KG can be combined with a DL pipeline: 1) Knowledge Graph as a Reviewer; 2) Knowledge Graph as a Trainee; 3) Knowledge Graph as a Trainer; and 4) Knowledge Graph as a Peer. To help researchers find meaningful evaluation benchmarks, we provide an overview of generic KGs and a set of image processing datasets and benchmarks that include various types of auxiliary knowledge. Last, we summarize related surveys and give an outlook about challenges and open issues for future research.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Li, Tongxin, Weiping Wang, Xiaobo Li, Tao Wang, Xin Zhou, and Meigen Huang. "Embedding Uncertain Temporal Knowledge Graphs." Mathematics 11, no. 3 (February 3, 2023): 775. http://dx.doi.org/10.3390/math11030775.

Повний текст джерела
Анотація:
Knowledge graph (KG) embedding for predicting missing relation facts in incomplete knowledge graphs (KGs) has been widely explored. In addition to the benchmark triple structural information such as head entities, tail entities, and the relations between them, there is a large amount of uncertain and temporal information, which is difficult to be exploited in KG embeddings, and there are some embedding models specifically for uncertain KGs and temporal KGs. However, these models either only utilize uncertain information or only temporal information, without integrating both kinds of information into the underlying model that utilizes triple structural information. In this paper, we propose an embedding model for uncertain temporal KGs called the confidence score, time, and ranking information embedded jointly model (CTRIEJ), which aims to preserve the uncertainty, temporal and structural information of relation facts in the embedding space. To further enhance the precision of the CTRIEJ model, we also introduce a self-adversarial negative sampling technique to generate negative samples. We use the embedding vectors obtained from our model to complete the missing relation facts and predict their corresponding confidence scores. Experiments are conducted on an uncertain temporal KG extracted from Wikidata via three tasks, i.e., confidence prediction, link prediction, and relation fact classification. The CTRIEJ model shows effectiveness in capturing uncertain and temporal knowledge by achieving promising results, and it consistently outperforms baselines on the three downstream experimental tasks.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Knowledge Graphs (KG)"

1

Salehpour, Masoud. "High-performance Query Processing over Knowledge Graphs." Thesis, The University of Sydney, 2022. https://hdl.handle.net/2123/28569.

Повний текст джерела
Анотація:
The label “Knowledge Graph” (KG) has been used in the literature for over four decades, typically to refer to a collection of information about real-world entities and their inter-relationships. The proliferation of KGs in recent times opens up exciting opportunities for a broad range of semantic applications such as recommendations. However, unlocking the full potential of KGs in response to the growing deployment requires data platforms to efficiently store and process the content to support various applications. What began with extensions of relational database systems to store the content of KGs led to the design and development of a number of new specialized data management systems. Although progress has been made around building efficient KG data management systems, developing high-performance systems continues to pose research challenges. In this research, we studied the efficiency of existing systems for storing and processing KG content. Our results pointed to performance inconsistencies in representative systems across diverse query types. We address this by introducing a polyglot model of KG query processing to analyze each query and match it to the best-performing available systems. Experimental evaluation highlighted that our proposed approach provides consistently high performance. Finally, we investigated leveraging emerging hardware and its benefits to RDF data management and performance. To this end, we introduced a novel index structure, RDFix, that utilizes Persistent Memory (PM) to outperform existing read-optimized indexes as shown experimentally.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Ojha, Prakhar. "Utilizing Worker Groups And Task Dependencies in Crowdsourcing." Thesis, 2017. http://etd.iisc.ac.in/handle/2005/4265.

Повний текст джерела
Анотація:
Crowdsourcing has emerged as a convenient mechanism to collect human judgments on a variety of tasks, ranging from document and image classification to scientific experimentation. However, in recent times crowdsourcing has evolved from solving simpler tasks, like recognizing objects in images, to more complex tasks such as collaborative journalism, language translation, product designing etc. Unlike simpler micro-tasks performed by a single worker, these complex tasks require a group of workers and greater resources. In such scenarios, where groups of participants are the atomic units, it is a non-trivial task to distinguish workers (who contribute positively) from idlers (who do not contribute to group task) among the participants using only group's performance. The first part of this thesis studies the problem of distinguishing workers from idlers, without assuming any prior knowledge of individual skills and considers \groups" as the smallest observable unit for evaluation. We draw upon literature from group-testing and give bounds over minimum number of groups required to identify quality of subsets of individuals with high confidence. We validate our theory experimentally and report insights for the number of workers and idlers that can be identified for a given number of group-tasks with significant probability. In most crowdsourcing applications, there exist dependencies among the pool of Human Intelligence Tasks (HITs) and often in practical scenarios there are far too many HITs available than what can realistically be covered by limited available budget. Estimating the accuracy of automatically constructed Knowledge Graphs (KG) is one such important application. Automatic construction of large knowledge graphs has gained wide popularity in recent times. These KGs, such as NELL, Google Knowledge Vault, etc., consist of thousands of predicate-relations (e.g., is Person, is Mayor Of) and millions of their instances (e.g., (Bill de Blasio, is Mayor Of, New York City)). Estimating accuracy of such KGs is a challenging problem due to their size and diversity. In the second part of this study, we show that standard single-task crowdsourc- ing is sub-optimal and very expensive as it ignores dependencies among various predicates and instances. We propose Relational Crowdsourcing (RelCrowd) to overcome this challenge, where the tasks are created while taking dependencies among predicates and instances into account. We apply this framework in the context of large-scale Knowledge Graph Evaluation (KGEval) and demonstrate its effectiveness through extensive experiments on real-world datasets.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Saxena, Apoorv Umang. "Leveraging KG Embeddings for Knowledge Graph Question Answering." Thesis, 2023. https://etd.iisc.ac.in/handle/2005/6082.

Повний текст джерела
Анотація:
Knowledge graphs (KG) are multi-relational graphs consisting of entities as nodes and relations among them as typed edges. The goal of knowledge graph question answering (KGQA) is to answer natural language queries posed over the KG. These could be simple factoid questions such as “What is the currency of USA? ” or it could be a more complex query such as “Who was the president of USA after World War II? ”. Multiple systems have been proposed in the literature to perform KGQA, include question decomposition, semantic parsing and even graph neural network-based methods. In a separate line of research, KG embedding methods (KGEs) have been proposed to embed the entities and relations in the KG in low-dimensional vector space. These methods aim to learn representations that can be then utilized by various scoring functions to predict the plausibility of triples (facts) in the KG. Applications of KG embeddings include link prediction and KG completion. Such KG embedding methods, even though highly relevant, have not been explored for KGQA so far. In this work, we focus on 2 aspects of KGQA: (i) Temporal reasoning, and (ii) KG incompleteness. Here, we leverage recent advances in KG embeddings to improve model reasoning in the temporal domain, as well as use the robustness of embeddings to KG sparsity to improve incomplete KG question answering performance. We do this through the following contributions: Improving Multi-Hop KGQA using KG Embeddings We first tackle a subset of KGQA queries – multi-hop KGQA. We propose EmbedKGQA, a method which uses ComplEx embeddings and scoring function to answer these queries. We find that EmbedKGQA is particularly effective at KGQA over sparse KGs, while it also relaxes the requirement of answer selection from a pre-specified local neighborhood, an undesirable constraint imposed by GNN-based for this task. Experiments show that EmbedKGQA is superior to several GNN-based methods on incomplete KGs across a variety of dataset scales. Question Answering over Temporal Knowledge Graphs We then extend our method to temporal knowledge graphs (TKG), where each edge in the KG is accompanied by a time scope (i.e. start and end times). Here, instead of KGEs, we make use of temporal KGEs (TKGE) to enable the model to make use of these time annotations and perform temporal reasoning. We also propose a new dataset - CronQuestions - which is one of the largest publicly available temporal KGQA dataset with over 400k template-based temporal reasoning questions. Through extensive experiments we show the superiority of our method, CronKGQA, over several language-model baselines on the challenging task of temporal KGQA on CronQuestions. Sequence-to-Sequence Knowledge Graph Completion and Question Answering So far, integrating KGE into the KGQA pipeline had required separate training of the KGE and KGQA modules. In this work, we show that an off-the-shelf encoder-decoder Transformer model can serve as a scalable and versatile KGE model obtaining state-of-the-art results for KG link prediction and incomplete KG question answering. We achieve this by posing KG link prediction as a sequence-to-sequence task and exchange the triple scoring approach taken by prior KGE methods with autoregressive decoding. Such a simple but powerful method reduces the model size up to 98% compared to conventional KGE models while keeping inference time tractable. It also allows us to answer a variety of KGQA queries, not being restricted by query type.
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Knowledge Graphs (KG)"

1

Pflueger, Maximilian, David J. Tena Cucala, and Egor V. Kostylev. "GNNQ: A Neuro-Symbolic Approach to Query Answering over Incomplete Knowledge Graphs." In The Semantic Web – ISWC 2022, 481–97. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-19433-7_28.

Повний текст джерела
Анотація:
AbstractReal-world knowledge graphs (KGs) are usually incomplete—that is, miss some facts representing valid information. So, when applied to such KGs, standard symbolic query engines fail to produce answers that are expected but not logically entailed by the KGs. To overcome this issue, state-of-the-art ML-based approaches first embed KGs and queries into a low-dimensional vector space, and then produce query answers based on the proximity of the candidate entity and the query embeddings in the embedding space. This allows embedding-based approaches to obtain expected answers that are not logically entailed. However, embedding-based approaches are not applicable in the inductive setting, where KG entities (i.e., constants) seen at runtime may differ from those seen during training. In this paper, we propose a novel neuro-symbolic approach to query answering over incomplete KGs applicable in the inductive setting. Our approach first symbolically augments the input KG with facts representing parts of the KG that match query fragments, and then applies a generalisation of the Relational Graph Convolutional Networks (RGCNs) to the augmented KG to produce the predicted query answers. We formally prove that, under reasonable assumptions, our approach can capture an approach based on vanilla RGCNs (and no KG augmentation) using a (often substantially) smaller number of layers. Finally, we empirically validate our theoretical findings by evaluating an implementation of our approach against the RGCN baseline on several dedicated benchmarks.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Ranganathan, Varun, and Natarajan Subramanyam. "SDE-KG: A Stochastic Dynamic Environment for Knowledge Graphs." In Machine Learning and Knowledge Discovery in Databases, 483–88. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43823-4_39.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Ghosh, Devanshika, and Enayat Rajabi. "KG-Visual: A Tool for Visualizing RDF Knowledge Graphs." In Metadata and Semantic Research, 126–36. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-98876-0_11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Sardina, Jeffrey, Callie Sardina, John D. Kelleher, and Declan O’Sullivan. "Analysis of Attention Mechanisms in Box-Embedding Systems." In Communications in Computer and Information Science, 68–80. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-26438-2_6.

Повний текст джерела
Анотація:
AbstractLarge-scale Knowledge Graphs (KGs) have recently gained considerable research attention for their ability to model the inter- and intra- relationships of data. However, the huge scale of KGs has necessitated the use of querying methods to facilitate human use. Question Answering (QA) systems have shown much promise in breaking down this human-machine barrier. A recent QA model that achieved state-of-the-art performance, Query2box, modelled queries on a KG using box embeddings with an attention mechanism backend to compute the intersections of boxes for query resolution. In this paper, we introduce a new model, Query2Geom, which replaces the Query2box attention mechanism with a novel, exact geometric calculation. Our findings show that Query2Geom generally matches the performance of Query2box while having many fewer parameters. Our analysis of the two models leads us to formally describe the interaction between knowledge graph data and box embeddings with the concepts of semantic-geometric alignment and mismatch. We create the Attention Deviation Metric as a measure of how well the geometry of box embeddings captures the semantics of a knowledge graph, and apply it to explain the difference in performance between Query2box and Query2Geom. We conclude that Query2box’s attention mechanism operates using “latent intersections” that attend to the semantic properties in embeddings not expressed in box geometry, acting as a limit on model interpretability. Finally, we generalise our results and propose that semantic-geometric mismatch is a more general property of attention mechanisms, and provide future directions on how to formally model the interaction between attention and latent semantics.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Sanou, Gaoussou, Véronique Giudicelli, Nika Abdollahi, Sofia Kossida, Konstantin Todorov, and Patrice Duroux. "IMGT-KG: A Knowledge Graph for Immunogenetics." In The Semantic Web – ISWC 2022, 628–42. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-19433-7_36.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Wu, Tianxing, Cong Gao, Guilin Qi, Lei Zhang, Chuanqi Dong, He Liu, and Du Zhang. "KG-Buddhism: The Chinese Knowledge Graph on Buddhism." In Semantic Technology, 259–67. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70682-5_17.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Möller, Cedric. "Knowledge Graph Population with Out-of-KG Entities." In The Semantic Web: ESWC 2022 Satellite Events, 199–214. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-11609-4_35.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Kwapong, Benjamin, Amartya Sen, and Kenneth K. Fletcher. "ELECTRA-KG: A Transformer-Knowledge Graph Recommender System." In Services Computing – SCC 2022, 56–70. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-23515-3_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Dessì, Danilo, Francesco Osborne, Diego Reforgiato Recupero, Davide Buscaldi, Enrico Motta, and Harald Sack. "AI-KG: An Automatically Generated Knowledge Graph of Artificial Intelligence." In Lecture Notes in Computer Science, 127–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-62466-8_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Zárate, Marcos, Carlos Buckle, Renato Mazzanti, Mirtha Lewis, Pablo Fillottrani, and Claudio Delrieux. "Harmonizing Big Data with a Knowledge Graph: OceanGraph KG Uses Case." In Communications in Computer and Information Science, 81–92. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61218-4_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Knowledge Graphs (KG)"

1

Chen, Mingyang, Wen Zhang, Zhen Yao, Xiangnan Chen, Mengxiao Ding, Fei Huang, and Huajun Chen. "Meta-Learning Based Knowledge Extrapolation for Knowledge Graphs in the Federated Setting." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/273.

Повний текст джерела
Анотація:
We study the knowledge extrapolation problem to embed new components (i.e., entities and relations) that come with emerging knowledge graphs (KGs) in the federated setting. In this problem, a model trained on an existing KG needs to embed an emerging KG with unseen entities and relations. To solve this problem, we introduce the meta-learning setting, where a set of tasks are sampled on the existing KG to mimic the link prediction task on the emerging KG. Based on sampled tasks, we meta-train a graph neural network framework that can construct features for unseen components based on structural information and output embeddings for them. Experimental results show that our proposed method can effectively embed unseen components and outperforms models that consider inductive settings for KGs and baselines that directly use conventional KG embedding methods.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Wei, Xing, and Jiangjiang Liu. "Effects of Nonlinear Functions on Knowledge Graph Convolutional Networks for Recommender Systems with Yelp Knowledge Graph." In 11th International Conference on Computer Science and Information Technology (CCSIT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.110715.

Повний текст джерела
Анотація:
Knowledge Graph (KG) related recommendation method is advanced in dealing with cold start problems and sparse data. Knowledge Graph Convolutional Network (KGCN) is an end-to-end framework that has been proved to have the ability to capture latent item-entity features by mining their associated attributes on the KG. In KGCN, aggregator plays a key role for extracting information from the high-order structure. In this work, we proposed Knowledge Graph Processor (KGP) for pre-processing data and building corresponding knowledge graphs. A knowledge graph for the Yelp Open dataset was constructed with KGP. In addition, we investigated the impacts of various aggregators with three nonlinear functions on KGCN with Yelp Open dataset KG.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Wu, Yuting, Xiao Liu, Yansong Feng, Zheng Wang, Rui Yan, and Dongyan Zhao. "Relation-Aware Entity Alignment for Heterogeneous Knowledge Graphs." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/733.

Повний текст джерела
Анотація:
Entity alignment is the task of linking entities with the same real-world identity from different knowledge graphs (KGs), which has been recently dominated by embedding-based methods. Such approaches work by learning KG representations so that entity alignment can be performed by measuring the similarities between entity embeddings. While promising, prior works in the field often fail to properly capture complex relation information that commonly exists in multi-relational KGs, leaving much room for improvement. In this paper, we propose a novel Relation-aware Dual-Graph Convolutional Network (RDGCN) to incorporate relation information via attentive interactions between the knowledge graph and its dual relation counterpart, and further capture neighboring structures to learn better entity representations. Experiments on three real-world cross-lingual datasets show that our approach delivers better and more robust results over the state-of-the-art alignment methods by learning better KG representations.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Li, Shuxin, Zixian Huang, Gong Cheng, Evgeny Kharlamov, and Kalpa Gunaratna. "Enriching Documents with Compact, Representative, Relevant Knowledge Graphs." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/242.

Повний текст джерела
Анотація:
A prominent application of knowledge graph (KG) is document enrichment. Existing methods identify mentions of entities in a background KG and enrich documents with entity types and direct relations. We compute an entity relation subgraph (ERG) that can more expressively represent indirect relations among a set of mentioned entities. To find compact, representative, and relevant ERGs for effective enrichment, we propose an efficient best-first search algorithm to solve a new combinatorial optimization problem that achieves a trade-off between representativeness and compactness, and then we exploit ontological knowledge to rank ERGs by entity-based document-KG and intra-KG relevance. Extensive experiments and user studies show the promising performance of our approach.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Xia, Feng, Francesco Osborne, and Shuo Yu. "Session details: Theme: Artificial intelligence and agents: KG - knowledge graphs track." In SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3535433.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Huang, Yu-Xuan, Zequn Sun, Guangyao Li, Xiaobin Tian, Wang-Zhou Dai, Wei Hu, Yuan Jiang, and Zhi-Hua Zhou. "Enabling Abductive Learning to Exploit Knowledge Graph." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/427.

Повний текст джерела
Анотація:
Most systems integrating data-driven machine learning with knowledge-driven reasoning usually rely on a specifically designed knowledge base to enable efficient symbolic inference. However, it could be cumbersome for the nonexpert end-users to prepare such a knowledge base in real tasks. Recent years have witnessed the success of large-scale knowledge graphs, which could be ideal domain knowledge resources for real-world machine learning tasks. However, these large-scale knowledge graphs usually contain much information that is irrelevant to a specific learning task. Moreover, they often contain a certain degree of noise. Existing methods can hardly make use of them because the large-scale probabilistic logical inference is usually intractable. To address these problems, we present ABductive Learning with Knowledge Graph (ABL-KG) that can automatically mine logic rules from knowledge graphs during learning, using a knowledge forgetting mechanism for filtering out irrelevant information. Meanwhile, these rules can form a logic program that enables efficient joint optimization of the machine learning model and logic inference within the Abductive Learning (ABL) framework. Experiments on four different tasks show that ABL-KG can automatically extract useful rules from large-scale and noisy knowledge graphs, and significantly improve the performance of machine learning with only a handful of labeled data.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Wu, Zhanglin, Min Zhang, Ming Zhu, Yinglu Li, Ting Zhu, Hao Yang, Song Peng, and Ying Qin. "KG-BERTScore: Incorporating Knowledge Graph into BERTScore for Reference-Free Machine Translation Evaluation." In IJCKG 2022: 11th International Joint Conference On Knowledge Graphs. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3579051.3579065.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Zhou, Dongzhuoran, Baifan Zhou, Jieying Chen, Gong Cheng, Egor Kostylev, and Evgeny Kharlamov. "Towards Ontology Reshaping for KG Generation with User-in-the-Loop: Applied to Bosch Welding." In IJCKG'21: The 10th International Joint Conference on Knowledge Graphs. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3502223.3502243.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Osama, Mayar, and Mervat Abu Elkheir. "Can Incremental Learning help with KG Completion?" In 13th International Conference on Computer Science, Engineering and Applications (CCSEA 2023). Academy and Industry Research Collaboration Center (AIRCC), 2023. http://dx.doi.org/10.5121/csit.2023.130510.

Повний текст джерела
Анотація:
Knowledge Graphs (KGs) are a type of knowledge representation that gained a lot of attention due to their ability to store information in a structured format. This structure representation makes KGs naturally suited for search engines and NLP tasks like question-answering (QA) and task-oriented systems; however, KGs are hard to construct. While QA datasets are more available and easier to construct, they lack structural representation. This availability of QA datasets made them a rich resource for machine learning models, but these models benefit from the implicit structure in such datasets. We propose a framework to make this structure more pronounced and extract KG from QA datasets in an end-to-end manner, allowing the system to learn new knowledge in incremental learning with a human-in-the-loop (HITL) when needed. We test our framework using the SQuAD dataset and our incremental learning approach with two datasets, YAGO3-10 and FB15K237, both of which show promising results.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Shahinmoghadam, Mehrzad Shahinmoghadam, Ali Motamedi, and Mohammad Mostafa Soltani. "Leveraging Textual Information for Knowledge Graph-oriented Machine Learning: A Case Study in the Construction Industry." In The 29th EG-ICE International Workshop on Intelligent Computing in Engineering. EG-ICE, 2022. http://dx.doi.org/10.7146/aul.455.c216.

Повний текст джерела
Анотація:
The proven power of Knowledge Graphs (KGs) to effectively represent lexical and semantic information about numerous and heterogeneous entities and their interconnectedness has led to the growing recognition of their potential in engineering disciplines. Meanwhile, a greater focus has been placed on graph embedding techniques to derive dense vector representations of KGs. Such representations could enable the use of conventional machine learning techniques over the content of KGs. However, in the context of building engineering, the quality of the graph embeddings could be problematic, mainly due to the relatively small size of the KGs that are created for individual buildings. This paper aims to investigate the effectiveness of applying KG embedding methods when the elements of the building are described narrowly within the KG. The results of our experiments confirm that proper use of data transformation techniques can significantly improve the quality of the feature representation for downstream tasks.
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Knowledge Graphs (KG)"

1

Law, Edward, Samuel Gan-Mor, Hazel Wetzstein, and Dan Eisikowitch. Electrostatic Processes Underlying Natural and Mechanized Transfer of Pollen. United States Department of Agriculture, May 1998. http://dx.doi.org/10.32747/1998.7613035.bard.

Повний текст джерела
Анотація:
The project objective was to more fully understand how the motion of pollen grains may be controlled by electrostatic forces, and to develop a reliable mechanized pollination system based upon sound electrostatic and aerodynamic principles. Theoretical and experimental analyses and computer simulation methods which investigated electrostatic aspects of natural pollen transfer by insects found that: a) actively flying honeybees accumulate ~ 23 pC average charge (93 pC max.) which elevates their bodies to ~ 47 V likely by triboelectrification, inducing ~ 10 fC of opposite charge onto nearby pollen grains, and overcoming their typically 0.3-3.9 nN detachment force resulting in non-contact electrostatic pollen transfer across a 5 mm or greater air gap from anther-to-bee, thus providing a theoretical basis for earlier experimental observations and "buzz pollination" events; b) charge-relaxation characteristics measured for flower structural components (viz., 3 ns and 25 ns time constants, respectively, for the stigma-style vs. waxy petal surfaces) ensure them to be electrically appropriate targets for electrodeposition of charged pollen grains but not differing sufficiently to facilitate electrodynamic focusing onto the stigma; c) conventional electrostatic focusing beneficially concentrates pollen-deposition electric fields onto the pistill tip by 3-fold as compared to that onto underlying flower structures; and d) pollen viability is adequately maintained following exposure to particulate charging/management fields exceeding 2 MV/m. Laboratory- and field-scale processes/prototype machines for electrostatic application of pollen were successfully developed to dispense pollen in both a dry-powder phase and in a liquid-carried phase utilizing corona, triboelectric, and induction particulate-charging methods; pollen-charge levels attained (~ 1-10 mC/kg) provide pollen-deposition forces 10-, 77-, and 100-fold greater than gravity, respectively, for such charged pollen grains subjected to a 1 kV/cm electric field. Lab and field evaluations have documented charged vs. ukncharged pollen deposition to be significantly (a = 0.01-0.05) increased by 3.9-5.6 times. Orchard trials showed initial fruit set on branches individually treated with electrostatically applied pollen to typically increase up to ~ 2-fold vs. uncharged pollen applications; however, whole-tree applications have not significantly shown similar levels of benefit and corrective measures continue. Project results thus contribute important basic knowledge and applied electrostatics technology which will provide agriculture with alternative/supplemental mechanized pollination systems as tranditional pollen-transfer vectors are further endangered by natural and man-fade factors.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Knowledge Graphs (KG)" для конкретних типів джерел:
Статті в журналах
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії