KG-ACS: knowledge graph-driven adaptive constraint scheduling for heterogeneous multi-cloud resource management

In the heavy production process of manufacturing enterprises, it is difficult to effectively share resource data, which leads to relatively scattered production resources and low utilization rates. This study combined product lifecycle knowledge with time series data and put forward the Framework of Dynamic Manufacturing Knowledge Graph Construction (FDMKG) for the production process of manufacturing enterprises. Specifically, the production process data was divided into two dimensions: static resources and dynamic data stream. The static resources and the production data stream were semantically associated to generate a dynamic knowledge graph. Then, taking the production line of a packaging company as an example, the FDMKG was applied to construct the dynamic knowledge graph. The results show that FDMKG achieves query performance improvements ranging from 1.3 to 26.4 times and attains high diagnostic accuracy with a precision of 0.92, a recall of 0.90, and an F1-score of 0.91. Furthermore, FDMKG efficiently organizes and reuses knowledge throughout the production process, enhancing manufacturing knowledge traceability and reasoning. This study provides valuable practical guidance for knowledge management applications in manufacturing enterprises. Nevertheless, this study focuses on manufacturing production processes, future research should incorporate real-time data from diverse industries to construct a cross-industry dynamic knowledge graph.

The knowledge graph is a means of visualizing data to aid information analysis and understanding. In this paper, we construct a novel dynamic financial knowledge graph, which utilizes time information to capture data changes and trends over time. Firstly, the basic dynamic financial knowledge graph is constructed through structured and semi-structured data related to A-share. Then, using the transfer learning algorithms, we train the financial entity recognition models based on BERT, BiLSTM, and CRF. Next, we train the financial entity linking models based on similarity features and prior knowledge. After that, to alleviate the noise brought by distant supervision, we explore to train the financial relation classification models with the help of reinforcement learning. Finally, we implement the dynamic knowledge graph based on these models and their predictions. Additionally, a display website is designed and implemented to dynamically display the structural changes of the knowledge graph over time. The financial knowledge graph constructed in this paper is practical and the construction pipeline provides insights for a professional dynamic knowledge graph as well.

Continuous subgraph matching problem on dynamic graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including information retrieval and community detection. Specifically, given a query graph q , an initial graph G 0 , and a graph update stream △ G i , the problem of continuous subgraph matching is to sequentially conduct all possible isomorphic subgraphs covering △ G i of q on G i (= G 0 ⊕ △ G i ). Since knowledge graph is a directed labeled multigraph having multiple edges between a pair of vertices, it brings new challenges for the problem focusing on dynamic knowledge graph. One challenge is that the multigraph characteristic of knowledge graph intensifies the complexity of candidate calculation, which is the combination of complex topological and attributed structures. Another challenge is that the isomorphic subgraphs covering a given region are conducted on a huge search space of seed candidates, which causes a lot of time consumption for searching the unpromising candidates. To address these challenges, a method of subgraph-indexed sequential subdivision is proposed to accelerating the continuous subgraph matching on dynamic knowledge graph. Firstly, a flow graph index is proposed to arrange the search space of seed candidates in topological knowledge graph and an adjacent index is designed to accelerate the identification of candidate activation states in attributed knowledge graph. Secondly, the sequential subdivision of flow graph index and the transition state model are employed to incrementally conduct subgraph matching and maintain the regional influence of changed candidates, respectively. Finally, extensive empirical studies on real and synthetic graphs demonstrate that our techniques outperform the state-of-the-art algorithms.

