Evidence map›Paper›PMID 36010818›Full record

ArticleEntropy (Basel, Switzerland)2022

Relative Entropy of Distance Distribution Based Similarity Measure of Nodes in Weighted Graph Data.

Shihu Liu, Yingjie Liu, Chunsheng Yang, Li Deng

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2022. 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
–field-weighted citation impact
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.

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.

Shihu LiuSchool of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China.ORCID 0000-0002-4442-5057
Yingjie LiuSchool of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China.ORCID 0000-0002-0436-1116
Chunsheng YangSchool of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China.
Li DengSchool of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China.

Funding

National Natural Science Foundation of China 61966039
6 · The paper itself

Abstract

Many similarity measure algorithms of nodes in weighted graph data have been proposed by employing the degree of nodes in recent years. Despite these algorithms obtaining great results, there may be still some limitations. For instance, the strength of nodes is ignored. Aiming at this issue, the relative entropy of the distance distribution based similarity measure of nodes is proposed in this paper. At first, the structural weights of nodes are given by integrating their degree and strength. Next, the distance between any two nodes is calculated with the help of their structural weights and the Euclidean distance formula to further obtain the distance distribution of each node. After that, the probability distribution of nodes is constructed by normalizing their distance distributions. Thus, the relative entropy can be applied to measure the difference between the probability distributions of the top

Indexed as

distance distributionlink predictionrelative entropysimilarity measureweighted graph data

Identifiers

PMID36010818
PMCPMC9407273

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.