Essam Said Hanandeh
@zu.edu.jo
Faculty of Information Technology - Computer Science
Zarqa University
RESEARCH INTERESTS
Database,Information Retrieval,Data Mining
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
Laith Abualigah, Saba Hussein Ahmed, Mohammad H. Almomani, Raed Abu Zitar, Anas Ratib Alsoud, Belal Abuhaija, Essam Said Hanandeh, Heming Jia, Diaa Salama Abd Elminaam, and Mohamed Abd Elaziz
Springer Science and Business Media LLC
Laith Abualigah, Essam Said Hanandeh, Raed Abu Zitar, Cuong-Le Thanh, Samir Khatir, and Amir H. Gandomi
Elsevier BV
Laith Abualigah, Mahmoud Habash, Essam Said Hanandeh, Ahmad MohdAziz Hussein, Mohammad Al Shinwan, Raed Abu Zitar, and Heming Jia
Springer Science and Business Media LLC
Ali Raza, Mohammad Rustom Al Nasar, Essam Said Hanandeh, Raed Abu Zitar, Ahmad Yacoub Nasereddin, and Laith Abualigah
MDPI AG
Kinematic motion detection aims to determine a person’s actions based on activity data. Human kinematic motion detection has many valuable applications in health care, such as health monitoring, preventing obesity, virtual reality, daily life monitoring, assisting workers during industry manufacturing, caring for the elderly. Computer vision-based activity recognition is challenging due to problems such as partial occlusion, background clutter, appearance, lighting, viewpoint, and changes in scale. Our research aims to detect human kinematic motions such as walking or running using smartphones’ sensor data within a high-performance framework. An existing dataset based on smartphones’ gyroscope and accelerometer sensor values is utilized for the experiments in our study. Sensor exploratory data analysis was conducted in order to identify valuable patterns and insights from sensor values. The six hyperparameters, tunned artificial indigence-based machine learning, and deep learning techniques were applied for comparison. Extensive experimentation showed that the ensemble learning-based novel ERD (ensemble random forest decision tree) method outperformed other state-of-the-art studies with high-performance accuracy scores. The proposed ERD method combines the random forest and decision tree models, which achieved a 99% classification accuracy score. The proposed method was successfully validated with the k-fold cross-validation approach.
Essam Hanandeh and Mohamed Shajahan
Springer Nature Switzerland
Aref abu Awad, Essam Hanandeh, and Halah Nasseif
Springer Nature Switzerland
Laith Abualigah, Sayel Abualigah, Mothanna Almahmoud, Agostino Forestiero, Gagan Sachdeva, and Essam S. Hanandeh
Springer Nature Switzerland
Yazan Alaya AL-Khassawneh, Essam Said Hanandeh, and Sattam Almatarneh
Springer Nature Singapore
Yazan Alaya AL-Khassawneh and Essam Said Hanandeh
MDPI AG
With the noteworthy expansion of textual data sources in recent years, easy, quick, and precise text processing has become a challenge for key qualifiers. Automatic text summarization is the process of squeezing text documents into shorter summaries to facilitate verification of their basic contents, which must be completed without losing vital information and features. The most difficult information retrieval task is text summarization, particularly for Arabic. In this research, we offer an automatic, general, and extractive Arabic single document summarizing approach with the goal of delivering a sufficiently informative summary. The proposed model is based on a textual graph to generate a coherent summary. Firstly, the original text is converted to a textual graph using a novel formulation that takes into account sentence relevance, coverage, and diversity to evaluate each sentence using a mix of statistical and semantic criteria. Next, a sub-graph is built to reduce the size of the original text. Finally, unwanted and less weighted phrases are removed from the summarized sentences to generate a final summary. We used Recall-Oriented Research to Evaluate Main Idea (RED) as an evaluative metric to review our proposed technique and compare it with the most advanced methods. Finally, a trial on the Essex Arabic Summary Corpus (EASC) using the ROUGE index showed promising results compared with the currently available methods.
Ali Khazalah, Boppana Prasanthi, Dheniesh Thomas, Nishathinee Vello, Suhanya Jayaprakasam, Putra Sumari, Laith Abualigah, Absalom E. Ezugwu, Essam Said Hanandeh, and Nima Khodadadi
Springer International Publishing
Essam S. Hanandeh, Aref Abu Awwad, and Yazan Khassawneh
IEEE
The researchers of this study chose 242 Arabic abstract doucments. Computer science and information systems are mentioned in all of these abstracts. The researchers created an Arabic-specific autonomous information retrieval system, the system was written in the C# NET programming language and its compatible with IBM/PCs and other microcomputers. For this corpus, The researchers used an automatic indexing strategy. The system was created using the Vector Space Model (VSM). In this model, the researcher take all measurements and utilize the Cosine, Dice, Jaccard, and Inner Product Similarity measures. Using the Vector Space Model, the researchers compared the retrieval results. In Arabic documents, the researchers discovered that the retrieval result for cosine is better than the retrieval result for other measures.
Laith Mohammad Abualigah, Essam Said Hanandeh, Ahamad Tajudin Khader, Mohammed Abdallh Otair, and Shishir Kumar Shandilya
Bentham Science Publishers Ltd.
Background: Considering the increasing volume of text document information on Internet pages, dealing with such a tremendous amount of knowledge becomes totally complex due to its large size. Text clustering is a common optimization problem used to manage a large amount of text information into a subset of comparable and coherent clusters. Aims: This paper presents a novel local clustering technique, namely, β-hill climbing, to solve the problem of the text document clustering through modeling the β-hill climbing technique for partitioning the similar documents into the same cluster. Methods: The β parameter is the primary innovation in β-hill climbing technique. It has been introduced in order to perform a balance between local and global search. Local search methods are successfully applied to solve the problem of the text document clustering such as; k-medoid and kmean techniques. Results: Experiments were conducted on eight benchmark standard text datasets with different characteristics taken from the Laboratory of Computational Intelligence (LABIC). The results proved that the proposed β-hill climbing achieved better results in comparison with the original hill climbing technique in solving the text clustering problem. Conclusion: The performance of the text clustering is useful by adding the β operator to the hill climbing.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, and Essam Said Hanandeh
Springer International Publishing
For the purpose of improving the search strategy of the krill herd algorithm (KHA) , an improved robust approach is proposed to address the function optimization problems, namely, modified krill herd algorithm (MKHA) . In MKHA method, the modification of krill herd algorithm focuses on genetic operators (GOs) and it occurs in the ordering of procedures of the basic krill herd algorithm, where the crossover and mutation operators are employed after the updating process of the krill individuals position, the krill herd (KH) motion calculations, is finished. This modification is conducted because the genetic operators insignificantly exploit to enhance the global exploration search in the basic krill herd algorithm so as to speed up convergence. Several versions of benchmark functions are applied to verify the proposed method (MKHA) and it is showed that, in most cases, the proposed algorithm (MKHA) obtained better results in comparison with the basic KHA and other comparative methods.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, and Essam Said Hanandeh
Springer Science and Business Media LLC
In this paper, a novel text clustering method, improved krill herd algorithm with a hybrid function, called MMKHA, is proposed as an efficient clustering way to obtain promising and precise results in this domain. Krill herd is a new swarm-based optimization algorithm that imitates the behavior of a group of live krill. The potential of this algorithm is high because it performs better than other optimization methods; it balances the process of exploration and exploitation by complementing the strength of local nearby searching and global wide-range searching. Text clustering is the process of grouping significant amounts of text documents into coherent clusters in which documents in the same cluster are relevant. For the purpose of the experiments, six versions are thoroughly investigated to determine the best version for solving the text clustering. Eight benchmark text datasets are used for the evaluation process available at the Laboratory of Computational Intelligence (LABIC). Seven evaluation measures are utilized to validate the proposed algorithms, namely, ASDC, accuracy, precision, recall, F-measure, purity, and entropy. The proposed algorithms are compared with the other successful algorithms published in the literature. The results proved that the proposed improved krill herd algorithm with hybrid function achieved almost all the best results for all datasets in comparison with the other comparative algorithms.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, and Essam Said Hanandeh
Elsevier BV
Abstract Krill herd (KH) algorithm is a novel swarm-based optimization algorithm that imitates krill herding behavior during the searching for foods. It has been successfully used in solving many complex optimization problems. The potency of this algorithm is very high because of its superior performance compared with other optimization algorithms. Hence, the applicability of this algorithm for text document clustering is investigated in this work. Text document clustering refers to the method of clustering an enormous amount of text documents into coherent and dense clusters, where documents in the same cluster are similar. In this paper, a combination of objective functions and hybrid KH algorithm, called, MHKHA, is proposed to solve the text document clustering problem. In this version, the initial solutions of the KH algorithm are inherited from the k-mean clustering algorithm and the clustering decision is based on two combined objective functions. Nine text standard datasets collected from the Laboratory of Computational Intelligence are used to evaluate the performance of the proposed algorithms. Five evaluation measures are employed, namely, accuracy, precision, recall, F-measure, and convergence behavior. The proposed versions of the KH algorithm are compared with other well-known clustering algorithms and other thirteen published algorithms in the literature. The MHKHA obtained the best results for all evaluation measures and datasets used among all the clustering algorithms tested.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, and Essam Said Hanandeh
Elsevier BV
Abstract The large amount of text information on the Internet and in modern applications makes dealing with this volume of information complicated. The text clustering technique is an appropriate tool to deal with an enormous amount of text documents by grouping these documents into coherent groups. The document size decreases the effectiveness of the text clustering technique. Subsequently, text documents contain sparse and uninformative features (i.e., noisy, irrelevant, and unnecessary features), which affect the effectiveness of the text clustering technique. The feature selection technique is a primary unsupervised learning method employed to select the informative text features to create a new subset of a document's features. This method is used to increase the effectiveness of the underlying clustering algorithm. Recently, several complex optimization problems have been successfully solved using metaheuristic algorithms. This paper proposes a novel feature selection method, namely, feature selection method using the particle swarm optimization (PSO) algorithm (FSPSOTC) to solve the feature selection problem by creating a new subset of informative text features. This new subset of features can improve the performance of the text clustering technique and reduce the computational time. Experiments were conducted using six standard text datasets with several characteristics. These datasets are commonly used in the domain of the text clustering. The results revealed that the proposed method (FSPSOTC) enhanced the effectiveness of the text clustering technique by dealing with a new subset of informative features. The proposed method is compared with the other well-known algorithms i.e., feature selection method using a genetic algorithm to improve the text clustering (FSGATC), and feature selection method using the harmony search algorithm to improve the text clustering (FSHSTC) in the text feature selection.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, and Essam Said Hanandeh
Springer International Publishing
Text clustering is an efficient analysis technique used in the domain of the text mining to arrange a huge of unorganized text documents into a subset of coherent clusters. Where, the similar documents in the same cluster. In this paper, we proposed a novel term weighting scheme, namely, length feature weight (LFW), to improve the text document clustering algorithms based on new factors. The proposed scheme assigns a favorable term weight according to the obtained information from the documents collection. It recognizes the terms which are particular to each cluster and enhances their weights based on the proposed factors at the level of the document. β-hill climbing technique is used to validate the proposed scheme in the text clustering. The proposed weight scheme is compared with the existing weight scheme (TF-IDF) to validate its results in that domain. Experiments are conducted on eight standard benchmark text datasets taken from the Laboratory of Computational Intelligence (LABIC). The results proved that the proposed weighting scheme LFW overcomes the existing weighting scheme and enhances the result of text document clustering technique in terms of the F-measure, precision, and recall.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, and Essam Said Hanandeh
IOS Press
Laith Mohammad Abualigah, Ahamad Tajudin Khader, Essam Said Hanandeh, and Amir H. Gandomi
Elsevier BV
Abstract Krill herd (KH) is a stochastic nature-inspired optimization algorithm that has been successfully used to solve numerous complex optimization problems. This paper proposed a novel hybrid of KH algorithm with harmony search (HS) algorithm, namely, H-KHA, to improve the global (diversification) search ability. The enhancement includes adding global search operator (improvise a new solution) of the HS algorithm to the KH algorithm for improving the exploration search ability by a new probability factor, namely, Distance factor, thereby moving krill individuals toward the best global solution. The effectiveness of the proposed H-KHA is tested on seven standard datasets from the UCI Machine Learning Repository that are commonly used in the domain of data clustering, also six common text datasets that are used in the domain of text document clustering. The experiments reveal that the proposed hybrid KHA with HS algorithm (H-KHA) enhanced the results in terms of accurate clusters and high convergence rate. Mostly, the performance of H-KHA is superior or at least highly competitive with the original KH algorithm, well-known clustering techniques and other comparative optimization algorithms.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar, Zaid Abdi Alkareem Alyasseri, Osama Ahmad Alomari, and Essam Said Hanandeh
IEEE
In the bases of increasing the volume of text information, the dealing with text information has become incredibly complicated. The text clustering is a suitable technique used in dealing with a tremendous amount of text documents by classifying these set of text documents into clusters. Ultimately, text documents hold sparse, non-uniform distribution and uninformative features are difficult to cluster. The text feature selection is a primary unsupervised learning method that is utilized to choose a new subset of informational text features. In this paper, a new algorithm is proposed based on β-hill climbing technique for text feature selection problem to improve the text clustering (B-FSTC). The results of the proposed method for β-hill climbing and original Hill climbing (i.e., H-FSTC) are examined using the k-mean text clustering and compared with each other. Experiments were conducted on four standard text datasets with varying characteristics. Interestingly, the proposed β-hill climbing algorithm obtains superior results in comparison with the other well-regard techniques by producing a new subset of informational text features. Lastly, the β-hill climbing-based feature selection method supports the k-mean clustering algorithm to achieve more precise clusters.
Laith Mohammad Abualigah, Ahamad Tajudin Khader, Mohammed Azmi AlBetar, and Essam Said Hanandeh
EAI
After incensing the amount of text information on internet web pages, the dealing with this information is very complex due to the volume of information. Text clustering technique is an appropriate task to deal with a huge amount of text documents by grouping set of documents into groups. Text documents contain uninformative features, which decrease the performance of the text clustering technique. Feature selection is an unsupervised technique used to select informative features by creating a new subset of informative features. This technique used to improve the performance of the underlying algorithm. Latterly, several complex optimization problems are success solved by metaheuristic al-gorithms. In this paper, we proposed the Particle swarm optimization algorithm to solve the feature selection problem, namely, (FSPSOTC). The feature selection technique encourages the k-mean text clustering technique to obtain more accurate clusters. Experiments were conducted using four standard benchmark text datasets with different characteris-tics. Experimental results showed that the proposed method (FSPSOTC) is enhanced the performance of the text clustering technique by dealing with a new subset of informative features.
Atef Ahmed Obeidat, Majd Mahmoud Al-Kofahi, Mohammad Jazi Bawaneh, and Essam Said Hanandeh
Science Publications
Botnets remain an active security problem on the Internet and various computer networks. They are continuously developing with regard to protocols, structure and quality of attacks. Many botnet detection programs are currently available, but only few can detect bots in real-time. The sooner bots are detected the lesser damage they can cause. In this paper, a novel botnet detection system, is proposed to detect peer-to-peer bots. The system consists of three-phases filtering, P2P detection and P2P botnet detection phases. For the third phase, P2P network behavior analysis is performed to detect P2P bots. Experimental results showed that the system exhibits high average true positive rate and extremely low average false positive rate during botnet detection.
Khaled Maabreh and Essam Hanandeh
Inderscience Publishers
One of the important facilities offered by the internet is the e-learning, which represents a major change in the educational environment. It is considered as a source of services for educational organisations and users. For enhancing the effectiveness of e-learning, it is necessary to make major changes in the educational operational aspects along with constructing potential technology. The aims of this paper are to examine the user's satisfaction of the e-learning services, and to measure the degree of confidence in the services provided by the organisation.