Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (1,371)

Search Parameters:
Keywords = knowledge graph

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
21 pages, 3376 KiB  
Article
Information Extraction of Aviation Accident Causation Knowledge Graph: An LLM-Based Approach
by Lu Chen, Jihui Xu, Tianyu Wu and Jie Liu
Electronics 2024, 13(19), 3936; https://doi.org/10.3390/electronics13193936 (registering DOI) - 5 Oct 2024
Viewed by 258
Abstract
Summarizing the causation of aviation accidents is conducive to enhancing aviation safety. The knowledge graph of aviation accident causation, constructed based on aviation accident reports, can assist in analyzing the causes of aviation accidents. With the continuous development of artificial intelligence technology, leveraging [...] Read more.
Summarizing the causation of aviation accidents is conducive to enhancing aviation safety. The knowledge graph of aviation accident causation, constructed based on aviation accident reports, can assist in analyzing the causes of aviation accidents. With the continuous development of artificial intelligence technology, leveraging large language models for information extraction and knowledge graph construction has demonstrated significant advantages. This paper proposes an information extraction method for aviation accident causation based on Claude-prompt, which relies on the large-scale pre-trained language model Claude 3.5. Through prompt engineering, combined with a few-shot learning strategy and a self-judgment mechanism, this method achieves automatic extraction of accident-cause entities and their relationships. Experimental results indicate that this approach effectively improves the accuracy of information extraction, overcoming the limitations of traditional methods in terms of accuracy and efficiency in processing complex texts. It provides strong support for subsequently constructing a structured knowledge graph of aviation accident causation and conducting causation analysis of aviation accidents. Full article
(This article belongs to the Section Artificial Intelligence)
Show Figures

Figure 1

Figure 1
<p>Process of knowledge graph building and application.</p>
Full article ">Figure 2
<p>Process of accident data collection.</p>
Full article ">Figure 3
<p>Construction of AACKG ontology.</p>
Full article ">Figure 4
<p>Concepts in AACKG ontology.</p>
Full article ">Figure 5
<p>Principles of large language models processing raw data.</p>
Full article ">Figure 6
<p>Framework of Claude-prompt method-based information extraction.</p>
Full article ">Figure 7
<p>An example of self -judgment mechanis.</p>
Full article ">Figure 8
<p>Claude-prompt model self-judgment mechanism workflow.</p>
Full article ">Figure 9
<p>Information Extraction Process Based on Deep Learning.</p>
Full article ">
15 pages, 2841 KiB  
Article
Named Entity Recognition for Equipment Fault Diagnosis Based on RoBERTa-wwm-ext and Deep Learning Integration
by Feifei Gao, Lin Zhang, Wenfeng Wang, Bo Zhang, Wei Liu, Jingyi Zhang and Le Xie
Electronics 2024, 13(19), 3935; https://doi.org/10.3390/electronics13193935 (registering DOI) - 5 Oct 2024
Viewed by 256
Abstract
Equipment fault diagnosis NER is to extract specific entities from Chinese equipment fault diagnosis text, which is the premise of constructing an equipment fault diagnosis knowledge graph. Named entity recognition for equipment fault diagnosis can also provide important data support for equipment maintenance [...] Read more.
Equipment fault diagnosis NER is to extract specific entities from Chinese equipment fault diagnosis text, which is the premise of constructing an equipment fault diagnosis knowledge graph. Named entity recognition for equipment fault diagnosis can also provide important data support for equipment maintenance support. Equipment fault diagnosis text has complex semantics, fuzzy entity boundaries, and limited data size. In order to extract entities from the equipment fault diagnosis text, this paper presents an NER model for equipment fault diagnosis based on RoBERTa-wwm-ext and Deep Learning network integration. Firstly, this model uses the RoBERTa-wwm-ext to extract context-sensitive embeddings of text sequences. Secondly, the context feature information is obtained through the BiLSTM network. Thirdly, the CRF is combined to output the label sequence with a constraint relationship, improve the accuracy of sequence labeling task, and complete the entity recognition task. Finally, experiments and predictions are carried out on the constructed dataset. The results show that the model can effectively identify five types of equipment fault diagnosis entities and has higher evaluation indexes than the traditional model. Its precision, recall, and F1 value are 94.57%, 95.39%, and 94.98%, respectively. The case study proves that the model can accurately recognize the entity of the input text. Full article
Show Figures

Figure 1

