A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
Document clustering is the process of organizing a particular electronic corpus of documents into subgroups of similar text features. Formerly, a number of conventional algorithms had been applied to perform document clustering. There are current endeavors to enhance clustering performance by employing evolutionary algorithms. Thus, such endeavors became an emerging topic gaining more attention in recent years. The aim of this paper is to present an up-to-date and self-contained review fully devoted to document clustering via evolutionary algorithms. It firstly provides a comprehensive inspection to the document clustering model revealing its various components with its related concepts. Then it shows and analyzes the principle research wor
... Show MoreEstablishing coverage of the target sensing field and extending the network’s lifetime, together known as Coverage-lifetime is the key issue in wireless sensor networks (WSNs). Recent studies realize the important role of nature-inspired algorithms in handling coverage-lifetime problem with different optimization aspects. One of the main formulations is to define coverage-lifetime problem as a disjoint set covers problem. In this paper, we propose an evolutionary algorithm for solving coverage-lifetime problem as a disjoint set covers function. The main interest in this paper is to reflect both models of sensing: Boolean and probabilistic. Moreover, a heuristic operator is proposed as a local refinement operator to improve the quality
... Show MoreSensibly highlighting the hidden structures of many real-world networks has attracted growing interest and triggered a vast array of techniques on what is called nowadays community detection (CD) problem. Non-deterministic metaheuristics are proved to competitively transcending the limits of the counterpart deterministic heuristics in solving community detection problem. Despite the increasing interest, most of the existing metaheuristic based community detection (MCD) algorithms reflect one traditional language. Generally, they tend to explicitly project some features of real communities into different definitions of single or multi-objective optimization functions. The design of other operators, however, remains canonical lacking any inte
... Show MoreClustering algorithms have recently gained attention in the related literature since
they can help current intrusion detection systems in several aspects. This paper
proposes genetic algorithm (GA) based clustering, serving to distinguish patterns
incoming from network traffic packets into normal and attack. Two GA based
clustering models for solving intrusion detection problem are introduced. The first
model coined as handles numeric features of the network packet, whereas
the second one coined as concerns all features of the network packet.
Moreover, a new mutation operator directed for binary and symbolic features is
proposed. The basic concept of proposed mutation operator depends on the most
frequent value
Due to the significant role in understanding cellular processes, the decomposition of Protein-Protein Interaction (PPI) networks into essential building blocks, or complexes, has received much attention for functional bioinformatics research in recent years. One of the well-known bi-clustering descriptors for identifying communities and complexes in complex networks, such as PPI networks, is modularity function. The contribution of this paper is to introduce heuristic optimization models that can collaborate with the modularity function to improve its detection ability. The definitions of the formulated heuristics are based on nodes and different levels of their neighbor properties. The modulari
... Show MoreClustering is an unsupervised learning method that classified data according to similarity probabilities. DBScan as a high-quality algorithm has been introduced for clustering spatial data due to its ability to remove noise (outlier) and constructing arbitrarily shapes. However, it has a problem in determining a suitable value of Eps parameter. This paper proposes a new clustering method, termed as DBScanBAT, that it optimizes DBScan algorithm by BAT algorithm. The proposed method automatically sets the DBScan parameters (Eps) and finds the optimal value for it. The results of the proposed DBScanBAT automatically generates near original number of clusters better than DBScanPSO and original DBScan. Furthermore, the proposed method
... Show More