Community detection in social network using shuffled frog-leaping optimisation
by Tong Wang; Xinlin Zhao; Yucai Zhou
International Journal of Security and Networks (IJSN), Vol. 10, No. 4, 2015

Abstract: In recent years, the complex division of the online community has become a hot topic. The existing community method aims to divide nodes into a community mechanically. In a real network, it will reduce the classification accuracy greatly for the low active users, while increasing the time complexity. It has small significance. Therefore, this paper will combine shuffled leap-frog algorithm with community detection method. It will extract active users by sorting on properties of frog, so as to improve the efficiency of division. Experimental results show that the method has good performance.

Online publication date: Tue, 13-Oct-2015

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 Security and Networks (IJSN):
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