Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : International Journal of Electrical and Computer Engineering

Node classification with graph neural network based centrality measures and feature selection Asmaa M. Mahmoud; Abeer S. Desuky; Heba F. Eid; Hoda A. Ali
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 2: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i2.pp2114-2122

Abstract

Graph neural networks (GNNs) are a new topic of research in data science where data structure graphs are used as important components for developing and training neural networks. GNN always learns the weight importance of the neighbor for perform message aggregation in which the feature vectors of all neighbors are aggregated without considering whether the features are useful or not. Using such more informative features positively affect the performance of the GNN model. So, in this paper i) after selecting a subset of features to define important node features, we present new graph features’ explanation methods based on graph centrality measures to capture rich information and determine the most important node in a network. Through our experiments, we find that selecting certain subsets of these features and adding other features based on centrality measure can lead to better performance across a variety of datasets and ii) we introduce a major design strategy for graph neural networks. Specifically, we suggest using batch renormalization as normalization over GNN layers. Combining these techniques, representing features based on centrality measures that passed to multilayer perceptron (MLP) layer which is then passed to adjusted GNN layer, the proposed model achieves greater accuracy than modern GNN models.
Rhizostoma optimization algorithm and its application in different real-world optimization problems Esraa A. Mahareek; Mehmet Akif Cifci; Habiba A. El-Zohni; Abeer S. Desuky
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 4: August 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i4.pp4317-4338

Abstract

In last decade, numerous meta-heuristic algorithms have been proposed for dealing the complexity and difficulty of numerical optimization problems in the realworld which is growing continuously recently, but only a few algorithms have caught researchers’ attention. In this study, a new swarm-based meta-heuristic algorithm called Rhizostoma optimization algorithm (ROA) is proposed for solving the optimization problems based on simulating the social movement of Rhizostoma octopus (barrel jellyfish) in the ocean. ROA is intended to mitigate the two optimization problems of trapping in local optima and slow convergence. ROA is proposed with three different movement strategies (simulated annealing (SA), fast simulated annealing (FSA), and Levy walk (LW)) and tested with 23 standard mathematical benchmark functions, two classical engineering problems, and various real-world datasets including three widely used datasets to predict the students’ performance. Comparing the ROA algorithm with the latest meta-heuristic optimization algorithms and a recent published research proves that ROA is a very competitive algorithm with a high ability in optimization performance with respect to local optima avoidance, the speed of convergence and the exploration/exploitation balance rate, as it is effectively applicable for performing optimization tasks.