1. This paper proposes a new method for judging the importance of nodes in a product collaborative design network, called LLSR, which considers both local connection characteristics and trust degree of network propagation.
2. An LA-LPA algorithm is proposed to explore potential teams based on node importance and node similarity.
3. Experimental results show that the LLSR algorithm can better identify core nodes in the network, and the LA-LPA algorithm has improved the stability of the original LPA algorithm and has stably mined potential teams in the network.
The article provides an interesting approach to identifying core designers and teams based on importance and similarity of networks. The authors provide a detailed description of their proposed method, which includes an evaluation of node importance using the LLSR algorithm as well as an exploration of potential teams using an LA-LPA algorithm. The authors also provide experimental results to support their claims, which demonstrate that their proposed methods are effective at identifying core designers and teams in related networks.
However, there are some areas where this article could be improved upon. For example, while the authors discuss how their proposed methods can be used to identify core designers and teams in related networks, they do not provide any evidence or discussion about how these methods could be applied in practice or what kind of impact they might have on collaborative design tasks. Additionally, while the authors discuss how their proposed algorithms improve upon existing algorithms such as LPA, they do not provide any comparison between these algorithms or discuss why one might be preferable over another in certain situations. Finally, while the authors discuss how their proposed methods can help protect key nodes in complex networks, they do not provide any discussion about possible risks associated with using these methods or how they might affect other parts of a complex system.