scalable community detection through content and link analysis in social networks

Social network analysis is an important problem that has been attracting a great deal of attention in recent years. such networks provide users many different applications and features; as a result, they have been mentioned as the most important event of recent decades. using features that are available in the social networks, first discovering a complete and comprehensive communication should be done. many methods have been proposed to explore the community, which are community detections through link analysis and nodes content. most of the research exploring the social communication network only focuses on the one method, while attention to only one of the methods would be a confusion and incomplete exploration. community detections is generally associated with graph clustering, most clustering methods rely on analyzing links, and no attention to regarding the content that improves the clustering quality. in this paper, a novel algorithm for community selection is proposed. scalable community detections, an integral algorithm is proposed to cluster graphs according to link structure and nodes content, and it aims finding clusters in the groups with similar features. to implement the integral algorithm, first a graph is weighted by the algorithm according to the node content, and then network graph is analyzed using markov clustering algorithm, in other word, strong relationships are distinguished from weak ones. markov clustering algorithm is proposed as a multi-level one to be scalable. finally, we validate this approach through a variety of data sets, and the effectiveness of the proposed method is evaluated.