Evidence map›Paper›PMID 34335714›Full record

ArticleComputational intelligence and neuroscience2021

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

Dianting Liu, Kangzheng Huang, Danling Wu, Shenglan Zhang

Open access · hybridAbstract read
In one paragraph

Article in Computational intelligence and neuroscience, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
0.5field-weighted citation impact, top 35% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed, 4 citations in OpenAlex.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors at 1 institution in 1 country.

Dianting LiuCollege of Mechanical and Control Engineering, Guilin University of Technology, Guilin 541004, China.
Kangzheng HuangCollege of Mechanical and Control Engineering, Guilin University of Technology, Guilin 541004, China.
Danling WuCollege of Mechanical and Control Engineering, Guilin University of Technology, Guilin 541004, China.
Shenglan ZhangCollege of Mechanical and Control Engineering, Guilin University of Technology, Guilin 541004, China.ORCID https://orcid.org/0000-0001-7129-3443
Guilin University of Technology · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Indexed as

AlgorithmsInformation Dissemination

Identifiers

PMID34335714
PMCPMC8318751
OpenAlexW3183505434

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.