Community Detection Algorithm based on Centrality and Node Closeness in Scale-Free Networks
スポンサーリンク
概要
- 論文の詳細を見る
We present a method for detecting community structures based on centrality value and node closeness. Many real world networks possess a scale-free property. This property makes community detection difficult especially on the widely used algorithms that are based on modularity optimization. However, in our algorithm, communities are formed from hub nodes. Thus communities with scale-free property can be identified correctly. The method does not contain any random element, nor requires pre-determined number of communities. Our experiments showed that our algorithm is better than algorithms based on modularity optimization in both real world and computer generated scale-free datasets.
- Information and Media Technologies 編集運営会議の論文
Information and Media Technologies 編集運営会議 | 論文
- Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs
- A Quantitative Evaluation Methodology of Interconnection Networks
- Proposal and Performance Evaluation of Hash-based Authentication for P2P Network
- Resolving Direct and Indirect Anaphora for Japanese Definite Noun Phrases
- Ring Signatures: Universally Composable Definitions and Constructions