Amir Masoud Eftekhari Moghadam
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
Research Subjects
Amir Masoud Eftekhari Moghadam has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Fariborz Mahmoudi
General Motors
4 shared publicationsFaraein Aeini
2 shared publications- Faraein Aeini
Islamic Azad University
2 shared publications Monireh-Sadat Hosseini
2 shared publicationsSahar Mazloom
Faculty of Electrical, Computer and IT Engineering, Qazvin Islamic Azad University, Iran
2 shared publicationsSara Sajasi
2 shared publications
Latest Publications
- 18 October 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 84 (25) , 30113-30134
MultiSpectral diffusion: joint generation of wavelet coefficients for image synthesis and upsampling
- 18 October 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 84 (25) , 30113-30134
MultiSpectral diffusion: joint generation of wavelet coefficients for image synthesis and upsampling
- Top Cited PapersOpen Access
- 25 August 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56 (1) , 1-41
Reinforcement Learning Methods for Computation Offloading: A Systematic Review
Today, cloud computation offloading may not be an appropriate solution for delay-sensitive applications due to the long distance between end-devices and remote datacenters. In addition, offloading to a remote cloud can consume bandwidth and dramatically increase costs. However, end-devices such as sensors, cameras, and smartphones have limited computing and storage capacity. Processing tasks on such battery-powered and energy-constrained devices becomes even more complex. To address these challenges, a new paradigm called Edge Computing (EC) emerged nearly a decade ago to bring computing resources closer to end-devices. Here, edge servers located between the end-device and the remote cloud perform user tasks. Recently, several new computing paradigms such as Mobile Edge Computing (MEC) and Fog Computing (FC) have emerged to complement Cloud Computing (CC) and EC. Although these paradigms are heterogeneous, they can further reduce energy consumption and task response time, especially for delay-sensitive applications. Computation offloading is a multi-objective, NP-hard optimization problem. A significant part of previous research in this field is devoted to Machine Learning (ML) methods. One of the essential types of ML is Reinforcement Learning (RL), in which an agent learns how to make the best decision using the experiences gained from the environment. This article provides a systematic review of the widely used RL approaches in computation offloading. It covers research in complementary paradigms such as mobile cloud computing, edge computing, fog computing, and the Internet of Things. We explain the reasons for using various RL methods in computation offloading from a technical point of view. This analysis includes both binary offloading and partial offloading techniques. For each method, the essential elements of RL and the characteristics of the environment are discussed regarding the most important criteria. Research challenges and Future trends are also mentioned.
- 25 August 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56 (1) , 1-41
Top Cited PapersOpen AccessReinforcement Learning Methods for Computation Offloading: A Systematic Review
Today, cloud computation offloading may not be an appropriate solution for delay-sensitive applications due to the long distance between end-devices and remote datacenters. In addition, offloading to a remote cloud can consume bandwidth and dramatically increase costs. However, end-devices such as sensors, cameras, and smartphones have limited computing and storage capacity. Processing tasks on such battery-powered and energy-constrained devices becomes even more complex. To address these challenges, a new paradigm called Edge Computing (EC) emerged nearly a decade ago to bring computing resources closer to end-devices. Here, edge servers located between the end-device and the remote cloud perform user tasks. Recently, several new computing paradigms such as Mobile Edge Computing (MEC) and Fog Computing (FC) have emerged to complement Cloud Computing (CC) and EC. Although these paradigms are heterogeneous, they can further reduce energy consumption and task response time, especially for delay-sensitive applications. Computation offloading is a multi-objective, NP-hard optimization problem. A significant part of previous research in this field is devoted to Machine Learning (ML) methods. One of the essential types of ML is Reinforcement Learning (RL), in which an agent learns how to make the best decision using the experiences gained from the environment. This article provides a systematic review of the widely used RL approaches in computation offloading. It covers research in complementary paradigms such as mobile cloud computing, edge computing, fog computing, and the Internet of Things. We explain the reasons for using various RL methods in computation offloading from a technical point of view. This analysis includes both binary offloading and partial offloading techniques. For each method, the essential elements of RL and the characteristics of the environment are discussed regarding the most important criteria. Research challenges and Future trends are also mentioned.
- Open Access
- 25 October 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-15
Opinion Texts Clustering Using Manifold Learning Based on Sentiment and Semantics Analysis
Nowadays, opinion texts are quickly published on websites and social networks by various users in the form of short texts and also in high volumes and various fields. Because these texts reflect the opinions of many users, their processing and analysis, such as clustering, can be very useful in a variety of applications including politics, industry, commerce, and economics. High dimensions of the text representation decrease efficiency of clustering, and an effective solution for this challenge is reducing dimensions of texts. Manifold learning is a powerful tool for nonlinear dimension reduction of high-dimensional data. Therefore, in this paper, for increasing efficiency of opinion texts clustering, by manifold learning, dimensions of the represented opinion texts are reduced based on sentiment and semantics, and their intrinsic dimensions are extracted. Then, the clustering algorithm is applied to dimension-reduced opinion texts. The proposed approach helps us to cluster opinion texts with simultaneous consideration of sentiment and semantics, which has received very little attention in the previous works. This type of clustering helps users of opinion texts to obtain more useful information from texts and also provides more accurate summaries in applications, such as the summarization of opinion texts. Experimental results on three datasets show better performance of the proposed approach on opinion texts in terms of important measures for evaluating clustering efficiency. An improvement of about 9% is observed in terms of accuracy on the third dataset and clustering based on sentiment and semantics.
- 25 October 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-15
Open AccessOpinion Texts Clustering Using Manifold Learning Based on Sentiment and Semantics Analysis
Nowadays, opinion texts are quickly published on websites and social networks by various users in the form of short texts and also in high volumes and various fields. Because these texts reflect the opinions of many users, their processing and analysis, such as clustering, can be very useful in a variety of applications including politics, industry, commerce, and economics. High dimensions of the text representation decrease efficiency of clustering, and an effective solution for this challenge is reducing dimensions of texts. Manifold learning is a powerful tool for nonlinear dimension reduction of high-dimensional data. Therefore, in this paper, for increasing efficiency of opinion texts clustering, by manifold learning, dimensions of the represented opinion texts are reduced based on sentiment and semantics, and their intrinsic dimensions are extracted. Then, the clustering algorithm is applied to dimension-reduced opinion texts. The proposed approach helps us to cluster opinion texts with simultaneous consideration of sentiment and semantics, which has received very little attention in the previous works. This type of clustering helps users of opinion texts to obtain more useful information from texts and also provides more accurate summaries in applications, such as the summarization of opinion texts. Experimental results on three datasets show better performance of the proposed approach on opinion texts in terms of important measures for evaluating clustering efficiency. An improvement of about 9% is observed in terms of accuracy on the third dataset and clustering based on sentiment and semantics.
- Open Access
- 14 December 2020
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2020, 1-11
HDEC: A Heterogeneous Dynamic Ensemble Classifier for Binary Datasets
In recent years, ensemble classification methods have been widely investigated in both industry and literature in the field of machine learning and artificial intelligence. The main advantage of this approach is to benefit from a set of classifiers instead of using a single classifier with the aim of improving the prediction performance, such as accuracy. Selecting the base classifiers and the method for combining them are the most challenging issues in the ensemble classifiers. In this paper, we propose a heterogeneous dynamic ensemble classifier (HDEC) which uses multiple classification algorithms. The main advantage of using heterogeneous algorithms is increasing the diversity among the base classifiers as it is a key point for an ensemble system to be successful. In this method, we first train many classifiers with the original data. Then, they are separated based on their strength in recognizing either positive or negative instances. For doing this, we consider the true positive rate and true negative rate, respectively. In the next step, the classifiers are categorized into two groups according to their efficiency in the mentioned measures. Finally, the outputs of the two groups are compared with each other to generate the final prediction. For evaluating the proposed approach, it has been applied to 12 datasets from the UCI and LIBSVM repositories and calculated two popular prediction performance metrics, including accuracy and geometric mean. The experimental results show the superiority of the proposed approach in comparison to other state-of-the-art methods.
- 14 December 2020
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2020, 1-11
Open AccessHDEC: A Heterogeneous Dynamic Ensemble Classifier for Binary Datasets
In recent years, ensemble classification methods have been widely investigated in both industry and literature in the field of machine learning and artificial intelligence. The main advantage of this approach is to benefit from a set of classifiers instead of using a single classifier with the aim of improving the prediction performance, such as accuracy. Selecting the base classifiers and the method for combining them are the most challenging issues in the ensemble classifiers. In this paper, we propose a heterogeneous dynamic ensemble classifier (HDEC) which uses multiple classification algorithms. The main advantage of using heterogeneous algorithms is increasing the diversity among the base classifiers as it is a key point for an ensemble system to be successful. In this method, we first train many classifiers with the original data. Then, they are separated based on their strength in recognizing either positive or negative instances. For doing this, we consider the true positive rate and true negative rate, respectively. In the next step, the classifiers are categorized into two groups according to their efficiency in the mentioned measures. Finally, the outputs of the two groups are compared with each other to generate the final prediction. For evaluating the proposed approach, it has been applied to 12 datasets from the UCI and LIBSVM repositories and calculated two popular prediction performance metrics, including accuracy and geometric mean. The experimental results show the superiority of the proposed approach in comparison to other state-of-the-art methods.
- Open Access
- 10 September 2020
- Published by Hindawi Limited in Scientific Programming
- Vol. 2020, 1-14
Statistical Analysis of the Performance of Rank Fusion Methods Applied to a Homogeneous Ensemble Feature Ranking
The feature ranking as a subcategory of the feature selection is an essential preprocessing technique that ranks all features of a dataset such that many important features denote a lot of information. The ensemble learning has two advantages. First, it has been based on the assumption that combining different models output can lead to a better outcome than the output of any individual models. Second, scalability is an intrinsic characteristic that is so crucial in coping with a large scale dataset. In this paper, a homogeneous ensemble feature ranking algorithm is considered, and the nine rank fusion methods used in this algorithm are analyzed comparatively. The experimental studies are performed on real six medium datasets, and the area under the feature-forward-addition curve criterion is assessed. Finally, the statistical analysis by repeated-measures analysis of variance results reveals that there is no big difference in the performance of the rank fusion methods applied in a homogeneous ensemble feature ranking; however, this difference is a statistical significance, and the B-Min method has a little better performance.
- 10 September 2020
- Published by Hindawi Limited in Scientific Programming
- Vol. 2020, 1-14
Open AccessStatistical Analysis of the Performance of Rank Fusion Methods Applied to a Homogeneous Ensemble Feature Ranking
The feature ranking as a subcategory of the feature selection is an essential preprocessing technique that ranks all features of a dataset such that many important features denote a lot of information. The ensemble learning has two advantages. First, it has been based on the assumption that combining different models output can lead to a better outcome than the output of any individual models. Second, scalability is an intrinsic characteristic that is so crucial in coping with a large scale dataset. In this paper, a homogeneous ensemble feature ranking algorithm is considered, and the nine rank fusion methods used in this algorithm are analyzed comparatively. The experimental studies are performed on real six medium datasets, and the area under the feature-forward-addition curve criterion is assessed. Finally, the statistical analysis by repeated-measures analysis of variance results reveals that there is no big difference in the performance of the rank fusion methods applied in a homogeneous ensemble feature ranking; however, this difference is a statistical significance, and the B-Min method has a little better performance.
- 1 March 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 142
Feedback control loop design for workload change detection in self-tuning NoSQL wide column stores
- 1 March 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 142
Feedback control loop design for workload change detection in self-tuning NoSQL wide column stores
- 1 June 2019
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 82, 85-95
A regularized point-to-manifold distance metric for multi-view multi-manifold learning
- 1 June 2019
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 82, 85-95
A regularized point-to-manifold distance metric for multi-view multi-manifold learning
- 16 March 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (9) , 3173-3187
A regularized approach for supervised multi-view multi-manifold learning from unlabeled data
- 16 March 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (9) , 3173-3187
A regularized approach for supervised multi-view multi-manifold learning from unlabeled data
- 23 August 2018
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 13 (2) , 253-261
A regularized approach for unsupervised multi-view multi-manifold learning
- 23 August 2018
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 13 (2) , 253-261
A regularized approach for unsupervised multi-view multi-manifold learning
- 6 January 2018
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 12 (4) , 799-807
Supervised hierarchical neighborhood graph construction for manifold learning
- 6 January 2018
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 12 (4) , 799-807
Supervised hierarchical neighborhood graph construction for manifold learning