Detecting Overlapping Communities in Networks Under a General Probabilistic Framework
碩士 === 國立清華大學 === 通訊工程研究所 === 100 === In this thesis, we propose a correlation-based algorithm for detecting overlapping communities in networks (graphs) based on a general probabilistic framework introduced in [20].For a set of nodes in a graph, we first define the self correlation of the set for m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18183046934098402731 |