Aboul Ella Hassanien (Abo)

In this paper the possibility of using the human heart sounds as a human print is investigated. To evaluate the performance and the uniqueness of the proposed approach, tests using a high resolution auscultation digital stethoscope are done for nearly 80 heart sound samples. The verification approach consists of a robust feature extraction with a specified configuration in conjunction with Gaussian mixture modeling. The similarity of two samples is estimated by measuring the difference between their log-likelihood similarities of the features. The experimental results obtained show that the overall accuracy offered by the employed Gaussian mixture modeling reach up to 85%. The identification approach consists of a robust feature extraction with a specified configuration in conjunction with LBG-VQ. The experimental results obtained show that the overall accuracy offered by the employed LBG-VQ reach up to 88.7%

Social tagging is one of the important characteristics of WEB2.0. The challenge of Web 2.0 is a huge amount of data generated over a short period. Tags are widely used to interpret and classify the web 2.0 resources. Tag clustering is the process of grouping the similar tags into clusters. The tag clustering is very useful for searching and organizing the web2.0 resources and also important for the success of Social Bookmarking systems. In this paper, the authors proposed a hybrid Tolerance Rough Set Based Particle Swarm optimization (TRS-PSO) clustering algorithm for clustering tags in social systems. Then the proposed method is compared to the benchmark algorithm K-Means clustering and Particle Swarm optimization (PSO) based Clustering technique. The experimental analysis illustrates the effectiveness of the proposed approach.

In today’s medical world, the patient’s data with symptoms and diseases are expanding rapidly, so that analysis of all factors with updated knowledge about symptoms and corresponding new treatment is merely not possible by medical experts. Hence, the essential for an intelligent system to reflect the different issues and recognize an appropriate model between the different parameters is evident. In recent decades, rough set theory (RST) has been broadly applied in various fields such as medicine, business, education, engineering and multimedia. In this study, a hybrid intelligent system that combines rough set (RST) and bijective soft set theory (BISO) to build a robust classifier model is proposed. The aim of the hybrid system is to exploit the advantages of the constituent components while eliminating their limitations. The resulting approach is thus able to handle data inconsistency in datasets through rough sets, while obtaining high classification accuracy based on prediction using bijective soft sets. Toward estimating the performance of the hybrid rough-bijective soft set (RBISO)-based classification approach, six benchmark medical datasets (Wisconsin breast cancer, liver disorder, hepatitis, Pima Indian diabetes, echocardiogram data and thyroid gland) from the UCI repository of machine learning databases are utilized. Experimental results, based on evaluation in terms of sensitivity, specificity and accuracy, are compared with other well-known classification methods, and the proposed algorithm provides an effective method for medical data classification.

In today’s medical world, the patient’s data with symptoms and diseases are expanding rapidly, so that analysis of all factors with updated knowledge about symptoms and corresponding new treatment is merely not possible by medical experts. Hence, the essential for an intelligent system to reflect the different issues and recognize an appropriate model between the different parameters is evident. In recent decades, rough set theory (RST) has been broadly applied in various fields such as medicine, business, education, engineering and multimedia. In this study, a hybrid intelligent system that combines rough set (RST) and bijective soft set theory (BISO) to build a robust classifier model is proposed. The aim of the hybrid system is to exploit the advantages of the constituent components while eliminating their limitations. The resulting approach is thus able to handle data inconsistency in datasets through rough sets, while obtaining high classification accuracy based on prediction using bijective soft sets. Toward estimating the performance of the hybrid rough-bijective soft set (RBISO)-based classification approach, six benchmark medical datasets (Wisconsin breast cancer, liver disorder, hepatitis, Pima Indian diabetes, echocardiogram data and thyroid gland) from the UCI repository of machine learning databases are utilized. Experimental results, based on evaluation in terms of sensitivity, specificity and accuracy, are compared with other well-known classification methods, and the proposed algorithm provides an effective method for medical data classification.

Crow search algorithm (CSA) is a new natural inspired algorithm proposed by Askarzadeh in 2016. The main inspiration of CSA came from crow search mechanism for hiding their food. Like most of the optimization algorithms, CSA suffers from low convergence rate and entrapment in local optima. In this paper, a novel meta-heuristic optimizer, namely chaotic crow search algorithm (CCSA), is proposed to overcome these problems. The proposed CCSA is applied to optimize feature selection problem for 20 benchmark datasets. Ten chaotic maps are employed during the optimization process of CSA. The performance of CCSA is compared with other well-known and recent optimization algorithms. Experimental results reveal the capability of CCSA to find an optimal feature subset which maximizes the classification performance and minimizes the number of selected features. Moreover, the results show that CCSA is superior compared to CSA and the other algorithms. In addition, the experiments show that sine chaotic map is the appropriate map to significantly boost the performance of CSA.

