Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

Recently, detecting dynamic patterns for growing communities in social networks have attracted significant attention. The objective of dynamic community detection is to analyze and identify clusters in complex networks that change over time. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of dynamic community detection. Although current evolutionary algorithms for identifying community structure can traverse extensive areas of partition space, they often become stuck in local minima. In addition, limited studies have addressed this issue by integrating local search strategies with evolutionary algorithms for community identification. This paper in

Intrusion Detection Systems (IDS) is the main defense mechanism deployed by the current networks to prevent cyber threats. Recurrent Neural Network (RNN) are also a novel IDS structure that replaces the conventional training and testing mechanism. The strategy encodes network traffic data as biological sequences using amino acid codons in such a fashion that the RNN is capable of effectively analyzing temporal and sequence data patterns. RNN architecture design adopts embedding layers to handle codon representations and Long Short-Term Memory (LSTM) layers to perform sequential data learning, which is followed by a fully connected network to perform classification functions, which preserve high feature extraction and classification

Community structures are fundamental in understanding the structure and functionality of complex networks. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of community detection. Recently, multi-objective evolutionary algorithms (MOEAs) have attracted many researchers to identify communities in static networks. Many algorithms have been proposed to find a solution that achieves a trade-off between exploring new areas of the solution space and improving the quality of existing solutions. In this trade-off is crucial; whereas exploitation improves existing solutions, it may fail to find better solutions from insufficiently explored regions o

Community detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algo

Sensibly 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

The density-based spatial clustering for applications with noise (DBSCAN) is one of the most popular applications of clustering in data mining, and it is used to identify useful patterns and interesting distributions in the underlying data. Aggregation methods for classifying nonlinear aggregated data. In particular, DNA methylations, gene expression. That show the differentially skewed by distance sites and grouped nonlinearly by cancer daisies and the change Situations for gene excretion on it. Under these conditions, DBSCAN is expected to have a desirable clustering feature i that can be used to show the results of the changes. This research reviews the DBSCAN and compares its performance with other algorithms, such as the tradit

Students’ feedback is crucial for educational institutions to assess the performance of their teachers, most opinions are expressed in their native language, especially for people in south Asian regions. In Pakistan, people use Roman Urdu to express their reviews, and this applied in the education domain where students used Roman Urdu to express their feedback. It is very time-consuming and labor-intensive process to handle qualitative opinions manually. Additionally, it can be difficult to determine sentence semantics in a text that is written in a colloquial style like Roman Urdu. This study proposes an enhanced word embedding technique and investigates the neural word Embedding (Word2Vec and Glove) to determine which perfo