Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Majbouri Yazdi, Kasraa; * | Majbouri Yazdi, Adelb | Khodayi, Saeidc | Hou, Jingyua | Zhou, Wanleid | Saedy, Saeede | Rostami, Mehrdadf
Affiliations: [a] School of Information Technology, Deakin University, Australia. E-mails: [email protected], [email protected] | [b] Department of Computing, Kharazmi University, Iran. E-mail: [email protected] | [c] Faculty of Computer & Electrical Engineering, Qazvin Islamic Azad University, Iran. E-mail: [email protected] | [d] School of Software, University of Technology Sydney, Australia. E-mail: [email protected] | [e] Faculty of Engineering, Khavaran Higher Education Institute, Iran. E-mail: [email protected] | [f] Faculty of Computer Engineering, University of Kurdistan, Sanandaj, Iran. E-mail: [email protected]
Correspondence: [*] Corresponding author. E-mail: [email protected].
Abstract: One of the most important challenges of social networks is to predict information diffusion paths. Studying and modeling the propagation routes is important in optimizing social network-based platforms. In this paper, a new method is proposed to increase the prediction accuracy of diffusion paths using the integration of the ant colony and densest subgraph algorithms. The proposed method consists of 3 steps; clustering nodes, creating propagation paths based on ant colony algorithm and predicting information diffusion on the created paths. The densest subgraph algorithm creates a subset of maximum independent nodes as clusters from the input graph. It also determines the centers of clusters. When clusters are identified, the final information diffusion paths are predicted using the ant colony algorithm in the network. After the implementation of the proposed method, 4 real social network datasets were used to evaluate the performance. The evaluation results of all methods showed a better outcome for our method.
Keywords: Diffusion paths prediction, information diffusion patterns, densest subgraphs, ant colony algorithm, centrality
DOI: 10.3233/JHS-200635
Journal: Journal of High Speed Networks, vol. 26, no. 2, pp. 141-153, 2020
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]