IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v13y2022i1p1-23.html
   My bibliography  Save this article

A Parallel Particle Swarm Optimization for Community Detection in Large Attributed Graphs

Author

Listed:
  • Chaitanya Kanchibhotla

    (National Institute of Technology, Warangal, India)

  • Somayajulu D. V. L. N.

    (National Institute of Technology, Warangal, India)

  • Radha Krishna P.

    (National Institute of Technology, Warangal, India)

Abstract

Social network analysis (SNA) is an active research domain that mainly deals with large social graphs and their properties. Community detection (CD) is one of the active research topics belonging to this domain. Social graphs in real-time are huge, complex, and require more computational resources to process. In this paper, the authors present a CPU-based hybrid parallelization architecture that combines both master-slave and island models. They use particle swarm optimization (PSO)-based clustering approach, which models community detection as an optimization problem and finds communities based on concepts of PSO. The proposed model is scalable, suitable for large datasets, and is tested on real-time social networking datasets with node attributes belonging to all three sizes (small, medium, and large). The model is tested on standard benchmark functions and evaluated on well-known evaluation strategies related to both community clusters and parallel systems to show its efficiency.

Suggested Citation

  • Chaitanya Kanchibhotla & Somayajulu D. V. L. N. & Radha Krishna P., 2022. "A Parallel Particle Swarm Optimization for Community Detection in Large Attributed Graphs," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 13(1), pages 1-23, January.
    • Handle: RePEc:igg:jamc00:v:13:y:2022:i:1:p:1-23
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Ning Li & Rui Wang & Yu-li Tian & Wei Zheng, 2016. "An Effective Strategy to Build Up a Balanced Test Suite for Spectrum-Based Fault Localization," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-13, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:jamc00:v:13:y:2022:i:1:p:1-23. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.