一种改进的基于k - shell的节点重要性排序

2021 International Conference on Computer, Blockchain and Financial Development (CBFD) Pub Date : 2021-04-01 DOI:10.1109/CBFD52659.2021.00059

Wang Jun-di, Zhu Ya-Ling, Wang Juan

{"title":"一种改进的基于k - shell的节点重要性排序","authors":"Wang Jun-di, Zhu Ya-Ling, Wang Juan","doi":"10.1109/CBFD52659.2021.00059","DOIUrl":null,"url":null,"abstract":"Identifying important nodes in complex networks in a fast and effective manner is one of the useful ways to control the network communication process. Degree centrality and K-Shell decomposition are combined to integrate the global and local characteristics of the nodes, without depending on other parameters in the calculation. This effectively improves the shortcomings of poor discrimination by K-Shell decomposition and increases the resolution of node identification.","PeriodicalId":230625,"journal":{"name":"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved K-Shell-Based Ranking of Node Importance\",\"authors\":\"Wang Jun-di, Zhu Ya-Ling, Wang Juan\",\"doi\":\"10.1109/CBFD52659.2021.00059\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Identifying important nodes in complex networks in a fast and effective manner is one of the useful ways to control the network communication process. Degree centrality and K-Shell decomposition are combined to integrate the global and local characteristics of the nodes, without depending on other parameters in the calculation. This effectively improves the shortcomings of poor discrimination by K-Shell decomposition and increases the resolution of node identification.\",\"PeriodicalId\":230625,\"journal\":{\"name\":\"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CBFD52659.2021.00059\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CBFD52659.2021.00059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

快速有效地识别复杂网络中的重要节点是控制网络通信过程的有效途径之一。将度中心性和K-Shell分解相结合，综合了节点的全局和局部特征，在计算中不依赖于其他参数。这有效改善了K-Shell分解识别能力差的缺点，提高了节点识别的分辨率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An improved K-Shell-Based Ranking of Node Importance

Identifying important nodes in complex networks in a fast and effective manner is one of the useful ways to control the network communication process. Degree centrality and K-Shell decomposition are combined to integrate the global and local characteristics of the nodes, without depending on other parameters in the calculation. This effectively improves the shortcomings of poor discrimination by K-Shell decomposition and increases the resolution of node identification.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2021 International Conference on Computer, Blockchain and Financial Development (CBFD)

自引率

0.00%

发文量