Figure 1
<p>NER model based on RoBERTa-wwm-ext-BiLSTM-CRF network.</p>
Full article ">Figure 2
<p>The structure of Transformer.</p>
Full article ">Figure 3
<p>The structure of BERT.</p>
Full article ">Figure 4
<p>Input representation of BERT.</p>
Full article ">Figure 5
<p>Input representation of RoBERTa-wwm-ext.</p>
Full article ">Figure 6
<p>The internal structure of an LSTM network unit.</p>
Full article ">Figure 7
<p>The structure of BiLSTM network.</p>
Full article ">Figure 8
<p>The structure of CRF.</p>
Full article ">Figure 9
<p>Variation of F1 value as the number of training epochs increases.</p>
Full article ">Figure 10
<p>Entity recognition of the input text by the model.</p>
Full article ">
24 pages, 4755 KiB  
Article
A Method for Constructing an Urban Waterlogging Emergency Knowledge Graph Based on Spatiotemporal Processes
by Wei Mao, Jie Shen, Qian Su, Sihu Liu, Saied Pirasteh and Kunihiro Ishii
ISPRS Int. J. Geo-Inf. 2024, 13(10), 349; https://doi.org/10.3390/ijgi13100349 - 3 Oct 2024
Viewed by 232
Abstract
Urban waterlogging is one of the major “diseases” faced by cities, posing a great challenge to the healthy and sustainable development of cities. The traditional geographic knowledge graph struggles to capture dynamic changes in urban waterlogging over time. Therefore, the objective of this [...] Read more.
Urban waterlogging is one of the major “diseases” faced by cities, posing a great challenge to the healthy and sustainable development of cities. The traditional geographic knowledge graph struggles to capture dynamic changes in urban waterlogging over time. Therefore, the objective of this study is to analyze the time, events, properties, geographic objects, and activities associated with urban waterlogging emergency responses from the geographic spatial and temporal processes perspective and to construct an urban waterlogging emergency knowledge graph by combining top-down and bottom-up approaches. We propose a conceptual model of urban waterlogging emergency response ontology based on spatiotemporal processes by analyzing the basic laws and influencing factors of urban waterlogging occurrence and development. Secondly, we describe the construction process of the urban waterlogging emergency response knowledge graph from knowledge extraction, knowledge fusion, and knowledge storage. Finally, the knowledge graph was visualized using 159 urban waterlogging events in China from 2020–2022, with a quality assessment indicating 81% correctness, 65.5% completeness, and 95% data conciseness. The results show that this method can effectively express the spatiotemporal process of an urban waterlogging emergency response and can provide a reference for the spatiotemporal modeling of the knowledge graph. Full article
(This article belongs to the Topic Geospatial Knowledge Graph)
18 pages, 385 KiB  
Article
A Brief Survey on Deep Learning-Based Temporal Knowledge Graph Completion
by Ningning Jia and Cuiyou Yao
Appl. Sci. 2024, 14(19), 8871; https://doi.org/10.3390/app14198871 - 2 Oct 2024
Viewed by 273
Abstract
Temporal knowledge graph completion (TKGC) is the task of inferring missing facts based on existing ones in a temporal knowledge graph. In recent years, various TKGC methods have emerged, among which deep learning-based methods have achieved state-of-the-art performance. In order to understand the [...] Read more.
Temporal knowledge graph completion (TKGC) is the task of inferring missing facts based on existing ones in a temporal knowledge graph. In recent years, various TKGC methods have emerged, among which deep learning-based methods have achieved state-of-the-art performance. In order to understand the current research status of TKGC methods based on deep learning and promote further development in this field, in this paper, for the first time, we summarize the deep learning-based methods in TKGC research. First, we detail the background of TKGC, including task definition, benchmark datasets, and evaluation protocol. Then, we divide the existing deep learning-based TKGC methods into eight fine-grained categories according to their core technology and summarize them. Finally, we conclude the paper and present three future research directions for TKGC. Full article
Show Figures

Figure 1

