1 August 2010 in Data & Knowledge Engineering
3 January 2021 in Cognitive Computation
15 November 2021 in IEEE Access
Recently, deep learning models have emerged as promising methods for the diagnosis of different diseases. Cardiac disease is among the leading life-threatening diseases on a global scale. The aim of this paper is to propose an optimized Convolutional Neural Network (CNN) model for the classification of electrocardiogram (ECG) heartbeat data. The proposed ECG classification approach is designed with an optimal CNN configuration to classify cardiac arrhythmias quickly and effectively. Finding an optimal configuration for the CNN hyperparameters is time-consuming and needs extensive experimentation. To overcome this challenge, we present an optimization step for the proposed CNN model using a customized genetic algorithm. It provides an automatic suggestion for the best hyperparameter settings of the proposed CNN. The challenge in utilizing the genetic algorithm is that its operators need to be customized to handle our problem domain. Our approach accepts raw ECG signals without any preprocessing steps, which has benefit in saving the computation time. Our approach also provides a resampling step to ensure generalization, to better handle imbalanced ECG classes. Experiments show promising results of our proposed approach against other approaches whose CNN hyperparameters setting depended on numerous trials, requiring extensive ECG feature extraction steps, and do not consider imbalanced classes. The performance of our proposed approach is better than other existing methods both in terms of higher classification accuracy (98.45%), and lower computational complexity.
29 August 2020 in Journal of King Saud University Computer and Information Sciences
The driving force behind content dissemination in Social network (SN) is the users’ interest in the content, which is strongly reflected in their interactions. Obviously, user interest varies with the disseminated content. Consequently, the dynamic interest results in decomposing SN into dynamic user clusters “interest groups”. The objective of this work is to rank interest-based communities using influence propagation. The contribution of this work is three-fold: First, to highlight the significance of the indirect influence among interest-based user groups. Second, to study its impact on content dissemination capability. Third, to propose an ultimate ranking model (UltRank) that uniquely considers direct and indirect influences which are reflected in a new reachability metric that considers: 1. Distance among interest groups. 2. Percentage of reachable interest groups. 3. Percentage of reachable nodes. UltRank model has been evaluated in comprehensive experiments. First, clustering quality perspective, the Silhouette coefficient for the identified interest groups is on average 0.996 and the Jaccard coefficient of 97% of different interest groups members equals 0. Second, ranking capability perspective, UltRank model can rank up to 91% of interest groups in SN. Finally, ranking effectiveness perspective, UltRank ranking list has a competing network coverage results against the other benchmark approaches.
1 January 2009 in International Journal of Bioinformatics Research and Applications
The increase of the amount of DNA sequences requires efficient computational algorithms for performing sequence comparison and analysis. Standard compression algorithms are not able to compress DNA sequences because they do not consider special characteristics of DNA sequences (i.e., DNA sequences contain several approximate repeats and complimentary palindromes). Recently, new algorithms have been proposed to compress DNA sequences, often using detection of long approximate repeats. The current work proposes a Lossless Compression Algorithm (LCA), providing a new encoding method. LCA achieves a better compression ratio than that of existing DNA-oriented compression algorithms, when compared to GenCompress, DNACompress, and DNAPack.