• DocumentCode
    2243632
  • Title

    Complex network sampling based on particle swarm optimization

  • Author

    Yang, Hu ; Qi, Gao ; Feng, Pan ; Weixing, Li ; Jinghai, Zhang

  • Author_Institution
    School of Automation, Beijing Institute of Technology, Beijing 100081, China
  • fYear
    2015
  • fDate
    28-30 July 2015
  • Firstpage
    1356
  • Lastpage
    1361
  • Abstract
    Whether the sampling subnets can accurately represent the topology and dynamics of the original networks is an important research topic. To improve the quality of network sampling, this paper attempts to convert the complex network sampling process to an optimization problem, and proposes a novel sampling algorithm which is based on Particle Swarm Optimization (PSO). Exponent of power-law degree distribution and clustering coefficient of networks were set as optimization objectives. Subnets were sampled from scale-free network by random sampling method, and optimization objectives were optimized by multi-objective optimizer. Kolmogorov-Smirnov test is used to verify that whether the sampling subnets conform to strict power-law degree distribution. Simulations show that the algorithm based on intelligent optimization methods could get better sample subnets than normal sampling algorithm. The optimization objectives of the sampling algorithm proposed in this paper could be extended to other statistical properties of complex network, and the alternative algorithm other than random sampling could also be used.
  • Keywords
    Algorithm design and analysis; Clustering algorithms; Complex networks; Mathematical model; Optimization; Particle swarm optimization; Sampling methods; Complex network; Intelligent optimization; Particle swarm optimization; Sampling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Conference (CCC), 2015 34th Chinese
  • Conference_Location
    Hangzhou, China
  • Type

    conf

  • DOI
    10.1109/ChiCC.2015.7259830
  • Filename
    7259830