A novel complex community network division algorithm with multi-gene families encoding
by Kangshun Li; Guihua Chen
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 6, No. 6, 2013

Abstract: To overcome the drawbacks of traditional complex community network division algorithms, such as low accuracy, high time complexity and easily being trapped into local optimum, a novel complex community network division algorithm is proposed by using Multi-Gene Families (MGF). The proposed approach first encodes the node ID and the community type into two different MGFs, respectively, and then encodes the relationship of the two MGFs into the chromosome through a mapping function. Moreover, in order to prevent premature and speed up convergence, the elite migration strategy is utilised throughout the evolution process, such as gene selection, chromosome crossover, chromosome inversion, restricted permutation. The experiments and analyses show that our approach is better than the traditional evolutionary algorithm in terms of efficiency and accuracy.

Online publication date: Thu, 16-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com