Community Detection Using Jaacard Similarity with SIM-Edge Detection Techniques

The structure and dynamic nature of real-world networks can be revealed by communities that help in promotion of recommendation systems.Social Media platforms were initially developed for effective communication,but now it is being used widely for extending and to obtain profit among business community.The numerous data generated through these platforms are utilized by many companies that make a huge profit out of it.A giant network of people in social media is grouped together based on their similar properties to form a community.Commu-nity detection is recent topic among the research community due to the increase usage of online social network.Community is one of a significant property of a net-work that may have many communities which have similarity among them.Community detection technique play a vital role to discover similarities among the nodes and keep them strongly connected.Similar nodes in a network are grouped together in a single community.Communities can be merged together to avoid lot of groups if there exist more edges between them.Machine Learning algorithms use community detection to identify groups with common properties and thus for recommen-dation systems,health care assistance systems and many more.Considering the above,this paper presents alternative method SimEdge-CD(Similarity and Edge between's based Community Detection)for community detection.The two stages of SimEdge-CD initiallyfind the similarity among nodes and group them into one community.During the second stage,it identifies the exact affiliations of boundary nodes using edge betweenness to create well defined communities.Evaluation of proposed method on synthetic and real datasets proved to achieve a better accuracy-efficiency trade-of compared to other existing methods.Our proposed SimEdge-CD achieves ideal value of 1 which is higher than existing sim closure like LPA,Attractor,Leiden and walktrap techniques.

Dynamic evolutionary community detection algorithms based on the modularity matrix

Motivated by the relationship of the dynamic behaviors and network structure, in this paper, we present two efficient dynamic community detection algorithms. The phases of the nodes in the network can evolve according to our proposed differential equations. In each iteration, the phases of the nodes are controlled by several parameters. It is found that the phases of the nodes are ultimately clustered into several communities after a short period of evolution. They can be adopted to detect the communities successfully. The second differential equation can dynamically adjust several parameters, so it can obtain satisfactory detection results. Simulations on some test networks have verified the efficiency of the presented algorithms.

Density-based rough set model for hesitant node clustering in overlapping community detection

Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.

Alleviating the Cold Start Problem in Recommender Systems Based on Modularity Maximization Community Detection Algorithm

Recommender system (RS) has become a very important factor in many eCommerce sites. In our daily life, we rely on the recommendation from other persons either by word of mouth, recommendation letters, movie, item and book reviews printed in newspapers, etc. The typical Recommender Systems are software tools and techniques that provide support to people by identifying interesting products and services in online store. It also provides a recommendation for certain users who search for the recommendations. The most important open challenge in Collaborative filtering recommender system is the cold start problem. If the adequate or sufficient information is not available for a new item or users, the recommender system runs into the cold start problem. To increase the usefulness of collaborative recommender systems, it could be desirable to eliminate the challenge such as cold start problem. Revealing the community structures is crucial to understand and more important with the increasing popularity of online social networks. The community detection is a key issue in social network analysis in which nodes of the communities are tightly connected each other and loosely connected between other communities. Many algorithms like Givan-Newman algorithm, modularity maximization, leading eigenvector, walk trap, etc., are used to detect the communities in the networks. To test the community division is meaningful we define a quality function called modularity. Modularity is that the links within a community are higher than the expected links in those communities. In this paper, we try to give a solution to the cold-start problem based on community detection algorithm that extracts the community from the social networks and identifies the similar users on that network. Hence, within the proposed work several intrinsic details are taken as a rule of thumb to boost the results higher. Moreover, the simulation experiment was taken to solve the cold start problem.

Research community detection from multi-relation researcher network based on structure/attribute similarities

Purpose: This paper aims to provide a method to detect research communities based on research interest in researcher network, which combines the topological structure and vertex attributes in a unified manner.Design/methodology/approach: A heterogeneous researcher network has been constructed by combining multiple relations of academic researchers. Vertex attributes and their similarities were considered and calculated. An approach has been proposed and tested to detect research community in research organizations based on this multi-relation researcher network.Findings: Detection of topologically well-connected, semantically coherent and meaningful research community was achieved.Research limitations: The sample size of evaluation experiments was relatively small. In the present study, a limited number of 72 researchers were analyzed for constructing researcher network and detecting research community. Therefore, a large sample size is required to give more information and reliable results.Practical implications: The proposed multi-relation researcher network and approaches for discovering research communities of similar research interests will contribute to collective innovation behavior such as brainstorming and to promote interdisciplinary cooperation.Originality/value: Recent researches on community detection devote most efforts to singlerelation researcher networks and put the main focus on the topological structure of networks.In reality, there exist multi-relation social networks. Vertex attribute also plays an important role in community detection. The present study combined multiple single-relational researcher networks into a multi-relational network and proposed a structure-attribute clustering method for detecting research community in research organizations.

Seed-Oriented Local Community Detection Based on Influence Spreading

In recent years,local community detection algorithms have developed rapidly because of their nearly linear computing time and the convenience of obtaining the local information of real-world networks.However,there are still some issues that need to be further studied.First,there is no local community detection algorithm dedicated to detecting a seed-oriented local community,that is,the local community with the seed as the core.The second and third issues are that the quality of local communities detected by the previous local community detection algorithms are largely dependent on the position of the seed and predefined parameters,respectively.To solve the existing problems,we propose a seed-oriented local community detection algorithm,named SOLCD,that is based on influence spreading.First,we propose a novel measure of node influence named k-core centrality that is based on the k-core value of adjacent nodes.Second,we obtain the seed-oriented local community,which is composed of the may-members and the must-member chain of the seed,by detecting the influence scope of the seed.The may-members and the must-members of the seed are determined by judging the influence relationship between the node and the seed.Five state-of-art algorithms are compared to SOLCD on six real-world networks and three groups of artificial networks.The experimental results show that SOLCD can achieve a high-quality seed-oriented local community for various real-world networks and artificial networks with different parameters.In addition,when taking nodes with different influence as seeds,SOLCD can stably obtain high-quality seed-oriented local communities.

Community detection in signed networks based on discrete-time model

Community detection in signed networks has been studied widely in recent years. In this paper, a discrete difference equation is proposed to imitate the consistently changing phases of the nodes. During the interaction, each node will update its phase based on the difference equation. Each node has many different nodes connected with it, and these neighbors have different influences on it. The similarity between two nodes is applied to describe the influences between them. Nodes with high positive similarities will get together and nodes with negative similarities will be far away from each other.Communities are detected ultimately when the phases of the nodes are stable. Experiments on real world and synthetic signed networks show the efficiency of detection performance. Moreover, the presented method gains better detection performance than two existing good algorithms.

Improved Density Peaking Algorithm for Community Detection Based on Graph Representation Learning

There is a large amount of information in the network data that we canexploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of network data is usually paired with clustering algorithms to solve the community detection problem.Meanwhile, there is always an unpredictable distribution of class clusters outputby graph representation learning. Therefore, we propose an improved densitypeak clustering algorithm (ILDPC) for the community detection problem, whichimproves the local density mechanism in the original algorithm and can betteraccommodate class clusters of different shapes. And we study the communitydetection in network data. The algorithm is paired with the benchmark modelGraph sample and aggregate (GraphSAGE) to show the adaptability of ILDPCfor community detection. The plotted decision diagram shows that the ILDPCalgorithm is more discriminative in selecting density peak points compared tothe original algorithm. Finally, the performance of K-means and other clusteringalgorithms on this benchmark model is compared, and the algorithm is proved tobe more suitable for community detection in sparse networks with the benchmarkmodel on the evaluation criterion F1-score. The sensitivity of the parameters ofthe ILDPC algorithm to the low-dimensional vector set output by the benchmarkmodel GraphSAGE is also analyzed.

Community Detection in Aviation Network Based on K-means and Complex Network

With the increasing number of airports and the expansion of their scale,the aviation network has become complex and hierarchical.In order to investigate the complex network characteristics of aviation networks,this paper constructs a Chinese aviation network model and carries out related research based on complex network theory and K-means algorithm.Initially,the P-space model is employed to construct the Chinese aviation network model.Then,complex network indicators such as degree,clustering coefficient,average path length,betweenness and coreness are selected to investigate the complex characteristics and hierarchical features of aviation networks and explore their causes.Secondly,using K-means clustering algorithm,five values are obtained as the initial clustering parameter K values for each of the aviation network hierarchies classified according to five complex network indicators.Meanwhile,clustering simulation experiments are conducted to obtain the visual clustering results of Chinese aviation network nodes under different K values,as well as silhouette coefficients for evaluating the clustering effect of each indicator in order to obtain the hierarchical classification of aviation networks under different indicators.Finally,the silhouette coefficient is optimal when the K value is 4.Thus,the clustering results of the four layers of the aviation network can be obtained.According to the experimental results,the complex network association discovery method combined with K-means algorithm has better applicability and simplicity,while the accuracy is improved.

Clustering residential electricity load curve via community detection in network

Performing analytics on the load curve(LC)of customers is the foundation for demand response which requires a better understanding of customers'consumption pattern(CP)by analyzing the load curve.However,the performances of previous widely-used LC clustering methods are poor in two folds:larger number of clusters,huge variances within a cluster(a CP is extracted from a cluster),bringing huge difficulty to understand the electricity consumption pattern of customers.In this paper,to improve the performance of LC clustering,a clustering framework incorporated with community detection is proposed.The framework includes three parts:network construction,community detection,and CP extraction.According to the cluster validity index(CVI),the integrated approach outperforms the previous state-of-the-art method with the same amount of clusters.And the approach needs fewer clusters to achieve the same performance measured by CVI.

An Improved Harris Hawks Optimization Algorithm with Multi-strategy for Community Detection in Social Network

The purpose of community detection in complex networks is to identify the structural location of nodes. Complex network methods are usually graphical, with graph nodes representing objects and edges representing connections between things. Communities are node clusters with many internal links but minimal intergroup connections. Although community detection has attracted much attention in social media research, most face functional weaknesses because the structure of society is unclear or the characteristics of nodes in society are not the same. Also, many existing algorithms have complex and costly calculations. This paper proposes different Harris Hawk Optimization (HHO) algorithm methods (such as Improved HHO Opposition-Based Learning(OBL) (IHHOOBL), Improved HHO Lévy Flight (IHHOLF), and Improved HHO Chaotic Map (IHHOCM)) were designed to balance exploitation and exploration in this algorithm for community detection in the social network. The proposed methods are evaluated on 12 different datasets based on NMI and modularity criteria. The findings reveal that the IHHOOBL method has better detection accuracy than IHHOLF and IHHOCM. Also, to offer the efficiency of the , state-of-the-art algorithms have been used as comparisons. The improvement percentage of IHHOOBL compared to the state-of-the-art algorithm is about 7.18%.

Discrete Improved Grey Wolf Optimizer for Community Detection

Detecting communities in real and complex networks is a highly contested topic in network analysis.Although many metaheuristic-based algorithms for community detection have been proposed,they still cannot effectively fulfill large-scale and real-world networks.Thus,this paper presents a new discrete version of the Improved Grey Wolf Optimizer(I-GWO)algorithm named DI-GWOCD for effectively detecting communities of different networks.In the proposed DI-GWOCD algorithm,I-GWO is first armed using a local search strategy to discover and improve nodes placed in improper communities and increase its ability to search for a better solution.Then a novel Binary Distance Vector(BDV)is introduced to calculate the wolves’distances and adapt I-GWO for solving the discrete community detection problem.The performance of the proposed DI-GWOCD was evaluated in terms of modularity,NMI,and the number of detected communities conducted by some well-known real-world network datasets.The experimental results were compared with the state-of-the-art algorithms and statistically analyzed using the Friedman and Wilcoxon tests.The comparison and the statistical analysis show that the proposed DI-GWOCD can detect the communities with higher quality than other comparative algorithms.

Isolate Sets Based Parallel Louvain Method for Community Detection

Community detection is a vital task in many fields,such as social networks and financial analysis,to name a few.The Louvain method,the main workhorse of community detection,is a popular heuristic method.To apply it to large-scale graph networks,researchers have proposed several parallel Louvain methods(PLMs),which suffer from two challenges:the latency in the information synchronization,and the community swap.To tackle these two challenges,we propose an isolate sets based parallel Louvain method(IPLM)and a fusion IPLM with the hashtables based Louvain method(FIPLM),which are based on a novel graph partition algorithm.Our graph partition algorithm divides the graph network into subgraphs called isolate sets,in which the vertices are relatively decoupled from others.We first describe the concepts and properties of the isolate set.Second we propose an algorithm to divide the graph network into isolate sets,which enjoys the same computation complexity as the breadth-first search.Third,we propose IPLM,which can efficiently calculate and update vertices information in parallel without latency or community swap.Finally,we achieve further acceleration by FIPLM,which maintains a high quality of community detection with a faster speedup than IPLM.Our two methods are for shared-memory architecture,and we implement our methods on an 8-core PC;the experiments show that IPLM achieves a maximum speedup of 4.62x and outputs higher modularity(maximum 4.76%)than the serial Louvain method on 14 of 18 datasets.Moreover,FIPLM achieves a maximum speedup of 7.26x.

Community Detection Applications in Mobile Networks:Towards Data-Driven Design for Next Generation Cellular Networks

The existing radio access network(RAN)is facing many challenges to meet the very strict speed and latency requirements by different mobile applications in addition to the increasing pressure to reduce operating cost.Innovation and development in RAN have been accelerated to tackle these challenges and to define how next generation mobile networks should look like.The role of machine learning(ML)and artificial intelligence(AI)driven innovations within the RAN domain is strengthening and attracting lots of attention to tackle many of the challenging problems.In this paper we surveyed RAN network base stations(BSs)clustering and its applications in the literature.The paper also demonstrates how to leverage community detection algorithms to understand underlying community structures within RAN.Tracking areas(TAs)novel framework was developed by adapting existing community detection algorithm to solve the problem of statically partitioning a set of BSs into TA according to mobility patterns.Finally,live network dataset in dense urban part of Cairo is used to assess how the developed framework is used to partition this part of the network more efficiently compared to other clustering techniques.Results obtained showed that the new methodology saved up to 34.6%of inter TA signaling overhead and surpassing other conventional clustering algorithms.

Counterfactual Reasoning over Community Detection:A Case Study of the Public Science Day Community

With the rapid rise of new media platforms such as Weibo and Tiktok,communities with science communication characteristics have progressively grown on social networks.These communities pursue essential objectives such as increased visibility and influence.For the success of the public understanding of science in China,case studies of science communication communities on social media are becoming increasingly valuable as a point of reference.The authenticity of user influence plays an important role in the analysis of the final outcome during the process of community detection.By integrating counterfactual reasoning theory into a community detection algorithm,we present a novel paradigm for eliminating influence bias in online communities.We consider the community of Public Science Day of the Chinese Academy of Sciences as a case study to demonstrate the validity of the proposed paradigm.In addition,we examine data on science communication activities,analyze the key elements of activity communication,and provide references for not only augmenting the communication impact of similar types of popular science activities but also advancing science communication in China.Our main finding is that the propagation channel for the science communication experiment exhibits multi-point scattered propagation and lacks a continuous chain in the process of propagation.

DPTP-LICD:A differential privacy trajectory protection method based on latent interest community detection

With the rapid development of high-speed mobile network technology and high-precision positioning technology,the trajectory information of mobile users has received extensive attention from academia and industry in the field of Location-based Social Networks.Researchers can mine users’trajectories in Location-based Social Networks to obtain sensitive information,such as friendship groups,activity patterns,and consumption habits.Therefore,mobile users’privacy and security issues have received growing attention in Location-based Social networks.It is crucial to strike a balance between privacy protection and data availability.This paper proposes a differential privacy trajectory protection method based on latent interest community detection(DPTP-LICD),ensuring strict privacy protection standards and user data availability.Firstly,based on the historical trajectory information of users,spatiotemporal constraint information is extracted to construct a potential community strength model for mobile users.Secondly,the latent interest community obtained from the analysis is used to identify preferred hot spots on the user’s trajectory,and their priorities are assigned based on a popularity model.A reasonable privacy budget is allocated to prevent excessive noise from being added and rendering the protected trajectory data unusable.Finally,to prevent privacy leakage,we add Laplace and exponential noise in generating preferred hot spots and recommending user interest points.Security and effectiveness analysis shows that our mechanism provides effective points of interest recommendations and protects users’privacy from disclosure.

Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks

In this paper, we propose a balanced multi-label propagation algorithm （BMLPA） for overlapping community detection in social networks. As well as its fast speed, another important advantage of our method is good stability, which other multi-label propagation algorithms, such as COPRA, lack. In BMLPA, we propose a new update strategy, which requires that community identifiers of one vertex should have balanced belonging coefficients. The advantage of this strategy is that it allows vertices to belong to any number of communities without a global limit on the largest number of community memberships, which is needed for COPRA. Also, we propose a fast method to generate ＂rough cores＂, which can be used to initialize labels for multi-label propagation algorithms, and are able to improve the quality and stability of results. Experimental results on synthetic and real social networks show that BMLPA is very efficient and effective for uncovering overlapping communities.

Community Detection in Dynamic Social Networks Based on Multiobjective Immune Algorithm

Community structure is one of the most has received an enormous amount of attention in recent important properties in social networks, and community detection years. In dynamic networks, the communities may evolve over time so that pose more challenging tasks than in static ones. Community detection in dynamic networks is a problem which can naturally be formulated with two contradictory objectives and consequently be solved by multiobjective optimization algorithms. In this paper, a novel nmltiobjective immune algorithm is proposed to solve the community detection problem in dynamic networks. It employs the framework of nondominated neighbor immune algorithm to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. The problem-specific knowledge is incorporated in genetic operators and local search to improve the effectiveness and efficiency of our method. Experimental studies based on four synthetic datasets and two real-world social networks demonstrate that our algorithm can not only find community structure and capture community evolution more accurately but also be more steadily than the state-of-the-art algorithms.

Local Community Detection Using Link Similarity

Exploring local community structure is an appealing problem that has drawn much recent attention in the area of social network analysis. As the complete information of network is often difficult to obtain, such as networks of web pages, research papers and Facebook users, people can only detect community structure from a certain source vertex with limited knowledge of the entire graph. The existing approaches do well in measuring the community quality, but they are largely dependent on source vertex and putting too strict policy in agglomerating new vertices. Moreover, they have predefined parameters which are difficult to obtain. This paper proposes a method to find local community structure by analyzing link similarity between the community and the vertex. Inspired by the fact that elements in the same community are more likely to share common links, we explore community structure heuristically by giving priority to vertices which have a high link similarity with the community. A three-phase process is also used for the sake of improving quality of community structure. Experimental results prove that our method performs effectively not only in computer-generated graphs but also in real-world graphs.

Refactoring Software Packages via Community Detection in Complex Software Networks

An intrinsic property of software in a real-world environment is its need to evolve, which is usually accompanied by the increase of software complexity and deterioration of software quality, making software maintenance a tough problem. Refactoring is regarded as an effective way to address this problem. Many refactoring approaches at the method and class level have been proposed. But the research on software refactoring at the package level is very little. This paper presents a novel approach to refactor the package structures of object oriented software. It uses software networks to represent classes and their dependencies. It proposes a constrained community detection algorithm to obtain the optimized community structures in software networks, which also correspond to the optimized package structures. And it finally provides a list of classes as refactoring candidates by comparing the optimized package structures with the real package structures. The empirical evaluation of the proposed approach has been performed in two open source Java projects, and the benefits of our approach are illustrated in comparison with the other three approaches.