Large transformer-based language models have achieved incredible success at various tasks which require narrative comprehension, including story completion, answering questions about stories, and generating stories ex nihilo. However, due to the limitations of finite context windows, these language models struggle to produce or understand stories longer than several thousand tokens. In order to mitigate the document length limitations that come with finite context windows, we introduce a novel architecture that augments story processing with an external dynamic knowledge graph. In contrast to static commonsense knowledge graphs which hold information about the real world, these dynamic knowledge graphs reflect facts extracted from the story being processed. Our architecture uses these knowledge graphs to create information-rich prompts which better facilitate story comprehension than prompts composed only of story text. We apply our architecture to the tasks of question answering and story completion. To complement this line of research, we introduce two long-form question answering tasks, LF-SQuAD and LF-QUOREF, in which the document length exceeds the size of the language model's context window, and introduce a story completion evaluation method that bypasses the stochastic nature of language model generation. We demonstrate broad improvement over typical prompt formulation methods for both question answering and story completion using GPT-2, GPT-3 and XLNet.

Knowledge graphs (KGs) have increasingly become the backbone of many critical knowledge-centric applications. Most large-scale KGs used in practice are automatically constructed based on an ensemble of extraction techniques applied over diverse data sources. Therefore, it is important to establish the provenance of results for a query to determine how these were computed. Provenance is shown to be useful for assigning confidence scores to the results, for debugging the KG generation itself, and for providing answer explanations. In many such applications, certain queries are registered as standing queries since their answers are needed often. However, KGs keep continuously changing due to reasons such as changes in the source data, improvements to the extraction techniques, refinement/enrichment of information, and so on. This brings us to the issue of efficiently maintaining the provenance polynomials of complex graph pattern queries for dynamic and large KGs instead of having to recompute them from scratch each time the KG is updated. Addressing these issues, we present HUKA which uses provenance polynomials for tracking the derivation of query results over knowledge graphs by encoding the edges involved in generating the answer. More importantly, HUKA also maintains these provenance polynomials in the face of updates---insertions as well as deletions of facts---to the underlying KG. Experimental results over large real-world KGs such as YAGO and DBpedia with various benchmark SPARQL query workloads reveals that HUKA can be almost 50 times faster than existing systems for provenance computation on dynamic KGs.

At present, there are several issues with large-scale domain dynamic knowledge graphs including incomplete acquisition of original data, low accuracy with knowledge extraction and knowledge fusion, as well as un nonuniform semantic relations between entities. This paper constructs dynamic knowledge graph based on ontology modeling and Neo4j graph database. The ontology data model built based on the “seven-step method” effectively avoids the filling of instances without concept classes in the original data, while removing concepts with low user attention or learning value, which ensures integrity of original data acquisition, efficiency and accuracy of knowledge extraction and fusion, as well as rationality of logical relations between classes. Based on the ontology constraints and the mapping between the ontology model and Neo4j graph database, large-scale domain dynamic knowledge graph is achieved. We apply this scheme in the field of agricultural informatization and receive satisfying experimental results. In future work, we plan to explore multi-modal dynamic knowledge graph.

The proliferation of digital building models in recent years has led to a corresponding rise in specialised, non-interoperable models. These models impede sustainable developments by forming data silos that hinder cross-application data exchange and knowledge discovery processes. Although Semantic Web solutions hold promise in addressing these silos, current approaches primarily focus on developing novel ontologies, yielding similar outcomes. But it is unclear how these methodologies could support broader knowledge discovery processes and application requirements. This paper addresses these research challenges by introducing a dynamic knowledge graph as implemented within The World Avatar for interoperable building models. We demonstrate its value through two distinct applications in urban energy management and laboratory automation. The dynamic knowledge graph revolves around a comprehensive structured knowledge model constructed from ontologies and agents. Ontologies semantically annotate data and represent domain knowledge and their relationships with standardised definitions. When augmented with an agent architecture, the resulting knowledge model can align stakeholder perspectives and accommodate the dynamic and scalable nature of urban data. Moreover, the dynamic knowledge graph fosters innovative human-machine interactions through visualisation interfaces to augment knowledge discovery processes in the built environment for greater efficiencies and innovation. As the knowledge model expands, users gain access to a broader spectrum of private and public data sources and technologies, while reducing integration barriers. This is especially pertinent for smaller and less influential entities like municipal and local governments with limited resources, who can realise substantial benefits at reduced costs.

