Algorithm Based on Vertex Influence for Detecting Local Community Structure
In order to detect community structure in social network fast and correctly,from perspective of vertex influence,an algorithm for detecting local community is proposed in this paper.The algorithm introduces the vertex weight which can measure the size of vertex influence.First,we selectively detects community in Breadth First Search according to the weight of " seed" vertex,and the vertexs which have more weight can constantly influence the vertexs which have less weight,then we can get the community structure which the " seed" vertex belongs to,we search a new " seed" vertex outside the known community,then repeat this process we can get the community structure of entire network.The algorithm is optimized and its application to social network,the experiment results verifies the feasibility of the algorithm.Compared to the classical algorithm,the accuracy and computational speed of the algorithm are improved.