Local Community Detection in Complex Networks Based on Maximum Cliques Extension

Total Page:16

File Type:pdf, Size:1020Kb

Local Community Detection in Complex Networks Based on Maximum Cliques Extension Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2014, Article ID 653670, 12 pages http://dx.doi.org/10.1155/2014/653670 Research Article Local Community Detection in Complex Networks Based on Maximum Cliques Extension Meng Fanrong, Zhu Mu, Zhou Yong, and Zhou Ranran School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China Correspondence should be addressed to Zhu Mu; [email protected] Received 6 January 2014; Accepted 25 February 2014; Published 15 April 2014 Academic Editor: Guanghui Wen Copyright © 2014 Meng Fanrong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Detecting local community structure in complex networks is an appealing problem that has attracted increasing attention in various domains. However, most of the current local community detection algorithms, on one hand, are influenced by the state of the source node and, on the other hand, cannot effectively identify the multiple communities linked with the overlapping nodes. We proposed a novel local community detection algorithm based on maximum clique extension called LCD-MC. The proposed method firstly finds the set of all the maximum cliques containing the source node and initializes them as the starting local communities; then, it extends each unclassified local community by greedy optimization until a certain objective is satisfied; finally, the expected local communities will be obtained until all maximum cliques are assigned into a community. An empirical evaluation using both synthetic and real datasets demonstrates that our algorithm has a superior performance to some of the state-of-the-art approaches. 1. Introduction difficulty in global community detection. Therefore, many scholars have begun to focus on local community detection In recent years, more and more research has begun to pay of complex networks. attention to large complex networks, such as social net- Different from the global community detection which works, protein interaction networks, citation networks, and classifies a total complex network, local community detec- WWW. Extensive researches have indicated that community tion is only to inquire the community structure where a structure universally exists in complex networks and the designated node (source node) is located in a network. A connection between nodes in a community is closer than that complex network is essentially divided into two parts, namely, between communities. Meanwhile, these nodes often have thecommunitywhereadesignatednodeislocatedandthe similar attributes or play a similar role. Therefore, community rest part. Furthermore, the local community where the node detection has become one of the basic tasks of complex is located has a close internal connection within the com- network analysis and is of important theoretical significance munity but a relatively loose relation with the outside. Local and real value. community detection need not know all information about The research of community detection mostly has focused a complex network in advance. It starts from a node, grad- on detecting all community structures in a whole network ually extends from the node, and gradually acquires the from a global viewpoint [1–5]. However, the large scale of local information around the current community during the complex networks in many real applications is inconceivable. extension process. The representative algorithms for local For example, the friend relation networks on Facebook and community detection include [9–13]. Twitter contain hundreds of millions of nodes [6], and the However, most of available local community detection detection of the community structures in such huge complex algorithms have two restrictions: firstly, the method including networks will cost tremendous time and space. In addition, direct start from a source node, continuous selection of the as the nodes and links of many complex networks are best nodes from candidate ones by greedy algorithm, and dynamicallyevolving[7, 8], it is often hard for us to acquire adding them into a local community till the local community the complete network information, further increasing the detected satisfies all specified conditions, which makes it 2 Mathematical Problems in Engineering easy to deviate from the real local community, thus reducing the accuracy of local community detection; secondly, in this way, finally, only a unique local community structure can be U obtainedandwhenthesourcenodeisanoverlapped(hub) node connecting multiple communities, it is unable to obtain B all local communities. Tosolvetheabovetwoproblems,weproposealocal community detection algorithm based on maximum cliques C extension (LCD-MC), which includes finding maximum cliques and extending local communities. Its main advantages are shown as below. B (i) Instead of taking the source node as input directly, finding all maximum cliques containing the source U node is made as the start of local community exten- sion, thus increasing the stability of local community detection. Figure 1: Local community detection model. (ii) The flexibility in identifying overlapped node- involved local communities is realized by extending all maximum cliques satisfying certain conditions, in and the other node exists in ,then(, ) =1 and, respectively. otherwise, (, ).Thelargerthe =0 valueis,thebetter (iii) The experimental results on both synthetic and real the local community structure detected will be. Initially, = networks demonstrate that, compared with the state- {V0}, and Clauset used a greedy optimization algorithm for of-the-art local community detection algorithms, the local modularity to find the local community structure LCD-MC, on one side, can obtain better local com- where the designated V0 is located. munity quality and, on the other side, can effectively Similar to Clauset algorithm, Luo et al. proposed LWP identify multiple local community structures con- algorithm [10], in which is replaced by a new local nected with the overlapped node. modularity , as shown in the following: (1/2) ∑ (, ) 2. Related Work = in = , ∑ (, ) (2) out Let a complex network = (,),where represents the node set, the edge set, and and number of nodes and where (, ) =1 if both node V and node V exist in com- number of edges in the network, respectively. Different from munity ;otherwise,(, ).And =0 (, ) =1 means that global algorithms which divide intoanumberofclosely only one, either node V or node V, exists in community .In connected community structures, local community detection addition to a different objective function, LWP algorithm also designates a node V0 and explores the community structures includes addition and deletion operations, making it possible in close relation with the node V0. to add into or delete from community the nodes that can Clauset firstly proposed the formal definition of local increase value. Besides, LWP algorithm need not predefine community detection [9]. Assume that we have known a the size of community in advance. community structure (initially, contains only the node LMF [11] is a local-global community detection algo- V0) composed of some nodes; set is connected with nodes rithm, which proposes a fitness function, as shown in the in but does not belong to the node set of community . following: The process of local community detection is to continuously select nodes from and add them to the current community in = , (3) tillthepredefinedlocalmodularity reaches the maximum ( + ) value. To define the objective function , Clauset also defined in ex the boundary of community , that is, node sets in that where and refer to the sums of the internal node in ex have at least one node connecting with ,asshowninFigure degrees and external node degrees of community ,respec- 1. tively, and is a resolution parameter used for controlling Assume that the given , ,and are known; is defined the size of local community. This algorithm is similar to by LWP algorithm in that, according to the given ,itachieves the objective of making the fitness function reach the ∑, (, ) = , (1) maximum local value by addition and deletion. ∑, Wu et al. [12] proposed a local community detection algorithm based on link similarity (LS). The algorithm firstly where =1if (, ) ∈ and either node V or node V exists defines the similarity between a single node and a local in ;otherwise, =0. When either node V or node V exists community and then carries out local community detection Mathematical Problems in Engineering 3 in a decrease sequence of the calculated similarity values. while a leaf node represents a corresponding maximum In addition, this algorithm’s search process is composed of clique. greedy clustering, optimization, and trimming. Algorithm 1 gives the pseudocode of FindMC algorithm Chen et al. [13] proposed a local community detection for finding maximum clique. In the initialization phase, algorithm based on local degree center node (LMD). Though FindMC stores only node V0 in set and only V0’s neighbours the objective of local community detection is to find the com- in set . This is because the nodes in the maximum clique munity structure where the given node is located, it was where node V0 is located can only be V0’s neighbours and any held by the authors that, for some given nodes, the detection search outside
Recommended publications
  • Detecting Statistically Significant Communities
    1 Detecting Statistically Significant Communities Zengyou He, Hao Liang, Zheng Chen, Can Zhao, Yan Liu Abstract—Community detection is a key data analysis problem across different fields. During the past decades, numerous algorithms have been proposed to address this issue. However, most work on community detection does not address the issue of statistical significance. Although some research efforts have been made towards mining statistically significant communities, deriving an analytical solution of p-value for one community under the configuration model is still a challenging mission that remains unsolved. The configuration model is a widely used random graph model in community detection, in which the degree of each node is preserved in the generated random networks. To partially fulfill this void, we present a tight upper bound on the p-value of a single community under the configuration model, which can be used for quantifying the statistical significance of each community analytically. Meanwhile, we present a local search method to detect statistically significant communities in an iterative manner. Experimental results demonstrate that our method is comparable with the competing methods on detecting statistically significant communities. Index Terms—Community Detection, Random Graphs, Configuration Model, Statistical Significance. F 1 INTRODUCTION ETWORKS are widely used for modeling the structure function that is able to always achieve the best performance N of complex systems in many fields, such as biology, in all possible scenarios. engineering, and social science. Within the networks, some However, most of these objective functions (metrics) do vertices with similar properties will form communities that not address the issue of statistical significance of commu- have more internal connections and less external links.
    [Show full text]
  • Emerging Topics in Internet Technology: a Complex Networks Approach
    1 Emerging Topics in Internet Technology: A Complex Networks Approach Bisma S. Khan 1, Muaz A. Niazi *,2 COMSATS Institute of Information Technology, Islamabad, Pakistan Abstract —Communication networks, in general, and internet technology, in particular, is a fast-evolving area of research. While it is important to keep track of emerging trends in this domain, it is such a fast-growing area that it can be very difficult to keep track of literature. The problem is compounded by the fast-growing number of citation databases. While other databases are gradually indexing a large set of reliable content, currently the Web of Science represents one of the most highly valued databases. Research indexed in this database is known to highlight key advancements in any domain. In this paper, we present a Complex Network-based analytical approach to analyze recent data from the Web of Science in communication networks. Taking bibliographic records from the recent period of 2014 to 2017 , we model and analyze complex scientometric networks. Using bibliometric coupling applied over complex citation data we present answers to co-citation patterns of documents, co-occurrence patterns of terms, as well as the most influential articles, among others, We also present key pivot points and intellectual turning points. Complex network analysis of the data demonstrates a considerably high level of interest in two key clusters labeled descriptively as “social networks” and “computer networks”. In addition, key themes in highly cited literature were clearly identified as “communication networks,” “social networks,” and “complex networks”. Index Terms —CiteSpace, Communication Networks, Network Science, Complex Networks, Visualization, Data science.
    [Show full text]
  • A Python Library to Model and Analyze Diffusion Processes Over Complex Networks
    International Journal of Data Science and Analytics (2018) 5:61–79 https://doi.org/10.1007/s41060-017-0086-6 APPLICATIONS NDlib: a python library to model and analyze diffusion processes over complex networks Giulio Rossetti2 · Letizia Milli1,2 · Salvatore Rinzivillo2 · Alina Sîrbu1 · Dino Pedreschi1 · Fosca Giannotti2 Received: 19 October 2017 / Accepted: 11 December 2017 / Published online: 20 December 2017 © Springer International Publishing AG, part of Springer Nature 2017 Abstract Nowadays the analysis of dynamics of and on networks represents a hot topic in the social network analysis playground. To support students, teachers, developers and researchers, in this work we introduce a novel framework, namely NDlib,an environment designed to describe diffusion simulations. NDlib is designed to be a multi-level ecosystem that can be fruitfully used by different user segments. For this reason, upon NDlib, we designed a simulation server that allows remote execution of experiments as well as an online visualization tool that abstracts its programmatic interface and makes available the simulation platform to non-technicians. Keywords Social network analysis software · Epidemics · Opinion dynamics 1 Introduction be modeled as networks and, as such, analyzed. Undoubt- edly, such pervasiveness has produced an amplification in the In the last decades, social network analysis, henceforth SNA, visibility of network analysis studies thus making this com- has received increasing attention from several heterogeneous plex and interesting field one of the most widespread among fields of research. Such popularity was certainly due to the higher education centers, universities and academies. Given flexibility offered by graph theory: a powerful tool that the exponential diffusion reached by SNA, several tools were allows reducing countless phenomena to a common ana- developed to make it approachable to the wider audience pos- lytical framework whose basic bricks are nodes and their sible.
    [Show full text]
  • Evolving Networks and Social Network Analysis Methods And
    DOI: 10.5772/intechopen.79041 ProvisionalChapter chapter 7 Evolving Networks andand SocialSocial NetworkNetwork AnalysisAnalysis Methods and Techniques Mário Cordeiro, Rui P. Sarmento,Sarmento, PavelPavel BrazdilBrazdil andand João Gama Additional information isis available atat thethe endend ofof thethe chapterchapter http://dx.doi.org/10.5772/intechopen.79041 Abstract Evolving networks by definition are networks that change as a function of time. They are a natural extension of network science since almost all real-world networks evolve over time, either by adding or by removing nodes or links over time: elementary actor-level network measures like network centrality change as a function of time, popularity and influence of individuals grow or fade depending on processes, and events occur in net- works during time intervals. Other problems such as network-level statistics computation, link prediction, community detection, and visualization gain additional research impor- tance when applied to dynamic online social networks (OSNs). Due to their temporal dimension, rapid growth of users, velocity of changes in networks, and amount of data that these OSNs generate, effective and efficient methods and techniques for small static networks are now required to scale and deal with the temporal dimension in case of streaming settings. This chapter reviews the state of the art in selected aspects of evolving social networks presenting open research challenges related to OSNs. The challenges suggest that significant further research is required in evolving social networks, i.e., existent methods, techniques, and algorithms must be rethought and designed toward incremental and dynamic versions that allow the efficient analysis of evolving networks. Keywords: evolving networks, social network analysis 1.
    [Show full text]
  • Homophily and Long-Run Integration in Social Networks∗
    Homophily and Long-Run Integration in Social Networks∗ Yann Bramoulléy Sergio Currariniz Matthew O. Jacksonx Paolo Pin{ Brian W. Rogersk January 19, 2012 Abstract We study network formation in which nodes enter sequentially and form connections through a combination of random meetings and network-based search, as in Jackson and Rogers (2007). We focus on the impact of agents' heterogeneity on link patterns when connections are formed under type-dependent biases. In particular, we are concerned with how the local neighborhood of a node evolves as the node ages. We provide a surprising general result on long-run in- tegration whereby the composition of types in a node's neighborhood approaches the global type distribution, provided that the search part of the meeting process is unbiased. Integration, however, occurs only for suciently old nodes, while the aggregate distribution of connections still reects the bias of the random process. For a special case of the model, we analyze the form of these biases with regard to type-based degree distributions and group-level homophily patterns. Finally, we illustrate aspects of the model with an empirical application to data on citations in physics journals. JEL Codes: A14, D85, I21. ∗Following the suggestion of JET editors, this paper draws from two working papers developed independently: Bramoullé and Rogers (2010) and Currarini, Jackson and Pin (2010b). We gratefully acknowledge nancial support from the NSF under grant SES-0961481 and we thank Vincent Boucher for his research assistance. We also thank Habiba Djebbari, Andrea Galeotti, Sanjeev Goyal, James Moody, Betsy Sinclair, Bruno Strulovici, and Adrien Vigier, as well as numerous seminar participants.
    [Show full text]
  • Centrality in Modular Networks
    Ghalmane et al. EPJ Data Science (2019)8:15 https://doi.org/10.1140/epjds/s13688-019-0195-7 REGULAR ARTICLE OpenAccess Centrality in modular networks Zakariya Ghalmane1,3, Mohammed El Hassouni1, Chantal Cherifi2 and Hocine Cherifi3* *Correspondence: hocine.cherifi@u-bourgogne.fr Abstract 3LE2I, UMR6306 CNRS, University of Burgundy, Dijon, France Identifying influential nodes in a network is a fundamental issue due to its wide Full list of author information is applications, such as accelerating information diffusion or halting virus spreading. available at the end of the article Many measures based on the network topology have emerged over the years to identify influential nodes such as Betweenness, Closeness, and Eigenvalue centrality. However, although most real-world networks are made of groups of tightly connected nodes which are sparsely connected with the rest of the network in a so-called modular structure, few measures exploit this property. Recent works have shown that it has a significant effect on the dynamics of networks. In a modular network, a node has two types of influence: a local influence (on the nodes of its community) through its intra-community links and a global influence (on the nodes in other communities) through its inter-community links. Depending on the strength of the community structure, these two components are more or less influential. Based on this idea, we propose to extend all the standard centrality measures defined for networks with no community structure to modular networks. The so-called “Modular centrality” is a two-dimensional vector. Its first component quantifies the local influence of a node in its community while the second component quantifies its global influence on the other communities of the network.
    [Show full text]
  • Complex Networks in Computer Vision
    Complex networks in computer vision Pavel Voronin Shape to Network [Backes 2009], [Backes 2010a], [Backes 2010b] Weights + thresholds Feature vectors Features = characteris>cs of thresholded undirected binary networks: degree or joint degree (avg / min / max), avg path length, clustering coefficient, etc. Mul>scale Fractal Dimension Properes • Only uses distances => rotaon invariant • Weights normalized by max distance => scale invariant • Uses pixels not curve elements => robust to noise and outliers => applicable to skeletons, mul>ple contours Face recogni>on [Goncalves 2010], [Tang 2012a] Mul>ple binarizaon thresholds Texture to Network [Chalumeau 2008], [Backes 2010c], [Backes 2013] Thresholds + features Features: degree, hierarchical degree (avg / min / max) Invariance, robustness Graph structure analysis [Tang 2012b] Graph to Network Thresholds + descriptors Degree, joint degree, clustering-distance Saliency Saccade eye movements + different fixaon >me = saliency map => model them as walks in networks [Harel 2006], [Costa 2007], [Gopalakrishnan 2010], [Pal 2010], [Kim 2013] Network construc>on Nodes • pixels • segments • blocks Edges • local (neighbourhood) • global (most similar) • both Edge weights = (distance in feature space) / (distance in image space) Features: • relave intensity • entropy of local orientaons • compactness of local colour Random walks Eigenvector centrality == staonary distribu>on for Markov chain == expected >me a walker spends in the node Random walk with restart (RWR) If we have prior info on node importance,
    [Show full text]
  • Evolving Neural Networks Using Behavioural Genetic Principles
    Evolving Neural Networks Using Behavioural Genetic Principles Maitrei Kohli A dissertation submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy Department of Computer Science & Information Systems Birkbeck, University of London United Kingdom March 2017 0 Declaration This thesis is the result of my own work, except where explicitly acknowledged in the text. Maitrei Kohli …………………. 1 ABSTRACT Neuroevolution is a nature-inspired approach for creating artificial intelligence. Its main objective is to evolve artificial neural networks (ANNs) that are capable of exhibiting intelligent behaviours. It is a widely researched field with numerous successful methods and applications. However, despite its success, there are still open research questions and notable limitations. These include the challenge of scaling neuroevolution to evolve cognitive behaviours, evolving ANNs capable of adapting online and learning from previously acquired knowledge, as well as understanding and synthesising the evolutionary pressures that lead to high-level intelligence. This thesis presents a new perspective on the evolution of ANNs that exhibit intelligent behaviours. The novel neuroevolutionary approach presented in this thesis is based on the principles of behavioural genetics (BG). It evolves ANNs’ ‘general ability to learn’, combining evolution and ontogenetic adaptation within a single framework. The ‘general ability to learn’ was modelled by the interaction of artificial genes, encoding the intrinsic properties of the ANNs, and the environment, captured by a combination of filtered training datasets and stochastic initialisation weights of the ANNs. Genes shape and constrain learning whereas the environment provides the learning bias; together, they provide the ability of the ANN to acquire a particular task.
    [Show full text]
  • Incorporating Network Structure with Node Contents for Community Detection on Large Networks Using Deep Learning
    Neurocomputing 297 (2018) 71–81 Contents lists available at ScienceDirect Neurocomputing journal homepage: www.elsevier.com/locate/neucom Incorporating network structure with node contents for community detection on large networks using deep learning ∗ Jinxin Cao a, Di Jin a, , Liang Yang c, Jianwu Dang a,b a School of Computer Science and Technology, Tianjin University, Tianjin 300350, China b School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa 923-1292, Japan c School of Computer Science and Engineering, Hebei University of Technology, Tianjin 300401, China a r t i c l e i n f o a b s t r a c t Article history: Community detection is an important task in social network analysis. In community detection, in gen- Received 3 June 2017 eral, there exist two types of the models that utilize either network topology or node contents. Some Revised 19 December 2017 studies endeavor to incorporate these two types of models under the framework of spectral clustering Accepted 28 January 2018 for a better community detection. However, it was not successful to obtain a big achievement since they Available online 2 February 2018 used a simple way for the combination. To reach a better community detection, it requires to realize a Communicated by Prof. FangXiang Wu seamless combination of these two methods. For this purpose, we re-examine the properties of the mod- ularity maximization and normalized-cut models and fund out a certain approach to realize a seamless Keywords: Community detection combination of these two models. These two models seek for a low-rank embedding to represent of the Deep learning community structure and reconstruct the network topology and node contents, respectively.
    [Show full text]
  • Analysis of Statistical and Structural Properties of Complex Networks with Random Networks
    Appl. Math. Inf. Sci. 11, No. 1, 137-146 (2017) 137 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.18576/amis/110116 Analysis of Statistical and Structural Properties of Complex networks with Random Networks S. Vairachilai1,∗, M. K. Kavitha Devi2 and M. Raja 1 1 Department of CSE, Faculty of Science and Technology, IFHE Hyderabad, Telangana -501203, India. 2 Department of CSE, ThiagarajarCollege of Engineering, Madurai,Tamil Nadu-625015, India. Received: 2 Sep. 2016, Revised: 25 Oct. 2016, Accepted: 29 Oct. 2016 Published online: 1 Jan. 2017 Abstract: Random graphs are extensive, in addition, it is used in several functional areas of research, particularly in the field of complex networks. The study of complex networks is a useful and active research areas in science, such as electrical power grids and telecommunication networks, collaboration and citation networks of scientists,protein interaction networks, World-Wide Web and Internet Social networks, etc. A social network is a graph in which n vertices and m edges are selected at random, the vertices represent people and the edges represent relationships between them. In network analysis, the number of properties is defined and studied in the literature to identify the important vertex in a network. Recent studies have focused on statistical and structural properties such as diameter, small world effect, clustering coefficient, centrality measure, modularity, community structure in social networks like Facebook, YouTube, Twitter, etc. In this paper, we first provide a brief introduction to the complex network properties. We then discuss the complex network properties with values expected for random graphs.
    [Show full text]
  • Arxiv:2006.02870V1 [Cs.SI] 4 Jun 2020
    The why, how, and when of representations for complex systems Leo Torres Ann S. Blevins [email protected] [email protected] Network Science Institute, Department of Bioengineering, Northeastern University University of Pennsylvania Danielle S. Bassett Tina Eliassi-Rad [email protected] [email protected] Department of Bioengineering, Network Science Institute and University of Pennsylvania Khoury College of Computer Sciences, Northeastern University June 5, 2020 arXiv:2006.02870v1 [cs.SI] 4 Jun 2020 1 Contents 1 Introduction 4 1.1 Definitions . .5 2 Dependencies by the system, for the system 6 2.1 Subset dependencies . .7 2.2 Temporal dependencies . .8 2.3 Spatial dependencies . 10 2.4 External sources of dependencies . 11 3 Formal representations of complex systems 12 3.1 Graphs . 13 3.2 Simplicial Complexes . 13 3.3 Hypergraphs . 15 3.4 Variations . 15 3.5 Encoding system dependencies . 18 4 Mathematical relationships between formalisms 21 5 Methods suitable for each representation 24 5.1 Methods for graphs . 24 5.2 Methods for simplicial complexes . 25 5.3 Methods for hypergraphs . 27 5.4 Methods and dependencies . 28 6 Examples 29 6.1 Coauthorship . 29 6.2 Email communications . 32 7 Applications 35 8 Discussion and Conclusion 36 9 Acknowledgments 38 10 Citation diversity statement 38 2 Abstract Complex systems thinking is applied to a wide variety of domains, from neuroscience to computer science and economics. The wide variety of implementations has resulted in two key challenges: the progenation of many domain-specific strategies that are seldom revisited or questioned, and the siloing of ideas within a domain due to inconsistency of complex systems language.
    [Show full text]
  • Review of Community Detection Over Social Media: Graph Prospective
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 10, No. 2, 2019 Review of Community Detection over Social Media: Graph Prospective Pranita Jain1, Deepak Singh Tomar2 Department of Computer Science Maulana Azad National Institute of Technology Bhopal, India 462001 Abstract—Community over the social media is the group of globally distributed end users having similar attitude towards a particular topic or product. Community detection algorithm is used to identify the social atoms that are more densely interconnected relatively to the rest over the social media platform. Recently researchers focused on group-based algorithm and member-based algorithm for community detection over social media. This paper presents comprehensive overview of community detection technique based on recent research and subsequently explores graphical prospective of social media mining and social theory (Balance theory, status theory, correlation theory) over community detection. Along with that this paper presents a comparative analysis of three different state of art community detection algorithm available on I-Graph package on python i.e. walk trap, edge betweenness and fast greedy over six different social media data set. That yield intersecting facts about the capabilities and deficiency of community analysis methods. Fig 1. Social Media Network. Keywords—Community detection; social media; social media Aim of Community detection is to form group of mining; homophily; influence; confounding; social theory; homogenous nodes and figure out a strongly linked subgraphs community detection algorithm from heterogeneous network. In strongly linked sub- graphs (Community structure) nodes have more internal links than I. INTRODUCTION external. Detecting communities in heterogeneous networks is The Emergence of Social networking Site (SNS) like Face- same as, the graph partition problem in modern graph theory book, Twitter, LinkedIn, MySpace, etc.
    [Show full text]