Knowledge building is the production and continual improvement of ideas of value to a community, which attaches importance to conceptual engagement and contribution. However, knowledge building community will accumulate large and complex semi-structured educational data over time. It is not conducive to the continuation of in-depth knowledge building activities. To overcome these issues, we propose a dynamic educational knowledge graph with information entropy (IE-DEKG) model for knowledge building community. The model can construct dynamic knowledge graphs that contain instructional concepts and educational relations for learners. Specifically, it adopts the mutual information and adjacent information entropy to detect new terminologies on pedagogical data, and then the topic modeling algorithm is utilized to extract instructional concepts. Moreover, the model employs association rule mining to identify the prerequisite relations and uses pattern matching to obtain the inclusion relations. For the sake of satisfying the needs of educational applications and services, we design and implement the dynamic educational knowledge graph system. Experimental results demonstrate that the proposed IE-DEKG method outperforms the state-of-the-art methods.

Dynamic knowledge graphs, which capture evolving relationships among entities over time, are becoming increasingly important in various domains such as social networks, recommendation systems, finance domain and biomedical research. This research paper investigates the effectiveness of Graph Neural Networks (GNNs) for link prediction in dynamic knowledge graphs. By leveraging the temporal dynamics of the graph, we propose novel GNN architectures and evaluate their performance against state-of- the-art methods on real-world datasets. The results demonstrate the capability of GNNs to effectively capture evolving relationships and make accurate predictions in dynamic knowledge graphs, providing valuable insights for applications in various domains. Keywords—Graph Neural Networks,Temporal Dynamics,Deep learning,DeepLearning,Link Prediction

This paper introduces a dynamic knowledge-graph approach for digital twins and illustrates how this approach is by design naturally suited to realizing the vision of a Universal Digital Twin. The dynamic knowledge graph is implemented using technologies from the Semantic Web. It is composed of concepts and instances that are defined using ontologies, and of computational agents that operate on both the concepts and instances to update the dynamic knowledge graph. By construction, it is distributed, supports cross-domain interoperability, and ensures that data are connected, portable, discoverable, and queryable via a uniform interface. The knowledge graph includes the notions of a “base world” that describes the real world and that is maintained by agents that incorporate real-time data, and of “parallel worlds” that support the intelligent exploration of alternative designs without affecting the base world. Use cases are presented that demonstrate the ability of the dynamic knowledge graph to host geospatial and chemical data, control chemistry experiments, perform cross-domain simulations, and perform scenario analysis. The questions of how to make intelligent suggestions for alternative scenarios and how to ensure alignment between the scenarios considered by the knowledge graph and the goals of society are considered. Work to extend the dynamic knowledge graph to develop a digital twin of the UK to support the decarbonization of the energy system is discussed. Important directions for future research are highlighted.

Time series prediction is an important problem in machine learning. Previous methods for time series prediction did not involve additional information. With a lot of dynamic knowledge graphs available, we can use this additional information to predict the time series better. Recently, there has been a focus on the application of deep representation learning on dynamic graphs. These methods predict the structure of the graph by reasoning over the interactions in the graph at previous time steps. In this paper, we propose a new framework to incorporate the information from dynamic knowledge graphs for time series prediction. We show that if the information contained in the graph and the time series data are closely related, then this inter-dependence can be used to predict the time series with improved accuracy. Our framework, DArtNet, learns a static embedding for every node in the graph as well as a dynamic embedding which is dependent on the dynamic attribute value (time-series). Then it captures the information from the neighborhood by taking a relation specific mean and encodes the history information using RNN. We jointly train the model link prediction and attribute prediction. We evaluate our method on five specially curated datasets for this problem and show a consistent improvement in time series prediction results. We release the data and code of model DArtNet for future research.

