Advertisement
Published in:
2015 | OriginalPaper | Chapter
Identifying Bridges for Information Spread Control in Social Networks
Authors : Michał Wojtasiewicz, Krzysztof Ciesielski
Published in: Social Informatics
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper scalable method for cluster analysis based on random walks is presented. The main aim of the algorithm introduced in this paper is to detect dense subgraphs. Provided method has additional feature. It identifies groups of vertices which are responsible for information spreading among found clusters. The algorithm is sensitive to vertices assignment uncertainty. It distinguishes groups of nodes which form sparse clusters. These groups are mostly located in places crucial for information spreading so one can control signal propagation between separated dense subgraphs by using algorithm provided in this work.