Publications

Export 66 results:
Sort by: Author [ Title  (Desc)] Type Year
A B C D E F G H I J K L M N O [P] Q R S T U V W X Y Z   [Show ALL]
P
Hassanien, A. E., Pervasive Computing, : Springer Science & Business Media, 2009. Abstract
n/a
Elmasry, W. H., H. M. Moftah, N. El-Bendary, and A. E. Hassanien, "Performance evaluation of computed tomography liver image segmentation approaches", Hybrid Intelligent Systems (HIS), 2012 12th International Conference on: IEEE, pp. 109–114, 2012. Abstract
n/a
Ali, J. M. H., and A. E. Hassanien, "PCNN for detection of masses in digital mammogram", Neural Network World, vol. 16, no. 2: Institute of Computer Science, pp. 129, 2006. Abstract
n/a
Ali, J. M. H., and A. E. Hassanien, "PCNN for detection of masses in digital mammogram", Neural Network World, vol. 16, no. 2: Institute of Computer Science, pp. 129, 2006. Abstract
n/a
El-Bendary, N., H. M. Zawbaa, A. E. Hassanien, and V. Snasel, "PCA-based home videos annotation system", International Journal of Reasoning-based Intelligent Systems, vol. 3, no. 2: Inderscience Publishers, pp. 71–79, 2011. Abstract
n/a
El-Bendary, N., H. M. Zawbaa, A. E. Hassanien, and V. Snasel, "PCA-based home videos annotation system", International Journal of Reasoning-based Intelligent Systems, vol. 3, no. 2: Inderscience Publishers, pp. 71–79, 2011. Abstract
n/a
Salama, M. A., A. E. Hassanien, and A. A. Fahmy, "Pattern-based subspace classification model", Nature and Biologically Inspired Computing (NaBIC), 2010 Second World Congress on: IEEE, pp. 357–362, 2010. Abstract
n/a
Salama, M. A., A. E. Hassanien, and A. A. Fahmy, "Pattern-based subspace classification model", Nature and Biologically Inspired Computing (NaBIC), 2010 Second World Congress on: IEEE, pp. 357–362, 2010. Abstract
n/a
Salama, M., A. E. Hassanien, and A. A. Fahmy, "Pattern-based Subspace Classification Approach", The Second IEEE World Congress on Nature and Biologically Inspired Computing (NaBIC2010), Kitakyushu- Japan, 15 Dec, 2010. Abstract

The use of patterns in predictive models has received a lot of attention in recent years. This paper presents a pattern-based classification model which extracts the patterns that have similarity among all objects in a specific class. This introduced model handles the problem of the dependence on a user-defined threshold that appears in the pattern-based subspace clustering. The experimental results obtained, show that the overall pattern-based classification accuracy is high compared with other machine learning techniques including Support vector machine, Bayesian Network, multi-layer perception and decision trees.

Toews, M., and T. Arbel, "Parts-Based Appearance Modeling of Medical Imagery", Computational Intelligence in Medical Imaging: Techniques and Applications: CRC Press, pp. 291, 2009. Abstract
n/a
Elghamrawy, S., and Aboul Ella Hassa, "A Partitioning Framework for Cassandra NoSQL Database using Rendezvous Hashing", Journal of Supercomputing (SUPE), Springer , vol. pp 1–22, 2017. AbstractWebsite

Due to the gradual expansion in data volume used in social networks and cloud computing, the term “Big data” has appeared with its challenges to store the immense datasets. Many tools and algorithms appeared to handle the challenges of storing big data. NoSQL databases, such as Cassandra and MongoDB, are designed with a novel data management system that can handle and process huge volumes of data. Partitioning data in NoSQL databases is considered one of the critical challenges in database design. In this paper, a MapReduce Rendezvous Hashing-Based Virtual Hierarchies (MR-RHVH) framework is proposed for scalable partitioning of Cassandra NoSQL database. The MapReduce framework is used to implement MR-RHVH on Cassandra to enhance its performance in highly distributed environments. MR-RHVH distributes the nodes to rendezvous regions based on a proposed Adopted Virtual Hierarchies strategy. Each region is responsible for a set of nodes. In addition, a proposed bloom filter evaluator is used to ensure the accurate allocation of keys to nodes in each region. Moreover, a number of experiments were performed to evaluate the performance of MR-RHVH framework, using YCSB for database benchmarking. The results show high scalability rate and less time consuming for MR-RHVH framework over different recent systems.

Tharwt, A., and A. E. Hassanien, "Particle Swarm Optimization: A Tutorial", Handbook of Research on Machine Learning Innovations and Trends, USA, IGI, 2017. Abstract

Optimization algorithms are necessary to solve many problems such as parameter tuning. Particle Swarm Optimization (PSO) is one of these optimization algorithms. The aim of PSO is to search for the optimal solution in the search space. This paper highlights the basic background needed to understand and implement the PSO algorithm. This paper starts with basic definitions of the PSO algorithm and how the particles are moved in the search space to find the optimal or near optimal solution. Moreover, a numerical example is illustrated to show how the particles are moved in a convex optimization problem. Another numerical example is illustrated to show how the PSO trapped in a local minima problem. Two experiments are conducted to show how the PSO searches for the optimal parameters in one-dimensional and two-dimensional spaces to solve machine learning problems.

Alaa Tharwat, T. Gaber, A. E. Hassanien, and B. E. Elnaghi, "Particle Swarm Optimization: A Tutorial", Handbook of Research on Machine Learning Innovations and Trends: IGI Global, pp. 614–635, 2017. Abstract
n/a
Sahlol, A., M. A. Fattah, C. Y. Suen, and A. E. Hassanien, "Particle Swarm Optimization with Random Forests for Handwritten Arabic Recognition System", International Conference on Advanced Intelligent Systems and Informatics: Springer International Publishing, pp. 437–446, 2016. Abstract
n/a
Abder-Rahman Ali, Micael Couceiro, A. Anter, and A. - E. Hassanien, "Particle swarm optimization based fast fuzzy C-means clustering for liver CT segmentation", Applications of Intelligent Optimization in Biology and Medicine: Springer International Publishing, pp. 233–250, 2016. Abstract
n/a
Issa, M., and A. E. Hassanien, "Pairwise Global Sequence Alignment Using Sine-Cosine Optimization Algorithm", AMLTA 2018: The International Conference on Advanced Machine Learning Technologies and Applications (AMLTA2018), Cairo, 23 Feb, 2018. Abstract

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.

Tourism