Relative Entropy of Distance Distribution Based Similarity Measure of Nodes in Weighted Graph Data
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 rel...
Main Authors: | Shihu Liu, Yingjie Liu, Chunsheng Yang, Li Deng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-08-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/24/8/1154 |
Similar Items
-
Similarity measure, entropy and distance measure of multiple sets
by: Sanjitha Radhakrishnan, et al.
Published: (2024-07-01) -
On Investigating Both Effectiveness and Efficiency of Embedding Methods in Task of Similarity Computation of Nodes in Graphs
by: Masoud Reyhani Hamedani, et al.
Published: (2020-12-01) -
A Note on Distance-based Graph Entropies
by: Zengqiang Chen, et al.
Published: (2014-10-01) -
Similar Supergraph Search Based on Graph Edit Distance
by: Masataka Yamada, et al.
Published: (2021-07-01) -
Measuring the similarity between shapes of buildings using graph edit distance
by: Xiechun Lu, et al.
Published: (2024-12-01)