Finding a Maximum Clique using Ant Colony Optimization and Particle Swarm Optimization in Social Networks
Social and Information Networks
2013-12-02 v1 Neural and Evolutionary Computing
Abstract
Interaction between users in online social networks plays a key role in social network analysis. One on important types of social group is full connected relation between some users, which known as clique structure. Therefore finding a maximum clique is essential for some analysis. In this paper, we proposed a new method using ant colony optimization algorithm and particle swarm optimization algorithm. In the proposed method, in order to attain better results, it is improved process of pheromone update by particle swarm optimization. Simulation results on popular standard social network benchmarks in comparison standard ant colony optimization algorithm are shown a relative enhancement of proposed algorithm.
Cite
@article{arxiv.1311.7213,
title = {Finding a Maximum Clique using Ant Colony Optimization and Particle Swarm Optimization in Social Networks},
author = {Mohammad Soleimani-Pouri and Alireza Rezvanian and Mohammad Reza Meybodi},
journal= {arXiv preprint arXiv:1311.7213},
year = {2013}
}
Comments
4 pages, 3 figures, conference