2,476 Hits in 5.1 sec

Overlapping Community Detection Algorithm based on Coarsening and Local Overlapping Modularity

Zhanghui Liu, Bingjie Xiang, Wenzhong Guo, Yuzhong Chen, Kun Guo, Jianning Zheng
2019 IEEE Access  
This paper proposes an overlapping community discovery algorithm based on coarsening and local overlapping modularity.  ...  INDEX TERMS Community detection, overlapping communities, triangle coarsening, local overlapping modularity.  ...  COMMUNITY DETECTION BASED ON COARSENING AND LOCAL MODULARITY A.  ... 
doi:10.1109/access.2019.2912182 fatcat:ibczhlarqjbwxeaj3utfcnbebq

How modular structure can simplify tasks on networks: a parameterizing graph optimization by fast local community detection

B.-M. Bui-Xuan, N. S. Jones
2014 Proceedings of the Royal Society A  
Research Cite this article: Bui-Xuan B-M, Jones NS. 2014 How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection. Proc. R. Soc.  ...  It is also the case that a marked community structure is present in many empirical networks and that networks with similar functions appear to have similar community structure [4] [5] [6] .  ...  Indeed it has been found that particular choices of dynamics on networks can in turn correspond to particular methods for detecting communities in graphs [14] .  ... 
doi:10.1098/rspa.2014.0224 pmid:25294962 pmcid:PMC4156142 fatcat:6eoefmwqlvhlfkw7r5g3xk5vrm

How modular structure can simplify tasks on networks [article]

Binh-Minh Bui-Xuan, Nick S. Jones
2013 arXiv   pre-print
Since we exploit a form of local community detection as a preprocessing, this work gives support to the project of developing heuristic algorithms for detecting dense regions in networks: preprocessing  ...  of nodes in a coarsened network.  ...  It is also the case that a marked community structure is present in many empirical networks and that networks with similar functions appear to have similar community structure [4] [5] [6] .  ... 
arXiv:1305.4760v1 fatcat:6csetyrcp5g73hcpjdgdei6lzq

ACE: Ant Colony based Multi-level Network Embedding for Hierarchical Graph Representation Learning