Figure 1
<p>A knowledge graph example that contains temporal information [<a href="#B10-applsci-14-08871" class="html-bibr">10</a>].</p>
Full article ">
19 pages, 3180 KiB  
Review
Knowledge Mapping of Cultural Ecosystem Services Applied on Blue-Green Infrastructure—A Scientometric Review with CiteSpace
by Jinfeng Li, Haiyun Xu, Mujie Ren, Jiaxuan Duan, Weiwen You and Yuan Zhou
Forests 2024, 15(10), 1736; https://doi.org/10.3390/f15101736 - 30 Sep 2024
Viewed by 329
Abstract
Urban blue-green infrastructure (BGI) not only serves an ecological purpose but also contributes to the physical and psychological well-being of residents by providing cultural ecosystem services (CES), which are the nonmaterial benefits people obtain from ecosystems through spiritual enrichment, cognitive development, reflection, recreation, [...] Read more.
Urban blue-green infrastructure (BGI) not only serves an ecological purpose but also contributes to the physical and psychological well-being of residents by providing cultural ecosystem services (CES), which are the nonmaterial benefits people obtain from ecosystems through spiritual enrichment, cognitive development, reflection, recreation, and aesthetic experiences. CES is a rising BGI research and management subject, with a growing number of papers in recent years. To identify and differentiate the latest research on the development of features based on cultural ecosystem services within blue-green infrastructure, we employed CiteSpace bibliometric methodologies to analyze pertinent papers for focusing on the developmental processes and key research areas. The publishing trend, research clusters, highly cited literature, research history, research frontiers and hot areas, and high-frequency and emerging keywords were studied and assessed after reviewing 14,344 relevant papers by CiteSpace software 6.3.1 from Web of Science. The standard domains concerned, according to the keyword visualization and high-value references, are implemented cultural ecosystem services assessment combined with natural-based solutions in green spaces, urban regions, residential areas, and sustainable development. In conclusion, the following recommendations are made: (1) When urban decision-makers incorporate the perspective of cultural ecosystem services into the strategic formulation of BGI, a broader spectrum of urban BGI types should be taken into account; (2) all categories of CES should be considered; (3) research on the application of cultural ecosystem services in urban blue-green infrastructure should be more effectively and flexibly integrated into urban governance; and (4) CES should be strategically employed to improve the physical health and psychological well-being of urban residents. Full article
(This article belongs to the Special Issue Forest Ecosystem Services and Landscape Design: 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>Research framework including data collection and analysis.</p>
Full article ">Figure 2
<p>Total number of postings on the use of CES in BGI. The solid line in the figure represents the number of relevant papers published each year, while the dashed line represents the function y = 53.023e<sup>0.2395x</sup>, illustrating the trend in publication volume.</p>
Full article ">Figure 3
<p>Visualization of co-cited network clustering [<a href="#B3-forests-15-01736" class="html-bibr">3</a>,<a href="#B31-forests-15-01736" class="html-bibr">31</a>,<a href="#B32-forests-15-01736" class="html-bibr">32</a>,<a href="#B33-forests-15-01736" class="html-bibr">33</a>,<a href="#B34-forests-15-01736" class="html-bibr">34</a>,<a href="#B35-forests-15-01736" class="html-bibr">35</a>,<a href="#B36-forests-15-01736" class="html-bibr">36</a>,<a href="#B37-forests-15-01736" class="html-bibr">37</a>,<a href="#B38-forests-15-01736" class="html-bibr">38</a>,<a href="#B39-forests-15-01736" class="html-bibr">39</a>,<a href="#B40-forests-15-01736" class="html-bibr">40</a>,<a href="#B41-forests-15-01736" class="html-bibr">41</a>,<a href="#B42-forests-15-01736" class="html-bibr">42</a>,<a href="#B43-forests-15-01736" class="html-bibr">43</a>,<a href="#B44-forests-15-01736" class="html-bibr">44</a>,<a href="#B45-forests-15-01736" class="html-bibr">45</a>,<a href="#B46-forests-15-01736" class="html-bibr">46</a>,<a href="#B47-forests-15-01736" class="html-bibr">47</a>,<a href="#B48-forests-15-01736" class="html-bibr">48</a>,<a href="#B49-forests-15-01736" class="html-bibr">49</a>,<a href="#B50-forests-15-01736" class="html-bibr">50</a>,<a href="#B51-forests-15-01736" class="html-bibr">51</a>,<a href="#B52-forests-15-01736" class="html-bibr">52</a>,<a href="#B53-forests-15-01736" class="html-bibr">53</a>].</p>
Full article ">Figure 4
<p>Time line of the outbreak of related literature studies in different clusters.</p>
Full article ">Figure 5
<p>Top15 high-frequency keywords and their bursting time diagram.</p>
Full article ">
22 pages, 2677 KiB  
Article
Assessing Credibility in Bayesian Networks Structure Learning
by Vitor Barth, Fábio Serrão and Carlos Maciel
Entropy 2024, 26(10), 829; https://doi.org/10.3390/e26100829 - 30 Sep 2024
Viewed by 307
Abstract
Learning Bayesian networks from data aims to create a Directed Acyclic Graph that encodes significant statistical relationships between variables and their joint probability distributions. However, when using real-world data with limited knowledge of the original dynamical system, it is challenging to determine if [...] Read more.
Learning Bayesian networks from data aims to create a Directed Acyclic Graph that encodes significant statistical relationships between variables and their joint probability distributions. However, when using real-world data with limited knowledge of the original dynamical system, it is challenging to determine if the learned DAG accurately reflects the underlying relationships, especially when the data come from multiple independent sources. This paper describes a methodology capable of assessing the credible interval for the existence and direction of each edge within Bayesian networks learned from data, without previous knowledge of the underlying dynamical system. It offers several advantages over classical methods, such as data fusion from multiple sources, identification of latent variables, and extraction of the most prominent edges with their respective credible interval. The method is evaluated using simulated datasets of various sizes and a real use case. Our approach was verified to achieve results comparable to the most recent studies in the field, while providing more information on the model’s credibility. Full article
(This article belongs to the Special Issue Probabilistic Models for Dynamical Systems)
Show Figures

Figure 1

Figure 1
<p>Example Bayesian network, adapted from Neapolitan [<a href="#B16-entropy-26-00829" class="html-bibr">16</a>]. This example has joint probabilities ranging from 75% to 0.005%, which requires a large dataset for containing all the possible relationships, making it ideal for evaluating the impact of dataset size on the confidence of learning a Bayesian network.</p>
Full article ">Figure 2
<p>Observed frequency of each edge using 100 samples (100 resamples, 10 samples each), according to the edge width. As expected, relationships such as <math display="inline"><semantics> <mrow> <mi>L</mi> <mo>→</mo> <mi>C</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>L</mi> <mo>→</mo> <mi>F</mi> </mrow> </semantics></math> are more frequent than <math display="inline"><semantics> <mrow> <mi>H</mi> <mo>→</mo> <mi>L</mi> </mrow> </semantics></math>. The thickness of the edges indicate that there is not a convergence, and selecting the most probable edges would bring an almost fully connected graph. Edges colored in green are present in the original model, and edges colored in red are not.</p>
Full article ">Figure 3
<p>The posterior probability of the presence of the edge <math display="inline"><semantics> <mrow> <mi>H</mi> <mo>→</mo> <mi>F</mi> </mrow> </semantics></math> when using 10 samples to learn the Bayesian network (BN). This particular edge is considered to have a low likelihood of existence, with a mean of 22% and a 95% credible interval ranging from 14% to 29%. The 95% credible interval, highlighted by the bold line at the bottom, remains entirely to the left of the 50% threshold indicated by the vertical orange line. Consequently, when evaluated by an estimator, it will be classified as non-existent.</p>
Full article ">Figure 4
<p>Observed frequency of each edge using 1000 samples, according to the edge width. Now, the edge concentration is much more precise, since now it only has a few thick edges. Edges colored in green are present in the original model, and edges colored in red are not.</p>
Full article ">Figure 5
<p>Observed frequency of each edge using 1,000,000 samples, according to the edge width. Looking at the frequency of the edges, we can see that some edges are more prevalent, including previously unseen (<math display="inline"><semantics> <mrow> <mi>H</mi> <mo>←</mo> <mi>L</mi> </mrow> </semantics></math>). Green edges are present in the original model, and red edges are not.</p>
Full article ">Figure 6
<p>Graphical representation of the LUCAS network. It contains 12 variables, where <span class="html-italic">lung cancer</span> is usually treated as the target. It contains five colliders, two common-cause relationships and an independent variable, making it a useful benchmark for Bayesian networks structure learning algorithms.</p>
Full article ">Figure 7
<p>Probability distributions of edges existence (<b>left</b>) and direction (<b>right</b>) for the Lucas0 synthetic dataset. Edges with a low probability of existence can be seen to have a larger credible interval in evaluating their directions. The top edges are most likely absent, and the lower edges are most probably present in the evaluated model.</p>
Full article ">Figure 8
<p>Method performance comparison with 10,000 samples, containing network structures learned using (<b>a</b>) the MAP of the proposed algorithm; (<b>b</b>) Local Search using the BDeu Score; (<b>c</b>) Local Search using the BIC score; (<b>d</b>) the PC algorithm. Black edges were found in the correct direction, orange edges were found on the opposite direction, dotted grey edges were not present, and red edges are spurious.</p>
Full article ">Figure 9
<p>Raw EMG signal collected over the <span class="html-italic">vastus medialis</span> muscle, from Subject 9 with PFP, during the first 3 s of the session. The first major activation is delimited by the red markers. During activation, it contains spikes with negative and positive voltages, mirrored over the x-axis.</p>
Full article ">Figure 10
<p>Diagram showing the steps for processing the EMG signals and the result of each step using as example the first major activation of the <span class="html-italic">vastus medialis</span> muscle, from Individual 9 with PFP.</p>
Full article ">Figure 11
<p>Bayesian networks of EMG relationships in healthy (<b>a</b>) and subjects with PFP (<b>b</b>). Color labels: (<b>a</b>) Red: Subject 1; Blue: Subject 4; Green: Subject 10; Magenta: Subject 40. (<b>b</b>) Red: Subject 49; Blue: Subject 53; Green: Subject 61; Magenta: Subject 64.</p>
Full article ">Figure 12
<p>Posterior distribution plots of the 10 most credible edges among healthy runners, with the dotted lines indicate the 95% credible interval. Red shows the probability distribution of edge non-existence, blue shows existence in the left direction (e.g., <span class="html-italic">gluteus maximus</span> →<span class="html-italic">tibialis anterior</span> for the first plot), and green in the right direction (e.g., <span class="html-italic">tibialis anterior</span>→ <span class="html-italic">gluteus maximus</span> for the first plot). None of them have a maxima a posteriori which indicates their existence.</p>
Full article ">
23 pages, 5181 KiB  
Article
Driving Sustainable Cultural Heritage Tourism in China through Heritage Building Information Modeling
by Zhiwei Zhou, Zhen Liu and Genqiao Wang
Buildings 2024, 14(10), 3120; https://doi.org/10.3390/buildings14103120 - 29 Sep 2024
Viewed by 394
Abstract
In recent years, applying building information modeling (BIM) digital technologies to cultural heritage management, monitoring, restoration, with the objective of advancing the sustainable development of both cultural heritage protection and tourism in China, has become a prominent research focus. However, there are a [...] Read more.
In recent years, applying building information modeling (BIM) digital technologies to cultural heritage management, monitoring, restoration, with the objective of advancing the sustainable development of both cultural heritage protection and tourism in China, has become a prominent research focus. However, there are a few studies that comprehensively investigate the relationship between BIM, Chinese cultural heritage, and sustainable tourism development. In order to explore the application of BIM in the protection and inheritance of Chinese cultural heritage, as well as its potential in promoting the sustainable development of cultural heritage tourism, this paper adopts the quantitative research method of bibliometrics to explore the research hotspots, development background, and evolution trends of BIM-driven sustainable development in Chinese cultural heritage tourism. By using data obtained from the China Knowledge Network database, multi-level bibliometrics analysis has been conducted through visualized knowledge graphs. The results suggest that the popular research keywords for driving sustainable cultural heritage tourism in China through BIM since year 2000 (23 years) include heritage tourism, heritage protection, building heritage, digital technology, and tourism development. Three research hotspots have been identified, which are cultural heritage protection, cultural heritage tourism development, and cultural heritage tourism management. In terms of tourism development and management, building virtual interactive scenes of cultural heritage facilitated by BIM to enhance tourism experience of tourists, using BIM to assist in efficient management, intelligent decision-making, and personalized services of cultural heritage tourism, assist in better promoting the sustainable development of cultural heritage tourism. In terms of coordinating and managing stakeholders in cultural heritage tourism, BIM technology provides technical support to the government, industry managers, and community residents in information communication, and industry management by constructing a digital model of cultural heritage to better balance the rights and interests of stakeholders. Full article
Show Figures

Figure 1

Figure 1
<p>The flow of the research method (generated by authors).</p>
Full article ">Figure 2
<p>The number of published articles in the China National Knowledge Internet (CNKI) from year 2000 to 2023 on building information modeling (BIM), Chinese cultural heritage, and sustainable tourism (generated by authors).</p>
Full article ">Figure 3
<p>Distribution of subject areas involved in the research literature (264 articles) on BIM, Chinese cultural heritage, and sustainable tourism (generated by authors).</p>
Full article ">Figure 4
<p>Keyword co-occurrence map on BIM, Chinese cultural heritage, and sustainable tourism (generated by authors).</p>
Full article ">Figure 5
<p>Keyword clustering map on BIM, Chinese cultural heritage, and sustainable tourism (generated by authors).</p>
Full article ">Figure 6
<p>Keyword clustering timeline map on BIM, Chinese cultural heritage, and sustainable tourism (generated by authors).</p>
Full article ">
20 pages, 996 KiB  
Article
Entity Linking Model Based on Cascading Attention and Dynamic Graph
by Hongchan Li, Chunlei Li, Zhongchuan Sun and Haodong Zhu
Electronics 2024, 13(19), 3845; https://doi.org/10.3390/electronics13193845 - 28 Sep 2024
Viewed by 291
Abstract
The purpose of entity linking is to connect entity mentions in text to real entities in the knowledge base. Existing methods focus on using the text topic, entity type, linking order, and association between entities to obtain the target entities. Although these methods [...] Read more.
The purpose of entity linking is to connect entity mentions in text to real entities in the knowledge base. Existing methods focus on using the text topic, entity type, linking order, and association between entities to obtain the target entities. Although these methods have achieved good results, they ignore the exploration of candidate entities, leading to insufficient semantic information among entities. In addition, the implicit relationship and discrimination within the candidate entities also affect the accuracy of entity linking. To address these problems, we introduce information about candidate entities from Wikipedia and construct a graph model to capture implicit dependencies between different entity decisions. Specifically, we propose a cascade attention mechanism and develop a novel local entity linkage model termed CAM-LEL. This model leverages the interaction between entity mentions and candidate entities to enhance the semantic representation of entities. Furthermore, a global entity linkage model termed DG-GEL based on a dynamic graph is established to construct an entity association graph, and a random walking algorithm and entity entropy are used to extract the implicit relationships within entities to increase the differentiation between entities. Experimental results and in-depth analyses of multiple datasets show that our model outperforms other state-of-the-art models. Full article
Show Figures

Figure 1

Figure 1
<p>Cascading Attention Mechanisms-Local Entity Linking (CAM-LEL) Model.</p>
Full article ">Figure 2
<p>Dynamic Graph-Global Entity Link (DG-GEL) model.</p>
Full article ">Figure 3
<p>Effects of different hyperparameters on experimental results: (<b>a</b>) experimental results of F1 values for D; (<b>b</b>) experimental results for F1 values of Q; (<b>c</b>) experimental results for F1 values of K.</p>
Full article ">Figure 4
<p>F1 scores of the local entity linking model on the public dataset.</p>
Full article ">Figure 5
<p>F1 scores of the global entity linking model in the public dataset.</p>
Full article ">
17 pages, 1507 KiB  
Article
A Power Grid Topological Error Identification Method Based on Knowledge Graphs and Graph Convolutional Networks
by Shuyu Fei, Xiong Wan, Haiwei Wu, Xin Shan, Haibao Zhai and Hongmin Gao
Electronics 2024, 13(19), 3837; https://doi.org/10.3390/electronics13193837 - 28 Sep 2024
Viewed by 252
Abstract
Precise and comprehensive model development is essential for predicting power network balance and maintaining power system analysis and optimization. The development of big data technologies and measurement systems has introduced new challenges in power grid modeling, simulation, and fault prediction. In-depth analysis of [...] Read more.
Precise and comprehensive model development is essential for predicting power network balance and maintaining power system analysis and optimization. The development of big data technologies and measurement systems has introduced new challenges in power grid modeling, simulation, and fault prediction. In-depth analysis of grid data has become vital for maintaining steady and safe operations. Traditional knowledge graphs can structure data in graph form, but identifying topological errors remains a challenge. Meanwhile, Graph Convolutional Networks (GCNs) can be trained on graph data to detect connections between entities, facilitating the identification of potential topological errors. Therefore, this paper proposes a method for power grid topological error identification that combines knowledge graphs with GCNs. The proposed method first constructs a knowledge graph to organize grid data and introduces a new GCN model for deep training, significantly improving the accuracy and robustness of topological error identification compared to traditional GCNs. This method is tested on the IEEE 30-bus system, the IEEE 118-bus system, and a provincial power grid system. The results demonstrate the method’s effectiveness in identifying topological errors, even in scenarios involving branch disconnections and data loss. Full article
Show Figures

Figure 1

Figure 1
<p>Knowledge Graph Structure.</p>
Full article ">Figure 2
<p>Basic Graph Structure.</p>
Full article ">Figure 3
<p>Schematic of the Spatial Convolution Process.</p>
Full article ">Figure 4
<p>Schematic of GCN structure.</p>
Full article ">Figure 5
<p>Flowchart of the Paper.</p>
Full article ">Figure 6
<p>Knowledge Graph Construction Process.</p>
Full article ">Figure 7
<p>Schematic of the Knowledge Extraction Process.</p>
Full article ">Figure 8
<p>GCN Structure Used in This Paper.</p>
Full article ">Figure 9
<p>Structure of the IEEE 30-bus system.</p>
Full article ">Figure 10
<p>Structure of the IEEE 118-bus system.</p>
Full article ">Figure 11
<p>Structure of the Grid Data for a Province.</p>
Full article ">
13 pages, 260 KiB  
Article
Off-Label Pediatric Medication Prescribing and Dispensing: Awareness and Attitudes among Community Pharmacists: A Questionnaire-Based Study
by Carmen-Maria Jîtcă, George Jîtcă and Imre Silvia
Pharmacy 2024, 12(5), 149; https://doi.org/10.3390/pharmacy12050149 - 27 Sep 2024
Viewed by 350
Abstract
Off-label practice in pediatrics requires relentless engagement from all the health professionals involved. Community pharmacists are the last ones in the prescribing–dispensing chain; therefore, they have the key responsibility of verifying the correctness of a treatment. A cross-sectional study was conducted for assessing [...] Read more.
Off-label practice in pediatrics requires relentless engagement from all the health professionals involved. Community pharmacists are the last ones in the prescribing–dispensing chain; therefore, they have the key responsibility of verifying the correctness of a treatment. A cross-sectional study was conducted for assessing the awareness and views of Romanian community pharmacists, regarding off-label drugs in the pediatric population, through a 28-item questionnaire comprising five sections of different topics (general knowledge, frequency of prescribing and dispensing off-label medication, views, and attitudes). The sample size was 236 questionnaires with a response rate of 41.11%. A statistical analysis of the obtained data was performed with GraphPad Prism v.9. The results indicate that 55.1% of the community pharmacists have a good general knowledge and awareness regarding the off-label practice, although the legal frame is unclear. The responses highlight a high frequency of prescribing and request of medication for respiratory conditions (45.3%) and antibiotics (23.5%), with a concerning gap regarding the adverse events related to the off-label treatments (56.7%). A very small percentage of pharmacists (7.1%) contact a fellow healthcare professional when encountering an off-label prescription. In conclusion, in addition to the pharmacist’s conduct towards the best interest of the patient, there is a clear need to improve the doctor–pharmacist collaboration in order to make an off-label treatment successful. Full article
12 pages, 33470 KiB  
Article
On Symmetrical Equivelar Polyhedra of Type {3, 7} and Embeddings of Regular Maps
by Jürgen Bokowski
Symmetry 2024, 16(10), 1273; https://doi.org/10.3390/sym16101273 - 27 Sep 2024
Viewed by 356
Abstract
A regular map is an abstract generalization of a Platonic solid. It describes a group, a topological cell decomposition of a 2-manifold of type {p, q} with only p-gons, such that q of them meet at each vertex [...] Read more.
A regular map is an abstract generalization of a Platonic solid. It describes a group, a topological cell decomposition of a 2-manifold of type {p, q} with only p-gons, such that q of them meet at each vertex in a circular manner, and we have maximal combinatorial symmetry, expressed by the flag transitivity of the symmetry group. On the one hand, we have articles on topological surface embeddings of regular maps by F. Razafindrazaka and K. Polthier, C. Séquin, and J. J. van Wijk.On the other hand, we have articles with polyhedral embeddings of regular maps by J. Bokowski and M. Cuntz, A. Boole Stott, U. Brehm, H. S. M. Coxeter, B. Grünbaum, E. Schulte, and J. M. Wills. The main concern of this partial survey article is to emphasize that all these articles should be seen as contributing to the common body of knowledge in the area of regular map embeddings. This article additionally provides a method for finding symmetrical equivelar polyhedral embeddings of type {3, 7} based on symmetrical graph embeddings on convex surfaces. Full article
(This article belongs to the Special Issue Symmetry in Combinatorial Structures)
Show Figures

Figure 1

Figure 1
<p>The Platonic solids with labels for their vertices.</p>
Full article ">Figure 2
<p>Felix Klein’s regular map of type <math display="inline"><semantics> <msub> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> <mn>8</mn> </msub> </semantics></math> has 24 vertices, 84 edges, and 56 triangles. We see a seven-fold combinatorial symmetry in this picture, and a rotation around a vertex. The index 8 denotes the length of the Petrie polygon that can be seen in the next picture in yellow.</p>
Full article ">Figure 3
<p>Another combinatorial input for Felix Klein’s regular map of type <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> </semantics></math> with a symmetry of the triangle in the middle. It indicates the genus <math display="inline"><semantics> <mrow> <mi>g</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math> of the manifold, where we can imagine a topological embedding with three holes.</p>
Full article ">Figure 4
<p>Dodecahedron of Leonardo da Vinci. Regular Leonardo Polyhedron of Alicia Boole Stott.</p>
Full article ">Figure 5
<p>Explanation for the regular Leonardo polyhedron <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>8</mn> <mo>,</mo> <mo> </mo> <mn>4</mn> <mo>|</mo> <mn>3</mn> <mo>}</mo> </mrow> </semantics></math> of Coxeter. On the left: 14 truncated cubes in the hyperplane of one additional truncated cube. On the right: Schlegel diagram showing that the same 14 truncated cubes adjacent to the additional one in the center can lie in dimension 4 so that the gaps on the left vanish.</p>
Full article ">Figure 6
<p>The polyhedral realization of Dyck’s regular map by U. Brehm.</p>
Full article ">Figure 7
<p>The regular map <math display="inline"><semantics> <msub> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> <mn>18</mn> </msub> </semantics></math> of genus 7 of Hurwitz has 72 vertices, 252 edges, and 168 triangles.</p>
Full article ">Figure 8
<p>A picture of the surface in the Youtube video based on the polyhedral realization of Hurwitz’s regular map <math display="inline"><semantics> <msub> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> <mn>18</mn> </msub> </semantics></math> by J. Bokowski and M.Cuntz.</p>
Full article ">Figure 9
<p>Kepler–Poinsot-type polyhedral realization of Hurwitz’s regular map <math display="inline"><semantics> <msub> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> <mn>18</mn> </msub> </semantics></math>.</p>
Full article ">Figure 10
<p>Equivelar non-regular Leonardo Polyhedron of type <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> </semantics></math> with a tetrahedral symmetry.</p>
Full article ">Figure 11
<p>An equivelar polyhedron of type <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 12
<p>This detail is the decisive building block for our equivelar polyhedra.</p>
Full article ">Figure 13
<p>Equivelar non-regular Leonardo Polyhedron of type <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> </semantics></math> with a rotational cubical symmetry, with coplanar facets on the left and without coplanar facets on the right.</p>
Full article ">Figure 14
<p>Equivelar non-regular Leonardo Polyhedron of type <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>3</mn> <mo>,</mo> <mo> </mo> <mn>7</mn> <mo>}</mo> </mrow> </semantics></math> with a rotational dodecahedral symmetry.</p>
Full article ">Figure 15
<p>A non-regular equivelar polyhedra of type <math display="inline"><semantics> <mrow> <mo>{</mo> <mn>4</mn> <mo>,</mo> <mo> </mo> <mn>6</mn> <mo>}</mo> </mrow> </semantics></math> based of the edge graph of a Schlegel diagram of the 4-cube.</p>
Full article ">
17 pages, 1983 KiB  
Article
PageRank Algorithm-Based Recommendation System for Construction Safety Guidelines
by Jungwon Lee and Seungjun Ahn
Buildings 2024, 14(10), 3041; https://doi.org/10.3390/buildings14103041 - 24 Sep 2024
Viewed by 427
Abstract
The construction industry faces significant challenges with frequent accidents, largely due to the inefficient use of safety guidelines. These guidelines, which are often text and figure heavy, demand substantial human effort to identify the most relevant items for specific tasks and conditions. Additionally, [...] Read more.
The construction industry faces significant challenges with frequent accidents, largely due to the inefficient use of safety guidelines. These guidelines, which are often text and figure heavy, demand substantial human effort to identify the most relevant items for specific tasks and conditions. Additionally, the guidelines contain both central and peripheral elements, and central items are critical yet difficult to identify without extensive domain knowledge. This study proposes a novel recommendation framework to enhance the usability of these safety guidelines. By leveraging natural language processing (NLP) and knowledge graph (KG) modeling techniques, unstructured safety texts are transformed into a structured, interconnected KG. The PageRank and Louvain Clustering algorithm is then employed to rank guidelines by their relevance and importance. A case study on “High-rise Building Construction (General) Safety and Health Guidelines”, using ‘scaffolding’ as the keyword, demonstrates the framework’s effectiveness in improving retrieval efficiency and practical application. The analysis highlighted key clusters such as ‘fall’, ‘drop’, and ‘scaffolding’, with critical safety measures identified through their interconnections. This research not only overcomes the fragmentation of safety management documents but also contributes to advancing hazard analysis and risk prevention practices in construction management. Full article
(This article belongs to the Special Issue Deep Learning Models in Buildings)
Show Figures

