Cargando…
Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics
Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency. Based on the analysis of the structure of core-like groups in re...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4538382/ https://www.ncbi.nlm.nih.gov/pubmed/26277903 http://dx.doi.org/10.1038/srep13172 |
_version_ | 1782385995065327616 |
---|---|
author | Liu, Ying Tang, Ming Zhou, Tao Do, Younghae |
author_facet | Liu, Ying Tang, Ming Zhou, Tao Do, Younghae |
author_sort | Liu, Ying |
collection | PubMed |
description | Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency. Based on the analysis of the structure of core-like groups in real-world networks, we discover that nodes in the core-like group are mutually densely connected with very few out-leaving links from the group. By defining a measure of diffusion importance for each edge based on the number of out-leaving links of its both ends, we are able to identify redundant links in the spreading process, which have a relatively low diffusion importance but lead to form the locally densely connected core-like group. After filtering out the redundant links and applying the k-shell method to the residual network, we obtain a renewed coreness k(s) for each node which is a more accurate index to indicate its location importance and spreading influence in the original network. Moreover, we find that the performance of the ranking algorithms based on the renewed coreness are also greatly enhanced. Our findings help to more accurately decompose the network core structure and identify influential nodes in spreading processes. |
format | Online Article Text |
id | pubmed-4538382 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2015 |
publisher | Nature Publishing Group |
record_format | MEDLINE/PubMed |
spelling | pubmed-45383822015-08-25 Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics Liu, Ying Tang, Ming Zhou, Tao Do, Younghae Sci Rep Article Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency. Based on the analysis of the structure of core-like groups in real-world networks, we discover that nodes in the core-like group are mutually densely connected with very few out-leaving links from the group. By defining a measure of diffusion importance for each edge based on the number of out-leaving links of its both ends, we are able to identify redundant links in the spreading process, which have a relatively low diffusion importance but lead to form the locally densely connected core-like group. After filtering out the redundant links and applying the k-shell method to the residual network, we obtain a renewed coreness k(s) for each node which is a more accurate index to indicate its location importance and spreading influence in the original network. Moreover, we find that the performance of the ranking algorithms based on the renewed coreness are also greatly enhanced. Our findings help to more accurately decompose the network core structure and identify influential nodes in spreading processes. Nature Publishing Group 2015-08-17 /pmc/articles/PMC4538382/ /pubmed/26277903 http://dx.doi.org/10.1038/srep13172 Text en Copyright © 2015, Macmillan Publishers Limited http://creativecommons.org/licenses/by/4.0/ This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/ |
spellingShingle | Article Liu, Ying Tang, Ming Zhou, Tao Do, Younghae Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics |
title | Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics |
title_full | Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics |
title_fullStr | Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics |
title_full_unstemmed | Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics |
title_short | Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics |
title_sort | improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4538382/ https://www.ncbi.nlm.nih.gov/pubmed/26277903 http://dx.doi.org/10.1038/srep13172 |
work_keys_str_mv | AT liuying improvingtheaccuracyofthekshellmethodbyremovingredundantlinksfromaperspectiveofspreadingdynamics AT tangming improvingtheaccuracyofthekshellmethodbyremovingredundantlinksfromaperspectiveofspreadingdynamics AT zhoutao improvingtheaccuracyofthekshellmethodbyremovingredundantlinksfromaperspectiveofspreadingdynamics AT doyounghae improvingtheaccuracyofthekshellmethodbyremovingredundantlinksfromaperspectiveofspreadingdynamics |