Estimating Network Parameters for Selecting Community Detection Algorithms

Details Estimating Network Parameters for Selecting Community Detection Algorithms Estimating Network Parameters for Selecting Community Detection Algorithms

2010-10-26

arxiv.org/abs/1010.5377v1

Computer Science

Social and Information Networks

In proceedings of The 13th International Conference on Information Fusion

Scientific paper

This paper considers the problem of algorithm selection for community detection. The aim of community detection is to identify sets of nodes in a network which are more interconnected relative to their connectivity to the rest of the network. A large number of algorithms have been developed to tackle this problem, but as with any machine learning task there is no "one-size-fits-all" and each algorithm excels in a specific part of the problem space. This paper examines the performance of algorithms developed for weighted networks against those using unweighted networks for different parts of the problem space (parameterised by the intra/inter community links). It is then demonstrated how the choice of algorithm (weighted/unweighted) can be made based only on the observed network.

Affiliated with

Also associated with

No associations

Rating

Estimating Network Parameters for Selecting Community Detection Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Estimating Network Parameters for Selecting Community Detection Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating Network Parameters for Selecting Community Detection Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159410