文件名称:
Top-k Structure Holes Detection Algorithm in Social Network
开发工具:
文件大小: 1mb
下载次数: 0
上传时间: 2018-10-16
详细说明： In the research of social networks, the structure holes usually refers to the vertices in the network at the key positions of information diffusion. The detection of such vertices is of great significance for the control of network public opinion, the analysis of the influence of social network, the detection of the weak points of the network security, the rapid spread of the information and so on. How to find more accurate structural holes has become a key problem in the research. In this paper, we proposed a method to detect t he top-k structure holes based on the shortest path increment. It mainly through the analysis of SPIG (the shortest path increment), NCC (the number of sub connected components) and VAR (the variance of the vertices in a connected component) to determine the structure hole attribute values of the vertices. And then the vertices are sorted according to this value and obtained the top-k vertices. Our experiments on real networks and different scales LFR simulation complex networks clearly verify the effectiveness of our method, as well as the advantage of our method against the other similar methods. ...展开详情收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
