Research on I-PageRank algorithm model of Process knowledge graph based on K-Shell decomposition algorithm

PageRank algorithm in the calculation of nodes is equally distributed to the node chain of all nodes, but in the actual production of manufacturing enterprises, the importance of process knowledge in process documents is different, if according to the PageRank algorithm PR value equal transfer to calculate the importance of the artifact, efficiency and accuracy is generally low, so the importance of PR value transfer difference should be considered. Therefore, this paper introduces K-Shell decomposition algorithm in PageRank algorithm, constructs a new I-PageRank algorithm model, adding the importance of each node in the linked network to the PageRank algorithm, which improves the efficiency and accuracy of PageRank algorithm in identifying key nodes.