Community detection is one of the most popular issues in analyzing and understanding the networks. Existing works show that community detection can be enhanced by proper assignments of weights onto the edges of a network. Large numbers of edge weighting schemes have been developed to cope with this problem. However, hardly has a satisfied balance between the local and global weightings been found. In this paper, the problem of the local and global weighting balance is first proposed and discussed. The SimRank is next introduced as a novel edge weighting method. Furthermore, the fast Newman algorithm is extended to be applicable for a weighted network. Combined with the edge weighting techniques, the extended algorithm enhances the performan...
In this paper we present a novel strategy to discover the community structure of (possibly, large) n...
In this paper, we aim to tackle the problem of discovering dynamic communities in weighted graph str...
Abstract. Graphs generated using the Lancichinetti-Fortunato-Radicchi (LFR) model are widely used fo...
Community discovery is one of the most popular issues in analyzing and understanding a network. Prev...
<div><p>Community discovery is one of the most popular issues in analyzing and understanding a netwo...
AbstractThis study mainly focuses on the methodology of weighted graph clustering with the purpose o...
Abstract Community detection is a fundamental procedure in the analysis of network data. Despite dec...
In order to make the performance evaluation of community detection algorithms more accurate and deep...
A community in networks is a subset of vertices primarily connecting internal components, yet less c...
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a ...
One of the widely studied structural properties of social and information networks is their communit...
Community discovery in social networks has received a significant amount of attention in the social ...
Copyright © 2013 Wei Hu. This is an open access article distributed under the Creative Commons Attri...
Local community detection is an emerging topic in network analysis that aims to detect well-connecte...
Abstract—Community detection is an important issue due to its wide use in designing network protocol...
In this paper we present a novel strategy to discover the community structure of (possibly, large) n...
In this paper, we aim to tackle the problem of discovering dynamic communities in weighted graph str...
Abstract. Graphs generated using the Lancichinetti-Fortunato-Radicchi (LFR) model are widely used fo...
Community discovery is one of the most popular issues in analyzing and understanding a network. Prev...
<div><p>Community discovery is one of the most popular issues in analyzing and understanding a netwo...
AbstractThis study mainly focuses on the methodology of weighted graph clustering with the purpose o...
Abstract Community detection is a fundamental procedure in the analysis of network data. Despite dec...
In order to make the performance evaluation of community detection algorithms more accurate and deep...
A community in networks is a subset of vertices primarily connecting internal components, yet less c...
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a ...
One of the widely studied structural properties of social and information networks is their communit...
Community discovery in social networks has received a significant amount of attention in the social ...
Copyright © 2013 Wei Hu. This is an open access article distributed under the Creative Commons Attri...
Local community detection is an emerging topic in network analysis that aims to detect well-connecte...
Abstract—Community detection is an important issue due to its wide use in designing network protocol...
In this paper we present a novel strategy to discover the community structure of (possibly, large) n...
In this paper, we aim to tackle the problem of discovering dynamic communities in weighted graph str...
Abstract. Graphs generated using the Lancichinetti-Fortunato-Radicchi (LFR) model are widely used fo...