PG-CODE: Latent dirichlet allocation embedded policy knowledge graph for government department coordination

Abstract

Government policy-group integration and policy-chain inference are significant to the execution of strategies in current Chinese society. Specifically, the coordination of hierarchical policies implemented among government departments is one of the key challenges to rural revitalization. In recent years, various well-established quantitative methods have been proposed to evaluate policy coordination, but the majority of these relied on manual analysis, which can lead to subjective results. Thus, in this paper, a novel approach called "policy knowledge graph for the coordination among the government departments" (PG-CODE) is proposed, which incorporates topic modeling into policy knowledge graphs. Similar to a knowledge graph, a policy knowledge graph uses a graph-structured data model to integrate policy discourse. With latent Dirichlet allocation embedding, a policy knowledge graph could capture the underlying topics of the policies. Furthermore, coordination strength and topic diffusion among hierarchical departments could be inferred from the PG-CODE, as it can provide a better representation of coordination within the policy space. We implemented and evaluated the PG-CODE in the field of rural innovation and entrepreneurship policy, and the results effectively demonstrate improved coordination among departments.

Revealing security vulnerabilities of chinese local government websites through topology analysis and knowledge graph

“…Kang Y et al focused on creating knowledge graphs for government policies. They integrated policy details and core themes to form policy knowledge graphs that facilitate interdepartmental coordination and allow for quantitative analysis of policy consistency between central and local governments, aiding policymakers [2]. Iordanou C et al applied statistical inference methods to identify similarities and significance across various fields, offering a novel approach to understanding complex network structures and guiding future research and prediction [3].…”

Multi-strategy KOA Algorithm for Optimizing Gated Recurrent Cell Networks in Automatic Writing Scoring Method Design

“…Literature [11] proposes the matching rate of n-order word elements as the scoring rule, and at the same time introduces the length penalty ratio to solve the problem of high scores for short sentences; literature [12] analyzes the writing scoring features from the perspectives of literal overlap, keywords, semantics, etc., and constructs the writing automatic scoring model. Writing automatic scoring model methods include feature engineering-based machine learning methods, deep learning-based methods, and hybrid model-based methods [13]. Literature [14] uses convolutional neural network to obtain sentence features and proposes an automatic scoring method for composition by fusing topic features; Literature [15] extracts artificial features based on grammaticalsyntactic rules for composition scoring and scores the composition by using a support vector machine; Literature [16] constructs an automatic scoring system for composition by extracting a variety of compositional features, such as words, sentences, and so on, and by using the random forest algorithm; Literature [ 17] extracts the feature set from three aspects, such as word frequency, word size, distribution location, etc., and uses random forest to score the composition; literature [18] uses a hybrid neural network model to identify and analyze the gracefully entering boards in the compositions; literature [19] firstly uses deep neural network to obtain the semantic representation of the compositions, and then, combined with manually extracted compositions features such as the number of misspelled words and the number of characters, it uses the XGboost classifier to predict and analyze the composition score.…”