A New Method of Identifying Core Designers and Teams Based on the Importance and Similarity of Networks.

A New Method of Identifying Core Designers and Teams Based on the Importance and Similarity of Networks.
复制标题

DOI:
10.1155/2021/3717733
复制
发表时间:
2021
影响因子:
--
通讯作者:
Zhang S
Zhang S
中科院分区:
工程技术3区
文献类型:
--
作者:
Liu D;Huang K;Wu D;Zhang S

文献摘要

参考文献

被引文献

相似文献

在产品协同设计过程中,设计师之间的关联可以用一个复杂的网络来描述。探索网络中节点的重要性和信息传播规律,对于区分网络中的核心设计师和潜在的设计团队,以及准确地推荐协同设计任务具有重要意义。在邻域相似模型的基础上,结合网络信息传播的思想,借助RELU函数,提出了一种新的判断节点重要性的方法--LLSR。该方法既反映了节点的局部连接特性,又考虑了网络传播的信任度,并利用邻居节点的信息对节点值进行修正。为了挖掘潜在的团队,提出了一种基于节点重要性和节点相似度的LA-LPA算法。在迭代更新之前,对所有节点进行随机排序,得到一个更新序列,并将其替换为节点重要度序列。当传播过程中存在多个最大邻居标签时,选择相似度最高的标签进行更新。在相关网络中的实验结果表明,LLSR算法能够更好地识别网络中的核心节点,LA-LPA算法大大提高了原有LPA算法的稳定性,稳定地挖掘出了网络中的潜在团队。
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.
网络节点的H指数及其与度和核心度的关系
DOI: 10.1038/ncomms10168
发表时间: 2016-01-12
影响因子: 16.6
作者:
Lü L;Zhou T;Zhang QM;Stanley HE
通讯作者: Stanley HE
DOI: 10.1103/physreve.76.036106
发表时间: 2007-09-01
期刊: PHYSICAL REVIEW E
影响因子: 2.4
作者:
Raghavan, Usha Nandini;Albert, Reka;Kumara, Soundar
通讯作者: Kumara, Soundar
一种在复杂网络中挖掘一组有影响力的传播者的有效算法
DOI: 10.1016/j.physa.2018.10.011
发表时间: 2019-02-15
影响因子: 3.3
作者:
Jiang, Lincheng;Zhao, Xiang;Ruan, Yirun
通讯作者: Ruan, Yirun
DOI: 10.1016/j.chaos.2018.01.013
发表时间: 2018-02-01
影响因子: 7.8
作者:
Nian, Fuzhong;Hu, Chasheng;Wang, Xingyuan
通讯作者: Wang, Xingyuan
复杂网络上的高效免疫策略
DOI: 10.1016/j.jtbi.2010.01.007
发表时间: 2010-05-07
影响因子: 2
作者:
Nian, Fuzhong;Wang, Xingyuan
通讯作者: Wang, Xingyuan