Sampling Social Networks Using Shortest Paths

1 code implementation • ‏‏‎ ‎ 2020 • Alireza Rezvanian, Mohammad Reza Meybodi

In this paper, we propose to use the concept of shortest path for sampling social networks.

Solving Minimum Vertex Cover Problem Using Learning Automata

no code implementations • 28 Nov 2013 • Aylin Mousavian, Alireza Rezvanian, Mohammad Reza Meybodi

Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph.

Finding a Maximum Clique using Ant Colony Optimization and Particle Swarm Optimization in Social Networks

no code implementations • 28 Nov 2013 • Mohammad Soleimani-Pouri, Alireza Rezvanian, Mohammad Reza Meybodi

One on important types of social group is full connected relation between some users, which known as clique structure.

A Multi-Swarm Cellular PSO based on Clonal Selection Algorithm in Dynamic Environments

no code implementations • 7 Aug 2013 • Somayeh Nabizadeh, Alireza Rezvanian, Mohammd Reza Meybodi

Many real-world problems are dynamic optimization problems.

Tracking Extrema in Dynamic Environment using Multi-Swarm Cellular PSO with Local Search

no code implementations • 31 Jul 2013 • Somayeh Nabizadeh, Alireza Rezvanian, Mohammad Reza Meybodi

Many real-world phenomena can be modelled as dynamic optimization problems.

Clustering