Figure 1

Figure 1
<p>Proposed framework.</p>
Full article ">Figure 2
<p>Schema of knowledge graph.</p>
Full article ">Figure 3
<p>Visualization of knowledge graph generated in Neo4j: <span class="html-italic">category</span> nodes in yellow; <span class="html-italic">content</span> nodes in blue; <span class="html-italic">index</span> nodes in red.</p>
Full article ">Figure 4
<p>Illustration of a projected graph: <span class="html-italic">content</span> nodes in blue; <span class="html-italic">index</span> nodes in red.</p>
Full article ">
25 pages, 6051 KiB  
Article
Cross-Task Rumor Detection: Model Optimization Based on Model Transfer Learning and Graph Convolutional Neural Networks (GCNs)
by Wen Jiang, Facheng Yan, Kelan Ren, Xiong Zhang, Bin Wei and Mingshu Zhang
Electronics 2024, 13(18), 3757; https://doi.org/10.3390/electronics13183757 - 21 Sep 2024
Viewed by 328
Abstract
With the widespread adoption of social media, the rapid dissemination of rumors poses a severe threat to public perception and social stability, emerging as a major challenge confronting society. Hence, the development of efficient and accurate rumor detection models has become an urgent [...] Read more.
With the widespread adoption of social media, the rapid dissemination of rumors poses a severe threat to public perception and social stability, emerging as a major challenge confronting society. Hence, the development of efficient and accurate rumor detection models has become an urgent need. Given the challenges of rumor detection tasks, including data scarcity, feature complexity, and difficulties in cross-task knowledge transfer, this paper proposes a BERT–GCN–Transfer Learning model, an integrated rumor detection model that combines BERT (Bidirectional Encoder Representations from Transformers), Graph Convolutional Networks (GCNs), and transfer learning techniques. By harnessing BERT’s robust text representation capabilities, the GCN’s feature extraction prowess on graph-structured data, and the advantage of transfer learning in cross-task knowledge sharing, the model achieves effective rumor detection on social media platforms. Experimental results indicate that this model achieves accuracies of 0.878 and 0.892 on the Twitter15 and Twitter16 datasets, respectively, significantly enhancing the accuracy of rumor detection compared to baseline models. Moreover, it greatly improves the efficiency of model training. Full article
Show Figures

