Discovering the backbone network with a novel designed ant colony algorithm

被引：0
|
作者：
Lyu F. [1 ,2 ]
Bai J. [1 ]
Huang J. [1 ,2 ]
Wang B. [1 ,2 ]
机构：
[1] School of Computer Science and Technology, Harbin Institute of Technology, Weihai
[2] Research Institute of Cyberspace Security, Harbin Institute of Technology, Weihai
来源：
Tongxin Xuebao/Journal on Communications | 2020年 / 41卷 / 11期
基金：
中央高校基本科研业务费专项资金资助;
关键词：
Ant colony algorithm; Backbone network; Interactive network; Path optimization; Update pheromone dynamically;
D O I：
10.11959/j.issn.1000-436x.2020207
中图分类号：
学科分类号：
摘要：
For the problem that in interactive network, the illegal and abnormal behaviors were becoming more hidden, moreover, the complex relation in real interactive network heightens the difficulty of detecting anomalous entities, an ant colony model was proposed for extracting the backbone network from the complex interactive network. The novel model simulated the relationships among entities based on the theory of path optimization, reduced the network size after quantifying the significance of each flow of information. Firstly, a strategy of initial location selection was proposed taking advantage of network centrality. Secondly, a novel path transfer mechanism was devised for the ant colony to fit the flow behavior of entities. Finally, an adaptive and dynamic pheromone update mechanism was designed for guiding the optimization of information flows. The experimental results show that the proposed model is superior to the traditional ant colony algorithm in both solving quality and solving performance, and has better coverage and accuracy than the greedy algorithm. © 2020, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码：74 / 85
页数：11
相关论文
共 33 条
  • [11] GUTJAHR W J., A graph-based ant system and its convergence, Future Generation Computer Systems, 16, 8, pp. 873-888, (2000)
  • [12] GUTJAHR W J., ACO algorithms with guaranteed convergence to the optimal solution, Information Processing Letters, 82, 3, pp. 145-153, (2002)
  • [13] CHAWLA S, GARIMELLA K, GIONIS A, Et al., Backbone discovery in traffic networks, International Journal of Data Science and Analytics, 1, 3-4, pp. 215-227, (2016)
  • [14] KATSIKOULI P, ASTEFANOAEI M S, SARKAR R., Distributed mining of popular paths in road networks, 14th International Conference on Distributed Computing in Sensor Systems, pp. 1-8, (2018)
  • [15] ABDULKADER M M S, GAIPAL Y, EIMEKKAWY T Y., Hybridized ant colony algorithm for the multi compartment vehicle routing problem, Applied Soft Computing, pp. 196-203, (2015)
  • [16] KOZAK J, BORYCZKA U., Collective data mining in the ant colony decision tree approach, Information Sciences, 327, pp. 126-147, (2016)
  • [17] WANG Y, XIE J Y., Algorithm for multimedia multicast routing based on ant colony optimization, Journal of Shanghai Jiaotong University, 4, pp. 526-528, (2002)
  • [18] SHEN C, WANG D, TANG S M, Et al., Hybrid image noise reduction algorithm based on genetic ant colony and PCNN, The Visual Computer, 33, 11, pp. 1373-1384, (2017)
  • [19] YOU X M, LIU S, LYU J Q., An ant colony algorithm based on dynamic search strategy and its application on path planning of robot, Control and Decision, 32, 3, pp. 552-556, (2017)
  • [20] COLORNI A, DORIGO M, MANIEZZO V., Distributed optimization by ant colonies, 1991 European Conference on Artificial Life, pp. 134-142, (1991)
1234