#### DMCA

## An Ant Based Particle Swarm Optimization Algorithm for Maximum Clique

Venue: | Problem in Social Networks, in State of the Art Applications of Social Network Analysis, eds. F. Can, T. Özyer and F. Polat (Springer International Publishing |

Citations: | 6 - 4 self |

### Citations

3769 | Particle Swarm Optimization
- Kennedy, Eberhart
- 1942
(Show Context)
Citation Context ...r of birds seeking for food. In this method, group of birds seek for food in a specified space randomly. Birds follow the bird with the shortest distance to food in order to find position of the food =-=[18]-=-. Every solution in PSO algorithm which is called a particle corresponds to a bird in their pattern of social movement. Each particle has a value of fitness calculated by a fitness function. A particl... |

307 | Networks, crowds and markets: reasoning about a highly connected world
- Easley, Kleinberg
- 2010
(Show Context)
Citation Context ...ful, studying certain structure of relation between users in social networks. One of the important user group structure associated with a full connected of some users, which known as clique structure =-=[1, 2]-=-. Several applications of finding clique are reported by researchers such as social networks analysis [3, 4], online shopping recommendation [5], evolution of social networks [6], scheduling [7], bioc... |

43 |
Dorigo M, Théraulaz G
- Bonabeau
- 1999
(Show Context)
Citation Context ...zation (ACO) algorithm works well for solving several discrete problems. The basic algorithm of ACO was proposed by Dorigo as a multi agent approach in order to solve traveling salesman problem (TSP) =-=[16]-=-. The main idea of ACO algorithm is inspired from the behavior of seeking out food by colonies of ants. Ants search their environment randomly to find food. They return some of the food to their nest ... |

31 | Clique-detection models in computational biochemistry and genomics.
- Butenko, Wilhelm
- 2006
(Show Context)
Citation Context ... applications of finding clique are reported by researchers such as social networks analysis [3, 4], online shopping recommendation [5], evolution of social networks [6], scheduling [7], biochemistry =-=[8]-=-, computer vision [9] and wireless sensor networks [10]. In literature, finding clique is categorized as NP-complete problems in graph theory [11]. In maximum clique problem, finding the largest compl... |

22 |
Reducibility among combinatorial problems.
- RM
- 1972
(Show Context)
Citation Context ...]. In literature, finding clique is categorized as NP-complete problems in graph theory [11]. In maximum clique problem, finding the largest complete subgraph is considered. It was introduced by Karp =-=[12]-=-. Various types of algorithms have been presented to solve clique problem, while evolutionary algorithms such as genetic algorithm (GA) and ant colony optimization (ACO) have been used more than other... |

