Cargando…
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...
Autores principales: | Liu, Shihu, Liu, Yingjie, Yang, Chunsheng, Deng, Li |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9407273/ https://www.ncbi.nlm.nih.gov/pubmed/36010818 http://dx.doi.org/10.3390/e24081154 |
Ejemplares similares
-
The Structure Entropy-Based Node Importance Ranking Method for Graph Data
por: Liu, Shihu, et al.
Publicado: (2023) -
The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data
por: Liu, Shihu, et al.
Publicado: (2022) -
On Properties of Distance-Based Entropies on Fullerene Graphs
por: Ghorbani, Modjtaba, et al.
Publicado: (2019) -
Entropy, Measures of Distance and Similarity of Q-Neutrosophic Soft Sets and Some Applications
por: Abu Qamar, Majdoleen, et al.
Publicado: (2018) -
Graph Autoencoder with Preserving Node Attribute Similarity
por: Lin, Mugang, et al.
Publicado: (2023)