Figure 1

Figure 1
<p>The overall architecture of the model.</p>
Full article ">Figure 2
<p>BERT model composition.</p>
Full article ">Figure 3
<p>Tweet-related attributes.</p>
Full article ">Figure 4
<p>User-related attributes.</p>
Full article ">Figure 5
<p>Word-related attributes.</p>
Full article ">Figure 6
<p>The heterogeneous diagram representing the user, tweet, and words.</p>
Full article ">Figure 7
<p>Common flow charts for data preprocessing.</p>
Full article ">Figure 8
<p>The basic parameter setting of word cloud map.</p>
Full article ">Figure 9
<p>Bar chart.</p>
Full article ">Figure 10
<p>Word cloud map.</p>
Full article ">Figure 11
<p>Bar chart 2.</p>
Full article ">Figure 12
<p>Word cloud map 2.</p>
Full article ">Figure 13
<p>Performance diagram of the model in this paper.</p>
Full article ">Figure 14
<p>Performance comparison with other baseline models on dataset Twitter15.</p>
Full article ">Figure 15
<p>Performance comparison with other baseline models on dataset Twitter16.</p>
Full article ">Figure 16
<p>Comparison of ablation results on dataset Twitter15.</p>
Full article ">Figure 17
<p>Comparison of ablation results on dataset Twitter16.</p>
Full article ">
23 pages, 7374 KiB  
Article
A Chinese Nested Named Entity Recognition Model for Chicken Disease Based on Multiple Fine-Grained Feature Fusion and Efficient Global Pointer
by Xiajun Wang, Cheng Peng, Qifeng Li, Qinyang Yu, Liqun Lin, Pingping Li, Ronghua Gao, Wenbiao Wu, Ruixiang Jiang, Ligen Yu, Luyu Ding and Lei Zhu
Appl. Sci. 2024, 14(18), 8495; https://doi.org/10.3390/app14188495 - 20 Sep 2024
Viewed by 556
Abstract
Extracting entities from large volumes of chicken epidemic texts is crucial for knowledge sharing, integration, and application. However, named entity recognition (NER) encounters significant challenges in this domain, particularly due to the prevalence of nested entities and domain-specific named entities, coupled with a [...] Read more.
Extracting entities from large volumes of chicken epidemic texts is crucial for knowledge sharing, integration, and application. However, named entity recognition (NER) encounters significant challenges in this domain, particularly due to the prevalence of nested entities and domain-specific named entities, coupled with a scarcity of labeled data. To address these challenges, we compiled a corpus from 50 books on chicken diseases, covering 28 different disease types. Utilizing this corpus, we constructed the CDNER dataset and developed a nested NER model, MFGFF-BiLSTM-EGP. This model integrates the multiple fine-grained feature fusion (MFGFF) module with a BiLSTM neural network and employs an efficient global pointer (EGP) to predict the entity location encoding. In the MFGFF module, we designed three encoders: the character encoder, word encoder, and sentence encoder. This design effectively captured fine-grained features and improved the recognition accuracy of nested entities. Experimental results showed that the model performed robustly, with F1 scores of 91.98%, 73.32%, and 82.54% on the CDNER, CMeEE V2, and CLUENER datasets, respectively, outperforming other commonly used NER models. Specifically, on the CDNER dataset, the model achieved an F1 score of 79.68% for nested entity recognition. This research not only advances the development of a knowledge graph and intelligent question-answering system for chicken diseases, but also provides a viable solution for extracting disease information that can be applied to other livestock species. Full article
(This article belongs to the Special Issue Applied Intelligence in Natural Language Processing)
Show Figures

