An adaptive hybrid algorithm for social networks to choose groups with independent members
Parham Hadikhani, Pooria Hadikhani

TL;DR
This paper introduces an adaptive hybrid algorithm combining particle swarm optimization with local search methods to select independent committees in social networks, significantly improving group independence.
Contribution
A novel adaptive hybrid algorithm that enhances group independence in social network committee selection by combining PSO with local search and an effective selection mechanism.
Findings
Improves group independence by at least 21%.
Outperforms well-known metaheuristic algorithms.
Effectively balances exploration and exploitation.
Abstract
Choosing a committee with independent members in social networks can be named as a problem in group selection and independence in the committee is considered as the main criterion of this selection. Independence is calculated based on the social distance between group members. Although there are many solutions to solve the problem of group selection in social networks, such as selection of the target set or community detection, just one solution has been proposed to choose committee members based on their independence as a measure of group performance. In this paper, a new adaptive hybrid algorithm is proposed to select the best committee members to maximize the independence of the committees. This algorithm is a combination of particle swarm optimization (PSO) algorithm with two local search algorithms. The goal of this work is to combine exploration and exploitation to improve the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
