{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
