Influence clubs in social networks

Authors:
Chin-Ping Yang;Chen-Yi Liu;Bang Ye Wu
Affiliations:
National Chung Cheng University, ChiaYi, Taiwan, R.O.C.;National Chung Cheng University, ChiaYi, Taiwan, R.O.C.;National Chung Cheng University, ChiaYi, Taiwan, R.O.C.
Venue:
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Year:
2010

Citing 2
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Centrality measures based on current flow

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

On the maximum locally clustered subgraph and some related problems

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new model "influence club" for cohesion group in a social network is proposed. It generalizes the definition of k-club and has two advantages. First, the influence between two nodes does not only depend on the their distance but also on the numbers of pathways of different lengths. Second, the new model is more flexible than k-club and can provide middle results between k-club and (k+1)-club. We propose a branch-and-bound algorithm for finding the maximum influence club. For an n-node graph, the worst-case time complexity is O(n31.6n), and it is much more efficient in practical: a graph of 200 nodes can be processed within 2 minutes. The performance compared to k-clubs are tested on random graphs and real data. The experimental results also show the advantages of the influence clubs.