IDEAS home Printed from https://ideas.repec.org/a/igg/jiit00/v10y2014i4p24-39.html
   My bibliography  Save this article

An Artificial Bee Colony (ABC) Algorithm for Efficient Partitioning of Social Networks

Author

Listed:
  • Amal M. Abu Naser

    (Yarmouk University, Irbid, Jordan)

  • Sawsan Alshattnawi

    (Yarmouk University, Irbid, Jordan)

Abstract

Social networks clustering is an NP-hard problem because it is difficult to find the communities in a reasonable time; therefore, the solutions are based on heuristics. Social networks clustering aims to collect people with common interest in one group. Several approaches have been developed for clustering social networks. In this paper the researchers, introduce a new approach to cluster social networks based on Artificial Bee Colony optimization algorithm, which is a swarm based meta-heuristic algorithm. This approach aims to maximize the modularity, which is a measure that represents the quality of network partitioning. The researchers cluster some real known social networks with the proposed algorithm and compare it with the other approaches. Their algorithm increases the modularity and gives higher quality solutions than the previous approaches.

Suggested Citation

  • Amal M. Abu Naser & Sawsan Alshattnawi, 2014. "An Artificial Bee Colony (ABC) Algorithm for Efficient Partitioning of Social Networks," International Journal of Intelligent Information Technologies (IJIIT), IGI Global, vol. 10(4), pages 24-39, October.
  • Handle: RePEc:igg:jiit00:v:10:y:2014:i:4:p:24-39
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijiit.2014100102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jiit00:v:10:y:2014:i:4:p:24-39. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.