Reconstructing dynamic social network by choosing local maximum degree substitute

Shiou Chi Li, Yu Hao Ke, Fa Yuan Liu, Jen-Wei Huang

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

The disappearance of important nodes which are prominent characters in a social network may lead the social network to a broken structure. Many previous works have discussed reconstructing such networks using the network topology to devise an approach that finds a substitute node for a deleted node and generates appropriate links to avoid a fragmentation of the network. A common used property in finding substitute node is centrality, but calculating some kinds of centrality may spend too much time on re-scanning the graph. Thus, we propose a local approach, CLOMADE, standing for Choosing LOcal MAximum DEgree. We only need to scan the whole graph once for calculating degree. We choose a node with local maximum degree to be the substitute node and generate new links from the substitute node to other nodes. The experiments show that CLOMADE outperforms previous works in execution time.

原文English
主出版物標題Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015
編輯Jian Pei, Jie Tang, Fabrizio Silvestri
發行者Association for Computing Machinery, Inc
頁面1604-1605
頁數2
ISBN(電子)9781450338547
DOIs
出版狀態Published - 2015 八月 25
事件IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015 - Paris, France
持續時間: 2015 八月 252015 八月 28

出版系列

名字Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015

Other

OtherIEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015
國家/地區France
城市Paris
期間15-08-2515-08-28

All Science Journal Classification (ASJC) codes

  • 電腦科學應用
  • 電腦網路與通信

指紋

深入研究「Reconstructing dynamic social network by choosing local maximum degree substitute」主題。共同形成了獨特的指紋。

引用此