6 |
A clique base node scheduling method for wireless sensor networks”,ELSEVIER:
- Wang, Wei, et al.
- 2010
(Show Context)
Citation Context ...chers such as social networks analysis [3, 4], online shopping recommendation [5], evolution of social networks [6], scheduling [7], biochemistry [8], computer vision [9] and wireless sensor networks =-=[10]-=-. In literature, finding clique is categorized as NP-complete problems in graph theory [11]. In maximum clique problem, finding the largest complete subgraph is considered. It was introduced by Karp [... |

5 |
Tardos E (2005) Algorithm Design
- Kleinberg
(Show Context)
Citation Context ...n of social networks [6], scheduling [7], biochemistry [8], computer vision [9] and wireless sensor networks [10]. In literature, finding clique is categorized as NP-complete problems in graph theory =-=[11]-=-. In maximum clique problem, finding the largest complete subgraph is considered. It was introduced by Karp [12]. Various types of algorithms have been presented to solve clique problem, while evoluti... |

4 |
An efficient community detection method using parallel cliquefinding ants,
- Sadi, Oguducu, et al.
- 2010
(Show Context)
Citation Context ...p structure associated with a full connected of some users, which known as clique structure [1, 2]. Several applications of finding clique are reported by researchers such as social networks analysis =-=[3, 4]-=-, online shopping recommendation [5], evolution of social networks [6], scheduling [7], biochemistry [8], computer vision [9] and wireless sensor networks [10]. In literature, finding clique is catego... |

3 |
Clique Discovery Based on User Similarity for Online Shopping Recommendation
- Yang, Zhou, et al.
(Show Context)
Citation Context ...ected of some users, which known as clique structure [1, 2]. Several applications of finding clique are reported by researchers such as social networks analysis [3, 4], online shopping recommendation =-=[5]-=-, evolution of social networks [6], scheduling [7], biochemistry [8], computer vision [9] and wireless sensor networks [10]. In literature, finding clique is categorized as NP-complete problems in gra... |

3 |
An improved ant colony optimization for the maximum clique problem
- Xu, Ma, et al.
- 2007
(Show Context)
Citation Context ...e a maximal clique using sequential greedy heuristics based on ACO by adding vertices to the partial cliques iteratively [13]. Besides, another ACO based method hybridized by simulated annealing (SA) =-=[14]-=- and tabu search [15]. Although new hybrid algorithm obtained good results, they have a high complexity in practice. In this study, Particle Swarm Optimization (PSO) algorithm has been applied as the ... |

3 | Rezvanian A, Meybodi MR (2012) A multi-swarm cellular PSO based on clonal selection algorithm in dynamic environments - Nabizadeh |

3 | Rezvanian A, Meybodi MR (2012) Tracking extrema in dynamic environment using multi-swarm cellular pso with local search - Nabizadeh |

2 |
Rezvanian A, Meybodi MR (2012) Solving maximum clique problem in stochastic graphs using learning automata. In: 2012 Fourth international conference on computational aspects of social networks (CASoN), pp 115–119
- Soleimani-Pouri
(Show Context)
Citation Context ...ful, studying certain structure of relation between users in social networks. One of the important user group structure associated with a full connected of some users, which known as clique structure =-=[1, 2]-=-. Several applications of finding clique are reported by researchers such as social networks analysis [3, 4], online shopping recommendation [5], evolution of social networks [6], scheduling [7], bioc... |

2 | Faez K, Tavassoli S, Rezvanian A (2010) A novel method for multi-level image thresholding using particle swarm Optimization algorithms - Nabizadeh |

1 |
HBB (2013) A network approach based on cliques. Physica A 392(10):2576–2587
- IS, Pereira
(Show Context)
Citation Context ...p structure associated with a full connected of some users, which known as clique structure [1, 2]. Several applications of finding clique are reported by researchers such as social networks analysis =-=[3, 4]-=-, online shopping recommendation [5], evolution of social networks [6], scheduling [7], biochemistry [8], computer vision [9] and wireless sensor networks [10]. In literature, finding clique is catego... |

1 |
Deng Z (2012) A clique-superposition model for social networks
- Yan, Cai, et al.
(Show Context)
Citation Context ...s clique structure [1, 2]. Several applications of finding clique are reported by researchers such as social networks analysis [3, 4], online shopping recommendation [5], evolution of social networks =-=[6]-=-, scheduling [7], biochemistry [8], computer vision [9] and wireless sensor networks [10]. In literature, finding clique is categorized as NP-complete problems in graph theory [11]. In maximum clique ... |

1 |
FYL (2011) A clique-based algorithm for constructing feasible timetables. Optim Methods Softw 26(2):281–294
- Liua, Zhanga, et al.
(Show Context)
Citation Context ...re [1, 2]. Several applications of finding clique are reported by researchers such as social networks analysis [3, 4], online shopping recommendation [5], evolution of social networks [6], scheduling =-=[7]-=-, biochemistry [8], computer vision [9] and wireless sensor networks [10]. In literature, finding clique is categorized as NP-complete problems in graph theory [11]. In maximum clique problem, finding... |

1 |
YT (2001) Graph-based method for face identification from a single 2D line drawing
- Liu, Lee
(Show Context)
Citation Context ...ing clique are reported by researchers such as social networks analysis [3, 4], online shopping recommendation [5], evolution of social networks [6], scheduling [7], biochemistry [8], computer vision =-=[9]-=- and wireless sensor networks [10]. In literature, finding clique is categorized as NP-complete problems in graph theory [11]. In maximum clique problem, finding the largest complete subgraph is consi... |

1 |
Solnon C (2003) Searching for maximum cliques with ant colony optimization
- Fenet
(Show Context)
Citation Context ... used more than others. Popular algorithm named Ant-clique algorithm, which make a maximal clique using sequential greedy heuristics based on ACO by adding vertices to the partial cliques iteratively =-=[13]-=-. Besides, another ACO based method hybridized by simulated annealing (SA) [14] and tabu search [15]. Although new hybrid algorithm obtained good results, they have a high complexity in practice. In t... |

1 |
Mahanti PK (2009) Analysis of social network using clever ant colony metaphor. World Acad Sci Eng Technol 53:970–974
- Al-Fayoumi, Banerjee
(Show Context)
Citation Context ...ing sequential greedy heuristics based on ACO by adding vertices to the partial cliques iteratively [13]. Besides, another ACO based method hybridized by simulated annealing (SA) [14] and tabu search =-=[15]-=-. Although new hybrid algorithm obtained good results, they have a high complexity in practice. In this study, Particle Swarm Optimization (PSO) algorithm has been applied as the heuristic to enhance ... |

1 |
Dorigo M (2008) Ant colony optimization for continuous domains
- Socha
(Show Context)
Citation Context ...cording to the problem and graph traverse, pheromones set on vertices or edges of graph. Traversing the edge An Ant Based Particle Swarm Optimization Algorithm 297 Fig. 1 Pseudo-code of ACO algorithm =-=[17]-=- Algorithm 1 ACO algorithmprocedure ACO_MetaHeuristic while (termination_conditions) generateSolutions() daemonActions() {Optional} pheromoneUpdate() endwhile end procedure between vertices i and j de... |

1 |
Faili H, Rezvanian A (2012) A novel community detection algorithm for privacy preservation in social networks
- Amiri, Yazdani
(Show Context)
Citation Context ...ge of (0,1). c1 and c2 are learning parameters usually assumed equal (c1 = c2). w is inertia weight which is considered as a constant or variable coefficient as random, linear, nonlinear and adaptive =-=[19]-=-. PSO has been used in various applications [20–22] and this research utilizes it to improve the amount of pheromones. 4 Proposed Algorithm High complexity was a major drawback of the previous heurist... |