No abstract

According to the needs of scientific research project research and development, the research of cooperative team excavation methods was carried out. Aiming at the current difficulties in accurately and reliably defining and identifying cooperative research teams from co-author network, an improved Louvain algorithm that integrates core node recognition was proposed: Louvain-LSCR algorithm. Based on the analysis of the Louvain algorithm, considering the local topology of the node in the network and the communication range of the node, a new algorithm LSCR for core node identification was constructed. The LSCR algorithm and Louvain algorithm were merged to obtain a new and improved algorithm, Louvain-LSCR. In this algorithm, the leaf nodes in phase 1 of Louvain algorithm were first pruned to reduce calculations; then, seed nodes were selected according to the LSCR algorithm in phase 2. The experimental results on related datasets show that LSCR algorithm has certain advantages in identifying core nodes. The modularity of Louvian-LSCR algorithm is better than other algorithms, and the community structure is more reasonable. It was verified that the algorithm can mine potential cooperative research teams in co-author network.

No abstract

In the process of product collaborative design, the association between designers can be described by a complex network. Exploring the importance of the nodes and the rules of information dissemination in such networks is of great significance for distinguishing its core designers and potential designer teams, as well as for accurate recommendations of collaborative design tasks. Based on the neighborhood similarity model, combined with the idea of network information propagation, and with the help of the ReLU function, this paper proposes a new method for judging the importance of nodes—LLSR. This method not only reflects the local connection characteristics of nodes but also considers the trust degree of network propagation, and the neighbor nodes’ information is used to modify the node value. Next, in order to explore potential teams, an LA-LPA algorithm based on node importance and node similarity was proposed. Before the iterative update, all nodes were randomly sorted to get an update sequence which was replaced by the node importance sequence. When there are multiple largest neighbor labels in the propagation process, the label with the highest similarity is selected for update. The experimental results in the related networks show that the LLSR algorithm can better identify the core nodes in the network, and the LA-LPA algorithm has greatly improved the stability of the original LPA algorithm and has stably mined potential teams in the network.

No abstract