Figure 1

Figure 1
<p>An example of nested entity annotation, with different colored lines representing different entities.</p>
Full article ">Figure 2
<p>MFGFF-BiLSTM-EGP model framework.</p>
Full article ">Figure 3
<p>Character encoder framework.</p>
Full article ">Figure 4
<p>Word encoder framework.</p>
Full article ">Figure 5
<p>Sentence encoder framework.</p>
Full article ">Figure 6
<p>An example of EGP prediction for nested entities, where the end position of the entity part of the label is coded 1, and the non-entity part is coded 0.</p>
Full article ">Figure 7
<p>Radar plots of the entity-level assessment results of the MFGFF-BiLSTM-EGP model on three datasets including precision, recall, and F1.</p>
Full article ">Figure 8
<p>Visualization of the confusion matrix, where the ‘Other’ category represents missing classification.</p>
Full article ">Figure 9
<p>Visualization of token representations in feature space using t-SNE for data dimensionality reduction, with different colored points representing labeled entities of different types including word vector features and MFGFF features visualized on three datasets.</p>
Full article ">Figure 10
<p>P, R, and F1 evaluation results of the fine-tuning method and MFGFF method on the CDNER and CMeEE V2 datasets.</p>
Full article ">Figure 11
<p>Comparison of the evaluation results of 5 pre-trained models under the MFGFF-BiLSTM-EGP model.</p>
Full article ">
18 pages, 6248 KiB  
Article
Research on Automatic Generation of Park Road Network Based on Skeleton Algorithm
by Shuo-Fang Liu, Min Jiang, Siran Bai, Tianyuan Zhou and Hua Liu
Appl. Sci. 2024, 14(18), 8475; https://doi.org/10.3390/app14188475 - 20 Sep 2024
Viewed by 742
Abstract
This article primarily delves into the automatic generation approach of the park road network. The design of the park road network not only comprehensively takes into account environmental factors like terrain, vegetation, water bodies, and buildings, but also encompasses functional factors such as [...] Read more.
This article primarily delves into the automatic generation approach of the park road network. The design of the park road network not only comprehensively takes into account environmental factors like terrain, vegetation, water bodies, and buildings, but also encompasses functional factors such as road coverage and accessibility. It constitutes a relatively complex design task, and traditional design methods rely significantly on the professional proficiency of designers. Based on the park vector terrain, in combination with the graphics skeleton algorithm, this study proposes an automatic generation method of the park road network considering environmental constraints. Through the utilization of the modified Douglas–Peucker algorithm and convex hull operation, the semantic information of environmental constraints is retained, domain knowledge is integrated, the skeleton graph is optimized, and issues such as road smoothness are addressed. This method can not only generate road network schemes rapidly, scientifically, and precisely, but also furnish the requisite digital model for the quantitative evaluation of the road network. Eventually, the study quantitatively assesses the experimental results via the spatial syntax theory to substantiate the efficacy of the method. Full article
Show Figures

