Irregular cellular learning automata-based algorithm for sampling social networks

详细信息    查看全文

• 作者：Mina Ghavipour ; Mohammad Reza Meybodi ; ^{mmeybodi@aut.ac.ir}
• 关键词：Complex networks ; Social networks ; Network sampling ; Graph mining ; Cellular learning automata
• 刊名：Engineering Applications of Artificial Intelligence
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：59
• 期：Complete
• 页码：244-259
• 全文大小：2055 K
• 卷排序：59

文摘

We propose a topology–based node sampling algorithm using ICLA for social networks. The proposed algorithm guarantees the connectivity of sample subgraphs. The proposed algorithm is tested on real world networks with various properties. The proposed algorithm is compared with well–known sampling methods. The experimental results show the superiority of the proposed algorithm.