This paper presents an automatic mitosis detection approach of histopathology slide imaging based on using neutrosophic sets (NS) and moth-flame optimization (MFO). The proposed approach consists of two main phases, namely candidate’s extraction and candidate’s classification phase. At candidate’s extraction phase, Gaussian filter was applied to the histopathological slide image and the enhanced image was mapped into the NS domain. Then, morphological operations have been implemented to the truth subset image for more enhancements and focus on mitosis cells. At candidate’s classification phase, several features based on statistical, shape, texture and energy features were extracted from each candidate. Then, a principle of the meta-heuristic MFO algorithm was adopted to select the best discriminating features of mitosis cells. Finally, the selected features were used to feed the classification and regression tree (CART). A benchmark dataset consists of 50 histopathological images was adopted to evaluate the performance of the proposed approach. The adopted dataset consists of five distinct breast pathology slides. These slides were stained with H&E acquired by Aperio XT scanners with 40-x magnification. The total number of mitoses in 50 database images is 300, which were annotated by an expert pathologist. Experimental results reveal the capability of the MFO feature selection algorithm for finding the optimal feature subset which maximizing the classification performance compared to well-known and other meta-heuristic feature selection algorithms. Also, the high obtained value of accuracy, recall, precision and f-score for the adopted dataset prove the robustness of the proposed mitosis detection and classification approach. It achieved overall 65.42 % f-score, 66.03 % recall, 65.73 % precision and accuracy 92.99 %. The experimental results show that the proposed approach is fast, robust, efficient and coherent. Moreover, it could be used for further early diagnostic suspicion of breast cancer.

This paper presents an approach based on Artificial Bee Colony (ABC) to optimize the parameters of membership functions of Sugeno based Adaptive Neuro-Fuzzy Inference System (ANFIS). The optimization is achieved by Artificial Bee Colony (ABC) for the sake of achieving minimum Root Mean Square Error of ANFIS structure. The proposed ANFIS-ABC model is used to build a system for predicting the wind speed. To ensure the accuracy of the model, a different number of membership functions has been used. The experimental results indicates that the best accuracy achieved is 98% with ten membership functions and least value of RMSE which is 0.39.

Sequence alignment is a vital process in many biological applications such as Phylogenetic trees construction, DNA fragment assembly and structure/function prediction. Two kinds of alignment are pairwise alignment which align two sequences and Multiple Sequence alignment (MSA) that align sequences more than two. The accurate method of alignment is based on Dynamic Programming (DP) approach which suffering from increasing time exponentially with increasing the length and the number of the aligned sequences. Stochastic or meta-heuristics techniques speed up alignment algorithm but with near optimal alignment accuracy not as that of DP. Hence, This chapter aims to review the recent development of MSA using meta-heuristics algorithms. In addition, two recent techniques are focused in more deep: the first is Fragmented protein sequence alignment using two-layer particle swarm optimization (FTLPSO). The second is Multiple sequence alignment using multi-objective based bacterial foraging optimization algorithm (MO-BFO).

Pairwise global sequence alignment is a vital process for finding functional and evolutionary similarity between biological sequences. The main usage of it is searching biological databases for finding the origin of unknown sequence. The standard global alignment based on dynamic programming approach which produces the accurate alignment but with extensive execution time. In this paper, Sine-Cosine optimization algorithm was used for accelerating pairwise global alignment with alignment score near one produced by dynamic programming alignment. The reason for using Sine-Cosine optimization is its excellent exploration of the search space. The developed technique was tested on human and mouse protein sequences and its success for finding alignment similarity 75% of that produced by standard technique.

The sine cosine algorithm (SCA), a recently proposed population-based optimization algorithm, is based on the use of sine and cosine trigonometric functions as operators to update the movements of the search agents. To optimize performance, different parameters on the SCA must be appropriately tuned. Setting such parameters is challenging because they permit the algorithm to escape from local optima and avoid premature convergence. The main drawback of the SCA is that the parameter setting only affects the exploitation of the prominent regions. However, the SCA has good exploration capabilities. This article presents an enhanced version of the SCA by merging it with particle swarm optimization (PSO). PSO exploits the search space better than the operators of the standard SCA. The proposed algorithm, called ASCA-PSO, has been tested over several unimodal and multimodal benchmark functions, which show its superiority over the SCA and other recent and standard meta-heuristic algorithms. Moreover, to verify the capabilities of the SCA, the SCA has been used to solve the real-world problem of a pairwise local alignment algorithm that tends to find the longest consecutive substrings between two biological sequences. Experimental results provide evidence of the good performance of the ASCA-PSO solutions in terms of accuracy and computational time.