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 optim

Data generated from modern applications and the internet in healthcare is extensive and rapidly expanding. Therefore, one of the significant success factors for any application is understanding and extracting meaningful information using digital analytics tools. These tools will positively impact the application's performance and handle the challenges that can be faced to create highly consistent, logical, and information-rich summaries. This paper contains three main objectives: First, it provides several analytics methodologies that help to analyze datasets and extract useful information from them as preprocessing steps in any classification model to determine the dataset characteristics. Also, this paper provides a comparative st

Medical imaging is a technique that has been used for diagnosis and treatment of a large number of diseases. Therefore it has become necessary to conduct a good image processing to extract the finest desired result and information. In this study, genetic algorithm (GA)-based clustering technique (K-means and Fuzzy C Means (FCM)) were used to segment thyroid Computed Tomography (CT) images to an extraction thyroid tumor. Traditional GA, K-means and FCM algorithms were applied separately on the original images and on the enhanced image with Anisotropic Diffusion Filter (ADF). The resulting cluster centers from K-means and FCM were used as the initial population in GA for the implementation of GAK-Mean and GAFCM. Jaccard index was used to s

Abstract
Dame Ngaio Edith Marsh (1899-1982), a writer of detective fiction, was born
at Christchurch, New Zealand. Her hero, Chief Detective Inspector Roderick Alleyn,
appears in her first novel, A Man Lay Dead (1934), and in subsequent novels
including Death and the Dancing Footman (1942). She wrote twenty detective novels.
The Dancing Footman, Thomas, listening to a playful song from the smokingroom's
radio where William lay dead after being killed by his brother, Nicholas,
provides the most suspected guest at Highfold with badly needed alibi. The murderer,
Nicholas, plans an almost perfect crime, but the dance of this footman spoils his
scheme. When Alleyn and his group of policemen stage a show in which the

      Twitter popularity has increasingly grown in the last few years, influencing life’s social, political, and business aspects. People would leave their tweets on social media about an event, and simultaneously inquire to see other people's experiences and whether they had a positive/negative opinion about that event. Sentiment Analysis can be used to obtain this categorization. Product reviews, events, and other topics from all users that comprise unstructured text comments are gathered and categorized as good, harmful, or neutral using sentiment analysis. Such issues are called polarity classifications. This study aims to use Twitter data about OK cuisine reviews obtained from the Amazon website and compare the effectiveness

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

The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic

The continuous increases in the size of current telecommunication infrastructures have led to the many challenges that existing algorithms face in underlying optimization. The unrealistic assumptions and low efficiency of the traditional algorithms make them unable to solve large real-life problems at reasonable times.
The use of approximate optimization techniques, such as adaptive metaheuristic algorithms, has become more prevalent in a diverse research area. In this paper, we proposed the use of a self-adaptive differential evolution (jDE) algorithm to solve the radio network planning (RNP) problem in the context of the upcoming generation 5G. The experimental results prove the jDE with best vecto

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi

    Image segmentation is a basic image processing technique that is primarily used for finding segments that form the entire image. These segments can be then utilized in discriminative feature extraction, image retrieval, and pattern recognition. Clustering and region growing techniques are the commonly used image segmentation methods. K-Means is a heavily used clustering technique due to its simplicity and low computational cost. However, K-Means results depend on the initial centres’ values which are selected randomly, which leads to inconsistency in the image segmentation results. In addition, the quality of the isolated regions depends on the homogeneity of the resulted segments. In this paper, an improved K-Means