Ali Ahmadi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ali Ahmadi has a total of 102 co-authors. Here are the top co-authors by number of shared publications:
Toshihisa Kosaka
6 shared publicationsS. Omatu
Osaka Prefecture University
5 shared publicationsT. Kosaka
5 shared publicationsTetsushi Koide
Research Center for Nanodevices and Systems, Hiroshima University, Japan
5 shared publications- Alireza Behrad
Faculty of Engineering, Shahed University, Tehran, Iran
4 shared publications Sigeru Omatu
4 shared publications
Latest Publications
- Top Cited PapersOpen Access
- 31 January 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (2) , 72
Aris-RPL: A Multi-Objective Reinforcement Learning Framework for Adaptive and Load-Balanced Routing in IoT Networks
The fast-paced utilization of innovative Internet of Things (IoT) applications emphasizes the critical role that routing protocols play in designing an efficient communication system between network nodes. In this context, the lack of adaptive routing mechanisms in the standard Routing Protocol for Low-power and Lossy Networks (RPL), such as load balancing and congestion mechanisms, especially under heavy load scenarios, causes significant degradation of network performance. In this regard, integrating innovative and effective learning abilities, such as Reinforcement Learning, into an efficient routing policy has demonstrated promising solutions for future networks. Hence, this paper introduces Aris-RPL, an adaptive routing policy for the RPL protocol. Aris-RPL utilizes a multi-objective Q-learning algorithm to learn optimal paths. Each node translates neighboring node information into a Q-value representing a composite multi-objective metric, including Buffer Utilization, Energy Level, Received Signal Strength Indicator (RSSI), Overflow Ratio, and Child Count. Furthermore, Aris-RPL operates effectively during the exploitation and exploration phases and continuously monitors the network overflow ratio during exploitation to respond to sudden changes and maintain performance. The extensive Contiki OS 3.0/COOJA simulator experiments have verified Aris-RPL efficiency. It enhanced Control Overhead, Packet Delivery Ratio (PDR), End-to-End Delay (E2E Delay), and Energy Consumption results compared to other counterparts for all scenarios on average by 39%, 25%, 7%, and 38%, respectively.
- 31 January 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (2) , 72
Top Cited PapersOpen AccessAris-RPL: A Multi-Objective Reinforcement Learning Framework for Adaptive and Load-Balanced Routing in IoT Networks
The fast-paced utilization of innovative Internet of Things (IoT) applications emphasizes the critical role that routing protocols play in designing an efficient communication system between network nodes. In this context, the lack of adaptive routing mechanisms in the standard Routing Protocol for Low-power and Lossy Networks (RPL), such as load balancing and congestion mechanisms, especially under heavy load scenarios, causes significant degradation of network performance. In this regard, integrating innovative and effective learning abilities, such as Reinforcement Learning, into an efficient routing policy has demonstrated promising solutions for future networks. Hence, this paper introduces Aris-RPL, an adaptive routing policy for the RPL protocol. Aris-RPL utilizes a multi-objective Q-learning algorithm to learn optimal paths. Each node translates neighboring node information into a Q-value representing a composite multi-objective metric, including Buffer Utilization, Energy Level, Received Signal Strength Indicator (RSSI), Overflow Ratio, and Child Count. Furthermore, Aris-RPL operates effectively during the exploitation and exploration phases and continuously monitors the network overflow ratio during exploitation to respond to sudden changes and maintain performance. The extensive Contiki OS 3.0/COOJA simulator experiments have verified Aris-RPL efficiency. It enhanced Control Overhead, Packet Delivery Ratio (PDR), End-to-End Delay (E2E Delay), and Energy Consumption results compared to other counterparts for all scenarios on average by 39%, 25%, 7%, and 38%, respectively.
- 12 May 2023
- Published by Springer Nature in The Visual Computer
- Vol. 40 (3) , 1617-1629
Improving loss function for deep convolutional neural network applied in automatic image annotation
- 12 May 2023
- Published by Springer Nature in The Visual Computer
- Vol. 40 (3) , 1617-1629
Improving loss function for deep convolutional neural network applied in automatic image annotation
- Open Access
- 19 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (1) , 1325-1338
Vaccine Hesitancy Hotspots in Africa: An Insight From Geotagged Twitter Posts
Many social media users express concerns about vaccines and their side effects on Twitter. These concerns lead to a compromise of confidence which brings about vaccine hesitancy. In Africa, vaccine hesitancy is a major challenge faced by health policymakers in the fight against COVID-19. Given that most tweets are geotagged, clustering them according to their sentiments could help identify locations that may likely experience vaccine hesitancy for health policy and planning. In this study, we collected 70000 geotagged vaccine-related tweets in nine African countries, from December 2020 to February 2022. The tweets were classified into three sentiment classes—positive, negative, and neutral. The quality of the classification outputs was achieved using Naíve Bayes (NB), logistic regression (LR), support vector machines (SVMs), decision tree (DT), and K-nearest neighbor (KNN) machine learning classifiers. The LR achieved the highest accuracy of 71% with an average area under the curve of 85%. The point-based location technique was used to calculate the hotspots based on the locations of the classified tweets. Locations with green, red, and gray backgrounds on the map signify a hotspot for positive, negative, and neutral sentiments. The outcome of this research shows that discussions on social media can be analyzed to identify hotspots during a disease outbreak, which could inform health policy in planning and management of vaccine hesitancy in Africa.
- 19 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (1) , 1325-1338
Open AccessVaccine Hesitancy Hotspots in Africa: An Insight From Geotagged Twitter Posts
Many social media users express concerns about vaccines and their side effects on Twitter. These concerns lead to a compromise of confidence which brings about vaccine hesitancy. In Africa, vaccine hesitancy is a major challenge faced by health policymakers in the fight against COVID-19. Given that most tweets are geotagged, clustering them according to their sentiments could help identify locations that may likely experience vaccine hesitancy for health policy and planning. In this study, we collected 70000 geotagged vaccine-related tweets in nine African countries, from December 2020 to February 2022. The tweets were classified into three sentiment classes—positive, negative, and neutral. The quality of the classification outputs was achieved using Naíve Bayes (NB), logistic regression (LR), support vector machines (SVMs), decision tree (DT), and K-nearest neighbor (KNN) machine learning classifiers. The LR achieved the highest accuracy of 71% with an average area under the curve of 85%. The point-based location technique was used to calculate the hotspots based on the locations of the classified tweets. Locations with green, red, and gray backgrounds on the map signify a hotspot for positive, negative, and neutral sentiments. The outcome of this research shows that discussions on social media can be analyzed to identify hotspots during a disease outbreak, which could inform health policy in planning and management of vaccine hesitancy in Africa.
- Open Access
- 14 October 2022
- Published by Springer Nature in BMC Bioinformatics
- Vol. 23 (1) , 1-25
A novel candidate disease gene prioritization method using deep graph convolutional networks and semi-supervised learning
Background: Selecting and prioritizing candidate disease genes is necessary before conducting laboratory studies as identifying disease genes from a large number of candidate genes using laboratory methods, is a very costly and time-consuming task. There are many machine learning-based gene prioritization methods. These methods differ in various aspects including the feature vectors of genes, the used datasets with different structures, and the learning model. Creating a suitable feature vector for genes and an appropriate learning model on a variety of data with different and non-Euclidean structures, including graphs, as well as the lack of negative data are very important challenges of these methods. The use of graph neural networks has recently emerged in machine learning and other related fields, and they have demonstrated superior performance for a broad range of problems. Methods: In this study, a new semi-supervised learning method based on graph convolutional networks is presented using the novel constructing feature vector for each gene. In the proposed method, first, we construct three feature vectors for each gene using terms from the Gene Ontology (GO) database. Then, we train a graph convolution network on these vectors using protein–protein interaction (PPI) network data to identify disease candidate genes. Our model discovers hidden layer representations encoding in both local graph structure as well as features of nodes. This method is characterized by the simultaneous consideration of topological information of the biological network (e.g., PPI) and other sources of evidence. Finally, a validation has been done to demonstrate the efficiency of our method. Results: Several experiments are performed on 16 diseases to evaluate the proposed method's performance. The experiments demonstrate that our proposed method achieves the best results, in terms of precision, the area under the ROC curve (AUCs), and F1-score values, when compared with eight state-of-the-art network and machine learning-based disease gene prioritization methods. Conclusion: This study shows that the proposed semi-supervised learning method appropriately classifies and ranks candidate disease genes using a graph convolutional network and an innovative method to create three feature vectors for genes based on the molecular function, cellular component, and biological process terms from GO data.
- 14 October 2022
- Published by Springer Nature in BMC Bioinformatics
- Vol. 23 (1) , 1-25
Open AccessA novel candidate disease gene prioritization method using deep graph convolutional networks and semi-supervised learning
Background: Selecting and prioritizing candidate disease genes is necessary before conducting laboratory studies as identifying disease genes from a large number of candidate genes using laboratory methods, is a very costly and time-consuming task. There are many machine learning-based gene prioritization methods. These methods differ in various aspects including the feature vectors of genes, the used datasets with different structures, and the learning model. Creating a suitable feature vector for genes and an appropriate learning model on a variety of data with different and non-Euclidean structures, including graphs, as well as the lack of negative data are very important challenges of these methods. The use of graph neural networks has recently emerged in machine learning and other related fields, and they have demonstrated superior performance for a broad range of problems. Methods: In this study, a new semi-supervised learning method based on graph convolutional networks is presented using the novel constructing feature vector for each gene. In the proposed method, first, we construct three feature vectors for each gene using terms from the Gene Ontology (GO) database. Then, we train a graph convolution network on these vectors using protein–protein interaction (PPI) network data to identify disease candidate genes. Our model discovers hidden layer representations encoding in both local graph structure as well as features of nodes. This method is characterized by the simultaneous consideration of topological information of the biological network (e.g., PPI) and other sources of evidence. Finally, a validation has been done to demonstrate the efficiency of our method. Results: Several experiments are performed on 16 diseases to evaluate the proposed method's performance. The experiments demonstrate that our proposed method achieves the best results, in terms of precision, the area under the ROC curve (AUCs), and F1-score values, when compared with eight state-of-the-art network and machine learning-based disease gene prioritization methods. Conclusion: This study shows that the proposed semi-supervised learning method appropriately classifies and ranks candidate disease genes using a graph convolutional network and an innovative method to create three feature vectors for genes based on the molecular function, cellular component, and biological process terms from GO data.
- Open Access
- 1 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Vaccine Hesitancy Hotspots in Africa: An Insight from Geotagged Twitter Posts
In this research, we collected 70,000 COVID–19 vaccine-related geotagged Twitter posts from nine African countries. The duration is from December 2020 to February 2022. We used VADER to classify the tweets into three sentiment classes (positive, negative, and neutral). The outputs were validated using machine learning classification algorithms, including, Naive Bayes, Logistic Regression, Support Vector Machines, Decision Tree, and K-Nearest Neighbour. We identified hotspots by clustering the sentiment of these tweets using the point-based location technique. These hotspots were visualised on the map using ArcGIS Online. On the map, we used green to represent positive sentiment dominance, red to represent negative sentiment dominance, and grey to represent neutral sentiment dominance. The outcome of this research shows that social media data can be used to complement existing data in identifying hotspots during future outbreaks, especially in the areas where there is little or no available data. It can also be used to inform health policy in managing vaccine hesitancy.
- 1 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessVaccine Hesitancy Hotspots in Africa: An Insight from Geotagged Twitter Posts
In this research, we collected 70,000 COVID–19 vaccine-related geotagged Twitter posts from nine African countries. The duration is from December 2020 to February 2022. We used VADER to classify the tweets into three sentiment classes (positive, negative, and neutral). The outputs were validated using machine learning classification algorithms, including, Naive Bayes, Logistic Regression, Support Vector Machines, Decision Tree, and K-Nearest Neighbour. We identified hotspots by clustering the sentiment of these tweets using the point-based location technique. These hotspots were visualised on the map using ArcGIS Online. On the map, we used green to represent positive sentiment dominance, red to represent negative sentiment dominance, and grey to represent neutral sentiment dominance. The outcome of this research shows that social media data can be used to complement existing data in identifying hotspots during future outbreaks, especially in the areas where there is little or no available data. It can also be used to inform health policy in managing vaccine hesitancy.
- 28 July 2022
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 60 (1) , 49-72
Word embedding for mixed-emotions analysis
- 28 July 2022
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 60 (1) , 49-72
Word embedding for mixed-emotions analysis
- Open Access
Twitter-Based Gender Recognition Using Transformers
Social media contains useful information about people and the society that could help advance research in many different areas (e.g. by applying opinion mining, emotion/sentiment analysis, and statistical analysis) such as business and finance, health, socio-economic inequality and gender vulnerability. User demographics provide rich information that could help study the subject further. However, user demographics such as gender are considered private and are not freely available. In this study, we propose a model based on transformers to predict the user's gender from their images and tweets. We fine-tune a model based on Vision Transformers (ViT) to stratify female and male images. Next, we fine-tune another model based on Bidirectional Encoders Representations from Transformers (BERT) to recognize the user's gender by their tweets. This is highly beneficial, because not all users provide an image that indicates their gender. The gender of such users could be detected form their tweets. The combination model improves the accuracy of image and text classification models by 6.98% and 4.43%, respectively. This shows that the image and text classification models are capable of complementing each other by providing additional information to one another. We apply our method to the PAN-2018 dataset, and obtain an accuracy of 85.52%.
Open AccessTwitter-Based Gender Recognition Using Transformers
Social media contains useful information about people and the society that could help advance research in many different areas (e.g. by applying opinion mining, emotion/sentiment analysis, and statistical analysis) such as business and finance, health, socio-economic inequality and gender vulnerability. User demographics provide rich information that could help study the subject further. However, user demographics such as gender are considered private and are not freely available. In this study, we propose a model based on transformers to predict the user's gender from their images and tweets. We fine-tune a model based on Vision Transformers (ViT) to stratify female and male images. Next, we fine-tune another model based on Bidirectional Encoders Representations from Transformers (BERT) to recognize the user's gender by their tweets. This is highly beneficial, because not all users provide an image that indicates their gender. The gender of such users could be detected form their tweets. The combination model improves the accuracy of image and text classification models by 6.98% and 4.43%, respectively. This shows that the image and text classification models are capable of complementing each other by providing additional information to one another. We apply our method to the PAN-2018 dataset, and obtain an accuracy of 85.52%.
- Open Access
- 27 November 2021
- Published by Springer Nature in BMC Medical Informatics and Decision Making
- Vol. 21 (1) , 1-16
A graph-based gene selection method for medical diagnosis problems using a many-objective PSO algorithm
Background: Gene expression data play an important role in bioinformatics applications. Although there may be a large number of features in such data, they mainly tend to contain only a few samples. This can negatively impact the performance of data mining and machine learning algorithms. One of the most effective approaches to alleviate this problem is to use gene selection methods. The aim of gene selection is to reduce the dimensions (features) of gene expression data leading to eliminating irrelevant and redundant genes. Methods: This paper presents a hybrid gene selection method based on graph theory and a many-objective particle swarm optimization (PSO) algorithm. To this end, a filter method is first utilized to reduce the initial space of the genes. Then, the gene space is represented as a graph to apply a graph clustering method to group the genes into several clusters. Moreover, the many-objective PSO algorithm is utilized to search an optimal subset of genes according to several criteria, which include classification error, node centrality, specificity, edge centrality, and the number of selected genes. A repair operator is proposed to cover the whole space of the genes and ensure that at least one gene is selected from each cluster. This leads to an increasement in the diversity of the selected genes. Results: To evaluate the performance of the proposed method, extensive experiments are conducted based on seven datasets and two evaluation measures. In addition, three classifiers—Decision Tree (DT), Support Vector Machine (SVM), and K-Nearest Neighbors (KNN)—are utilized to compare the effectiveness of the proposed gene selection method with other state-of-the-art methods. The results of these experiments demonstrate that our proposed method not only achieves more accurate classification, but also selects fewer genes than other methods. Conclusion: This study shows that the proposed multi-objective PSO algorithm simultaneously removes irrelevant and redundant features using several different criteria. Also, the use of the clustering algorithm and the repair operator has improved the performance of the proposed method by covering the whole space of the problem.
- 27 November 2021
- Published by Springer Nature in BMC Medical Informatics and Decision Making
- Vol. 21 (1) , 1-16
Open AccessA graph-based gene selection method for medical diagnosis problems using a many-objective PSO algorithm
Background: Gene expression data play an important role in bioinformatics applications. Although there may be a large number of features in such data, they mainly tend to contain only a few samples. This can negatively impact the performance of data mining and machine learning algorithms. One of the most effective approaches to alleviate this problem is to use gene selection methods. The aim of gene selection is to reduce the dimensions (features) of gene expression data leading to eliminating irrelevant and redundant genes. Methods: This paper presents a hybrid gene selection method based on graph theory and a many-objective particle swarm optimization (PSO) algorithm. To this end, a filter method is first utilized to reduce the initial space of the genes. Then, the gene space is represented as a graph to apply a graph clustering method to group the genes into several clusters. Moreover, the many-objective PSO algorithm is utilized to search an optimal subset of genes according to several criteria, which include classification error, node centrality, specificity, edge centrality, and the number of selected genes. A repair operator is proposed to cover the whole space of the genes and ensure that at least one gene is selected from each cluster. This leads to an increasement in the diversity of the selected genes. Results: To evaluate the performance of the proposed method, extensive experiments are conducted based on seven datasets and two evaluation measures. In addition, three classifiers—Decision Tree (DT), Support Vector Machine (SVM), and K-Nearest Neighbors (KNN)—are utilized to compare the effectiveness of the proposed gene selection method with other state-of-the-art methods. The results of these experiments demonstrate that our proposed method not only achieves more accurate classification, but also selects fewer genes than other methods. Conclusion: This study shows that the proposed multi-objective PSO algorithm simultaneously removes irrelevant and redundant features using several different criteria. Also, the use of the clustering algorithm and the repair operator has improved the performance of the proposed method by covering the whole space of the problem.
- 3 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Graph Representation Learning In A Contrastive Framework For Community Detection
Graph structured data has become very popular and useful recently. Many areas in science and technology are using graphs for modeling the phenomena they are dealing with (e.g., computer science, computational economics, biology, …). Since the volume of data and its velocity of generation is increasing every day, using machine learning methods for analyzing this data has become necessary. For this purpose, we need to find a representation for our graph structured data that preserves topological information of the graph alongside the feature information of its nodes. Another challenge in incorporating machine learning methods as a graph data analyzer is to provide enough amount of labeled data for the model which may be hard to do in real-world applications. In this paper we present a graph neural network-based model for learning node representations that can be used efficiently in machine learning methods. The model learns representations in an unsupervised contrastive framework so that there is no need for labels to be present. Also, we test our model by measuring its performance in the task of community detection of graphs. Performance comparing on two citation graphs shows that our model has a better ability to learn representations that have a higher accuracy for community detection than other models in the field.
- 3 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Graph Representation Learning In A Contrastive Framework For Community Detection
Graph structured data has become very popular and useful recently. Many areas in science and technology are using graphs for modeling the phenomena they are dealing with (e.g., computer science, computational economics, biology, …). Since the volume of data and its velocity of generation is increasing every day, using machine learning methods for analyzing this data has become necessary. For this purpose, we need to find a representation for our graph structured data that preserves topological information of the graph alongside the feature information of its nodes. Another challenge in incorporating machine learning methods as a graph data analyzer is to provide enough amount of labeled data for the model which may be hard to do in real-world applications. In this paper we present a graph neural network-based model for learning node representations that can be used efficiently in machine learning methods. The model learns representations in an unsupervised contrastive framework so that there is no need for labels to be present. Also, we test our model by measuring its performance in the task of community detection of graphs. Performance comparing on two citation graphs shows that our model has a better ability to learn representations that have a higher accuracy for community detection than other models in the field.
- 3 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Algorithm for Optimizing Small-Large Outer Join in Cloud Computing Environment
Join operation has always been a topic of interest in scientific research that is commonly used in most applications. Given that a massive amount of information is generated daily, one of the problems and bottlenecks in Join operations is the execution time and the complexity of parallelization. Between all the various join types, the left outer join is the most common whereas little work has been done to optimize this operation. A common type of outer join is Left outer join between small and large tables, and the optimal execution of this operation can have a major impact on the overall performance of programs. In this paper, we present an optimal algorithm that performs left outer join on small-large tables in parallel. We will also discuss all the challenges of parallel join and explain how to implement the algorithm in detail. We perform several experiments in the cloud computing environment using the Spark framework. The results show that the proposed algorithm is scalable and has better performance than existing algorithms.
- 3 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Algorithm for Optimizing Small-Large Outer Join in Cloud Computing Environment
Join operation has always been a topic of interest in scientific research that is commonly used in most applications. Given that a massive amount of information is generated daily, one of the problems and bottlenecks in Join operations is the execution time and the complexity of parallelization. Between all the various join types, the left outer join is the most common whereas little work has been done to optimize this operation. A common type of outer join is Left outer join between small and large tables, and the optimal execution of this operation can have a major impact on the overall performance of programs. In this paper, we present an optimal algorithm that performs left outer join on small-large tables in parallel. We will also discuss all the challenges of parallel join and explain how to implement the algorithm in detail. We perform several experiments in the cloud computing environment using the Spark framework. The results show that the proposed algorithm is scalable and has better performance than existing algorithms.