Figure 1

Figure 1
<p>Schematic diagram of the skeleton: (<b>a</b>) Graphical skeleton with outer boundaries only; (<b>b</b>) graphical skeleton with ‘holes’; (<b>c</b>) graphic skeleton with ‘line segments’.</p>
Full article ">Figure 2
<p>Flow chart of the research methodology.</p>
Full article ">Figure 3
<p>Effect of different thresholds ε on simplification (<math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="sans-serif">ε</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> <mo>&lt;</mo> <msub> <mrow> <mi mathvariant="sans-serif">ε</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> <mo>&lt;</mo> <msub> <mrow> <mi mathvariant="sans-serif">ε</mi> </mrow> <mrow> <mn>3</mn> </mrow> </msub> </mrow> </semantics></math>): (<b>a</b>) Road network generated before simplification; (<b>b</b>) road simplification with a threshold of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="sans-serif">ε</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> </mrow> </semantics></math>; (<b>c</b>) road simplification with a threshold of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="sans-serif">ε</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </mrow> </semantics></math>; (<b>d</b>) road simplification with a threshold of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi mathvariant="sans-serif">ε</mi> </mrow> <mrow> <mn>3</mn> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>Skeleton graph before and after convex hull operation. (<b>a</b>) Road network generated before convex hull simplification; (<b>b</b>) road network generated after convex hull simplification.</p>
Full article ">Figure 5
<p>Skeleton diagram before and after coverage optimization. (<b>a</b>) Road network with insufficient coverage; (<b>b</b>) increased line segment; (<b>c</b>) road network after coverage optimization.</p>
Full article ">Figure 6
<p>Coverage optimization principle. (<b>a</b>) Maximum internal tangent circle radius obtained based on skeleton branch endpoints; (<b>b</b>) finding the center of the circle corresponding to the critical value T; (<b>c</b>) extraction of new line segments and quadratic calculations.</p>
Full article ">Figure 7
<p>Satellite map of Houxianghe Park.</p>
Full article ">Figure 8
<p>Vector data model of Houxianghe Park.</p>
Full article ">Figure 9
<p>Road network generated in Houxianghe Park (<b>a</b>) and evaluation (<b>b</b>–<b>f</b>). (<b>a</b>) Generated road network; (<b>b</b>) integration value; (<b>c</b>) connection value; (<b>d</b>) control value; (<b>e</b>) depth value; (<b>f</b>) choice value.</p>
Full article ">Figure 9 Cont.
<p>Road network generated in Houxianghe Park (<b>a</b>) and evaluation (<b>b</b>–<b>f</b>). (<b>a</b>) Generated road network; (<b>b</b>) integration value; (<b>c</b>) connection value; (<b>d</b>) control value; (<b>e</b>) depth value; (<b>f</b>) choice value.</p>
Full article ">Figure 10
<p>Local integration degree: integration degree when the topological radius is located at <b>R5</b>, <b>R7</b>, and <b>R9</b>, respectively.</p>
Full article ">
Back to TopTop