921 research outputs found
Community detection in multiplex networks using locally adaptive random walks
Multiplex networks, a special type of multilayer networks, are increasingly
applied in many domains ranging from social media analytics to biology. A
common task in these applications concerns the detection of community
structures. Many existing algorithms for community detection in multiplexes
attempt to detect communities which are shared by all layers. In this article
we propose a community detection algorithm, LART (Locally Adaptive Random
Transitions), for the detection of communities that are shared by either some
or all the layers in the multiplex. The algorithm is based on a random walk on
the multiplex, and the transition probabilities defining the random walk are
allowed to depend on the local topological similarity between layers at any
given node so as to facilitate the exploration of communities across layers.
Based on this random walk, a node dissimilarity measure is derived and nodes
are clustered based on this distance in a hierarchical fashion. We present
experimental results using networks simulated under various scenarios to
showcase the performance of LART in comparison to related community detection
algorithms
Community Detection in Networks using Bio-inspired Optimization: Latest Developments, New Results and Perspectives with a Selection of Recent Meta-Heuristics
Detecting groups within a set of interconnected nodes is a widely addressed prob- lem that can model a diversity of applications. Unfortunately, detecting the opti- mal partition of a network is a computationally demanding task, usually conducted by means of optimization methods. Among them, randomized search heuristics have been proven to be efficient approaches. This manuscript is devoted to pro- viding an overview of community detection problems from the perspective of bio-inspired computation. To this end, we first review the recent history of this research area, placing emphasis on milestone studies contributed in the last five years. Next, we present an extensive experimental study to assess the performance of a selection of modern heuristics over weighted directed network instances. Specifically, we combine seven global search heuristics based on two different similarity metrics and eight heterogeneous search operators designed ad-hoc. We compare our methods with six different community detection techniques over a benchmark of 17 Lancichinetti-Fortunato-Radicchi network instances. Ranking statistics of the tested algorithms reveal that the proposed methods perform com- petitively, but the high variability of the rankings leads to the main conclusion: no clear winner can be declared. This finding aligns with community detection tools available in the literature that hinge on a sequential application of different algorithms in search for the best performing counterpart. We end our research by sharing our envisioned status of this area, for which we identify challenges and opportunities which should stimulate research efforts in years to come
Network community detection via iterative edge removal in a flocking-like system
We present a network community-detection technique based on properties that
emerge from a nature-inspired system of aligning particles. Initially, each
vertex is assigned a random-direction unit vector. A nonlinear dynamic law is
established so that neighboring vertices try to become aligned with each other.
After some time, the system stops and edges that connect the least-aligned
pairs of vertices are removed. Then the evolution starts over without the
removed edges, and after enough number of removal rounds, each community
becomes a connected component. The proposed approach is evaluated using
widely-accepted benchmarks and real-world networks. Experimental results reveal
that the method is robust and excels on a wide variety of networks. Moreover,
for large sparse networks, the edge-removal process runs in quasilinear time,
which enables application in large-scale networks
Community Detection over Social Media: A Compressive Survey
Social media mining is an emerging field with a lot of research areas such as, sentiment analysis, link prediction, spammer detection, and community detection. In today’s scenario, researchers are working in the area of community detection and sentiment analysis because the main component of social media is user. Users create different types of community in social world. The ideas and discussions in the community may be negative or positive. To detect the communities and their behavior researcher have done a lot of work, but still two major issues are presents per survey, Scalability and Quality of the community. These issues of community detection motivate to work in this area of social media mining. This paper gives a bird eye view over social media and community detection
Disease diagnosis in smart healthcare: Innovation, technologies and applications
To promote sustainable development, the smart city implies a global vision that merges artificial intelligence, big data, decision making, information and communication technology (ICT), and the internet-of-things (IoT). The ageing issue is an aspect that researchers, companies and government should devote efforts in developing smart healthcare innovative technology and applications. In this paper, the topic of disease diagnosis in smart healthcare is reviewed. Typical emerging optimization algorithms and machine learning algorithms are summarized. Evolutionary optimization, stochastic optimization and combinatorial optimization are covered. Owning to the fact that there are plenty of applications in healthcare, four applications in the field of diseases diagnosis (which also list in the top 10 causes of global death in 2015), namely cardiovascular diseases, diabetes mellitus, Alzheimer’s disease and other forms of dementia, and tuberculosis, are considered. In addition, challenges in the deployment of disease diagnosis in healthcare have been discussed
Methods for community detection in multi-layer networks
Many complex systems are composed of coupled networks through different layers, where each layer represents one of many possible types of interactions. One of the most relevant features is to extract communities in multi-layer networks. Community detection is a very hard problem and not yet satisfactorily solved, despite has been extensively studied in literature. The current algorithms either collapse multi-layer networks into a single-layer network or extend the algorithms for single-layer networks by using consensus clustering. However, these approaches have been criticized for ignoring the connection among various layers, thereby
resulting in low accuracy. To overcome these problems, we propose more methods for community detection that simultaneously take into account multiple layers. Then we compare them through experiments on both artificial and real world networks
Recommended from our members
Multi-objective community detection applied to social and COVID-19 constructed networks
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University LondonCommunity Detection plays an integral part in network analysis, as it facilitates understanding the structures and functional characteristics of the network. Communities organize real-world networks into densely connected groups of nodes. This thesis provides a critical analysis of the Community Detection and highlights the main areas including algorithms, evaluation metrics, applications, and datasets in social networks.
After defining the research gap, this thesis proposes two Attribute-Based Label Propagation algorithms that maximizes both Modularity and homogeneity. Homogeneity is considered as an objective function one time, and as a constraint another time. To better capture the homogeneity of real-world networks, a new Penalized Homogeneity degree (PHd) is proposed, that can be easily personalized based on the network characteristics.
For the first time, COVID-19 tracing data are utilized to form two dataset networks: one is based on the virus transition between the world countries. While the second dataset is an attributed network based on the virus transition among the contact-tracing in the Kingdom of Bahrain. This type of networks that is concerned in tracking a disease was not formed based on COVID-19 virus and has never been studied as a community detection problem. The proposed datasets are validated and tested in several experiments. The proposed Penalized Homogeneity measure is personalized and used to evaluate the proposed attributed network.
Extensive experiments and analysis are carried out to evaluate the proposed methods and benchmark the results with other well-known algorithms. The results are compared in terms of Modularity, proposed PHd, and accuracy measures. The proposed methods have achieved maximum performance among other methods, with 26.6% better performance in Modularity, and 33.96% in PHd on the proposed dataset, as well as noteworthy results on benchmarking datasets with improvement in Modularity measures of 7.24%, and 4.96% respectively, and proposed PHd values 27% and 81.9%
- …