Mathematics (Nov 2023)

Dynamic Optimization Method of Knowledge Graph Entity Relations for Smart Maintenance of Cantilever Roadheaders

  • Yan Wang,
  • Yuepan Liu,
  • Kai Ding,
  • Shirui Wei,
  • Xuhui Zhang,
  • Youjun Zhao

DOI
https://doi.org/10.3390/math11234833
Journal volume & issue
Vol. 11, no. 23
p. 4833

Abstract

Read online

The fault maintenance scenario in coal-mine equipment intelligence is composed of videos, images, signals, and repair process records. Text data are not the primary data that reflect the fault phenomenon, but rather the secondary processing based on operation experience. Focusing on the difficulty of extracting fault knowledge from the limited textual maintenance process records, a forward static full-connected topology network modeling method based on domain knowledge from four dimensions of physical structure, internal association, condition monitoring, and fault maintenance, is proposed to increase the efficiency of constructing a fault-maintenance knowledge graph. Accurately identifying the intrinsic correlation between the equipment anomalies and the faults’ causes through only domain knowledge and loosely coupled data is difficult. Based on the static full-connected knowledge graph of the cantilever roadheader, the information entropy and density-based DBSCAN clustering algorithm is used to process and analyze many condition-monitoring historical datasets to optimize the entity relationships between the fault phenomena and causes. The improved DBSCAN algorithm consists of three stages: firstly, extracting entity data related to fault information from the static fully connected graph; secondly, calculating the information entropy based on the real dataset describing the fault information and the historical operating condition, respectively; and thirdly, comparing the entropy values of the entities and analyzing the intrinsic relationship between the fault phenomenon, the operating condition data, and the fault causes. Based on the static full-connected topology storage in the Neo4j database, the information entropy and density-based DBSCAN algorithm is computed by using Python to identify the relationship weights and dynamically display optimized knowledge graph topology. Finally, an example of EBZ200-type cantilever roadheader for smart maintenance is studied to analyze and evaluate the forward and four-mainlines knowledge graph modeling method and the dynamic entity relations optimization method for static full-connected knowledge graph.

Keywords