Cargando…
The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data
Due to their wide application in many disciplines, how to make an efficient ranking for nodes, especially for nodes in graph data, has aroused lots of attention. To overcome the shortcoming that most traditional ranking methods only consider the mutual influence between nodes but ignore the influenc...
Autores principales: | Liu, Shihu, Gao, Haiyan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9602144/ https://www.ncbi.nlm.nih.gov/pubmed/37420491 http://dx.doi.org/10.3390/e24101471 |
Ejemplares similares
-
The Structure Entropy-Based Node Importance Ranking Method for Graph Data
por: Liu, Shihu, et al.
Publicado: (2023) -
Relative Entropy of Distance Distribution Based Similarity Measure of Nodes in Weighted Graph Data
por: Liu, Shihu, et al.
Publicado: (2022) -
Graph ranking for exploratory gene data analysis
por: Gao, Cuilan, et al.
Publicado: (2009) -
Citation graph based ranking in Invenio
por: Marian, Ludmila, et al.
Publicado: (2010) -
Equal Opportunity for Low-Degree Network Nodes: A PageRank-Based Method for Protein Target Identification in Metabolic Graphs
por: Bánky, Dániel, et al.
Publicado: (2013)