Multi-hop question answering (MHQA) poses a significant challenge for large language models (LLMs) due to the extensive knowledge demands involved. Knowledge editing, which aims to precisely modify the LLMs to incorporate specific knowledge without negatively impacting other unrelated knowledge, offers a potential solution for addressing MHQA challenges with LLMs. However, current solutions struggle to effectively resolve issues of knowledge conflicts. Most parameter-preserving editing methods are hindered by inaccurate retrieval and overlook secondary editing issues, which can introduce noise into the reasoning process of LLMs. In this paper, we introduce KEDKG, a novel knowledge editing method that leverages a dynamic knowledge graph for MHQA, designed to ensure the reliability of answers. KEDKG involves two primary steps: dynamic knowledge graph construction and knowledge graph augmented generation. Initially, KEDKG autonomously constructs a dynamic knowledge graph to store revised information while resolving potential knowledge conflicts. Subsequently, it employs a fine-grained retrieval strategy coupled with an entity and relation detector to enhance the accuracy of graph retrieval for LLM generation. Experimental results on benchmarks show that KEDKG surpasses previous state-of-the-art models, delivering more accurate and reliable answers in environments with dynamic information.

Data-driven, knowledge-grounded neural conversation models are capable of generating more informative responses. However, these models have not yet demonstrated that they can zero-shot adapt to updated, unseen knowledge graphs. This paper proposes a new task about how to apply dynamic knowledge graphs in neural conversation model and presents a novel TV series conversation corpus (DyKgChat) for the task. Our new task and corpus aids in understanding the influence of dynamic knowledge graphs on responses generation. Also, we propose a preliminary model that selects an output from two networks at each time step: a sequence-to-sequence model (Seq2Seq) and a multi-hop reasoning model, in order to support dynamic knowledge graphs. To benchmark this new task and evaluate the capability of adaptation, we introduce several evaluation metrics and the experiments show that our proposed approach outperforms previous knowledge-grounded conversation models. The proposed corpus and model can motivate the future research directions.

Besides data sparsity and cold start, recommender systems often face the problems of selection bias and exposure bias. These problems influence the accuracy of recommendations and easily lead to overrecommendations. This paper proposes a recommendation approach based on heterogeneous network and dynamic knowledge graph (HN-DKG). The main steps include (1) determining the implicit preferences of users according to user’s cross-domain and cross-platform behaviors to form multimodal nodes and then building a heterogeneous knowledge graph; (2) Applying an improved multihead attention mechanism of the graph attention network (GAT) to realize the relationship enhancement of multimodal nodes and constructing a dynamic knowledge graph; and (3) Leveraging RippleNet to discover user’s layered potential interests and rating candidate items. In which, some mechanisms, such as user seed clusters, propagation blocking, and random seed mechanisms, are designed to obtain more accurate and diverse recommendations. In this paper, the public datasets are used to evaluate the performance of algorithms, and the experimental results show that the proposed method has good performance in the effectiveness and diversity of recommendations. On the MovieLens-1M dataset, the proposed model is 18%, 9%, and 2% higher than KGAT on F1, NDCG@10, and AUC and 20%, 2%, and 0.9% higher than RippleNet, respectively. On the Amazon Book dataset, the proposed model is 12%, 3%, and 2.5% higher than NFM on F1, NDCG@10, and AUC and 0.8%, 2.3%, and 0.35% higher than RippleNet, respectively.

In assembly sequence planning (ASP) of complex products, hierarchical structure, geometric feasibility, assembly tool changes, and assembly direction changes should be fully considered. Since the traditional information models of ASP are mostly static and abstract matrices, the outdated information reduces sequence rationality and increases time costs. To address these limitations, a novel decision-making framework based on dynamic knowledge graph (DKG) is proposed to build an intuitive semantic information model, planning the assembly sequences of complex products. An automated DKG generation method with updating mechanisms is designed to ensure that the DKG remains effective throughout the construction and maintenance process. A double-layer degree ordering algorithm (DDOA) is proposed to analyze sequence constraints within the DKG for obtaining a higher-quality assembly sequence. Comparative experiments demonstrated that the DDOA exhibits optimal performance. The solved assembly sequence possesses the best value of the objective function, with the fewest changes in assembly directions and assembly tools, as well as the shortest runtime.