Jianming Lv, Jiajie Zhong, Jintao Liang, Zhenguo Yang
2019 IEEE Access  
The source code and the datasets used in this paper are available on Github ( INDEX TERMS Ant colony, network embedding, multi-level.  ...  ACE works by using an ant colony-based graph coarsening algorithm to group the nodes according to their relationship to achieve a multi-level clustering pyramid of the input graph.  ...  This proves that the ACO based coarsening are more suitable for improving network embedding than the typical group based community detection algorithms like LPA [20] , [27] , as discussed in Section  ... 
doi:10.1109/access.2019.2920671 fatcat:5xnmgbhacraf3jyxxc5p4vk5mu

A Multilevel Approach for Overlapping Community Detection

Alan Valejo, Jorge Valverde-Rebaza, Alneu de Andrade Lopes
2014 2014 Brazilian Conference on Intelligent Systems  
Many real world complex networks have an a overlapping community structure, in which a vertex belongs to one or more communities.  ...  Numerous approaches for crisp overlapping community detection were proposed in the literature, most of them have a good accuracy but their computational costs are considerably high and infeasible for large-scale  ...  Most community detection approach emphasize methods based on partition of network into disjoint communities, i.e. each vertex belongs to only one community, Figure 1 (a).  ... 
doi:10.1109/bracis.2014.76 dblp:conf/bracis/ValejoVL14 fatcat:coerm77vxbev3lkaam77s5da3q

Multilayer network simplification: approaches, models and methods [article]

Roberto Interdonato, Matteo Magnani, Diego Perna, Andrea Tagarelli, Davide Vega
2020 arXiv   pre-print
methods defined to analyze simple networks do not have a straightforward extension able to handle multiple layers.  ...  Multilayer networks have been widely used to represent and analyze systems of interconnected entities where both the entities and their connections can be of different types.  ...  One of the earliest methods designed for multilayer networks, specifically for community detection purposes, is Principled Modularity Maximization (PMM) [130] .  ... 
arXiv:2004.14808v1 fatcat:tqe3f2zhxrfgvnlnifkiln7kyq

Naming Games in Spatially-Embedded Random Networks [article]

Qiming Lu, G. Korniss, Boleslaw K. Szymanski
2007 arXiv   pre-print
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks.  ...  Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks  ...  The basic LE algorithms are essentially based on finding global extremum (e.g., maximum) through local communications (Angluin 1980; Hirschberg & Sinclair 1980; LeLann 1977) .  ... 
arXiv:cs/0604075v3 fatcat:qdlw57rp2jfbjhftmycafvoeia

Network Representation Learning Algorithm Based on Complete Subgraph Folding

Dongming Chen, Mingshuo Nie, Jiarui Yan, Dongqi Wang, Qianqian Gan
2022 Mathematics  
The proposed algorithm outperforms the baselines in evaluation metrics on community detection and multi-label classification tasks.  ...  In this paper, we propose SF-NRL, a network representation learning algorithm based on complete subgraph folding.  ...  Related Work NRL methods are widely employed in network data mining tasks, including community detection [8] , node classification [9] , and link prediction [10] .  ... 
doi:10.3390/math10040581 fatcat:khaafygicnaedfyfnrv2xa7r2i

Synergistic partitioning in multiple large scale social networks

Songchang Jin, Jiawei Zhang, Philip S. Yu, Shuqiang Yang, Aiping Li
2014 2014 IEEE International Conference on Big Data (Big Data)  
With that, the partitions containing the same nodes can be assigned to the same server to improve the data locality and reduce communication overhead among servers, which are very important for distributed  ...  Based on the given anchor nodes which exist in all the social networks and the partition results of the first network, using MapReduce, we then develop a modified distributed multilevel partitioning method  ...  In our previous work, we have developed a novel community detection method, MCD (Mutual Community Detector) [4] which uses the heterogeneous information in multiple networks, but this method is limited  ... 
doi:10.1109/bigdata.2014.7004243 dblp:conf/bigdataconf/JinZYYL14 fatcat:6hkjahfwzjfdvmnoagr56o6ufq

Naming games in two-dimensional and small-world-connected random geometric networks

Qiming Lu, G. Korniss, B. K. Szymanski
2008 Physical Review E  
We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly  ...  Implementing the Naming Games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks.  ...  Barrat for comments on this work. This research was supported in part by NSF Grant Nos. DMR-0426488 (G.K. and Q.L.), NGS-0103708 (B.K.S. and Q.L.), and by Rensselaer's Seed Program.  ... 
doi:10.1103/physreve.77.016111 pmid:18351919 fatcat:nyxikyksuvcg3j7ntbhlmki5fi

Modularity based Community Detection in Social Networks

2020 International Journal of Engineering and Advanced Technology  
Various modularity based community detection approaches are given for different domains. The network in the real-world may be weighted, heterogeneous or dynamic.  ...  In recent years, several approaches have been proposed for community detection and validation of the result.  ...  Type of Network: Here, various networks are classified based on the weight of the edges. A network is called weighted if links between two nodes have some weight otherwise it is called unweighted.  ... 
doi:10.35940/ijeat.b3382.029320 fatcat:4nxhrwuar5gb5e6drjzijisw4y

Community Detection Using Jaacard Similarity with SIM-Edge Detection Techniques

K. Chitra, A. Tamilarasi
2023 Computer systems science and engineering  
A giant network of people in social media is grouped together based on their similar properties to form a community.  ...  Considering the above, this paper presents alternative method SimEdge-CD (Similarity and Edge between's based Community Detection) for community detection.  ...  Funding Statement: The authors received no specific funding for this study. Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.  ... 
doi:10.32604/csse.2023.023920 fatcat:edbf6z5y45hahgkwzidnbrgkh4

High quality multi-core multi-level algorithm for community detection

Rahil Sharma, Suely Oliveira
2017 International Journal of Computational Science and Engineering (IJCSE)  
We detect high modularity communities by applying MCML on Facebook Forum dataset to find users with similar interests and Amazon product dataset.  ...  One of the most relevant and widely studied structural properties of networks is their community structure or clustering.  ...  Acknowledgements We would like to thank the reviewers for their time and helpful advice.  ... 
doi:10.1504/ijcse.2017.10008129 fatcat:dcattw6w3veq7hg7dfvrqkw3si

Multiscale Planar Graph Generation [article]

Varsha Chauhan, Alexander Gutfraind, Ilya Safro
2019 arXiv   pre-print
and researchers often rely on synthetic data for simulations, hypothesis testing, decision making, and algorithm engineering.  ...  The method follows a multi-scale randomized editing approach generating a hierarchy of coarsened networks of a given planar graph and introducing edits at various levels in the hierarchy.  ...  Instead of leveraging multiscale coarsening schemes, ReCoN generated synthetic networks by randomizing the edges between communities which were detected by the community detection methods while keeping  ... 
arXiv:1802.09617v2 fatcat:euyxreozynglflkmi2y64j27fu

MILE: A Multi-Level Framework for Scalable Graph Embedding [article]

Jiongqian Liang, Saket Gurukar, Srinivasan Parthasarathy
2020 arXiv   pre-print
Our code and data are publicly available with detailed instructions for adding new base embedding methods: .  ...  MILE repeatedly coarsens the graph into smaller ones using a hybrid matching technique to maintain the backbone structure of the graph.  ...  Multi-level Community Detection: The multi-level approach has been widely studied for efficient community detection (Karypis and Kumar 1998b; Satuluri and Parthasarathy 2009; Dhillon, Guan, and Kulis  ... 
arXiv:1802.09612v2 fatcat:nr6juce2zra6homdhtv5khdol4
« Previous Showing results 1 — 15 out of 2,476 results