Abolfazl Ghassemi
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
Abolfazl Ghassemi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Aaron Gulliver
Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada
2 shared publications M. Mohajeri
University of Tehran, Tehran, Iran
1 shared publication- Mohammad R. Mirsarraf
Department of Information Technology, ICT Research Institute (ITRC), Tehran 1439955471, Iran
1 shared publication Morteza Mohajeri
School of Electrical and Computer Engineering, University of Tehran, Tehran 1417466191, Iran
1 shared publication- Pejman Goudarzi
ICT Research Institute, Tehran 14155-3961, Iran
1 shared publication - Rajkumar Buyya
University of Melbourne
1 shared publication
Latest Publications
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Low-Complexity Dimensionality Reduction for Big Data Analytics in the Smart Grid
A polar projection-based algorithm is proposed to reduce the computational complexity of dimensionality reduction in unsupervised learning algorithms. In particular, we consider the $K$ -means clustering algorithm. A new distance metric is developed to account for peak power consumption to cluster consumer load profiles. This is used to cluster load profiles according to both total and peak power consumption. Numerical results are presented which demonstrate a significant reduction in computational complexity compared to $K$ -means clustering using conventional dimension reduction techniques.- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Low-Complexity Dimensionality Reduction for Big Data Analytics in the Smart Grid
A polar projection-based algorithm is proposed to reduce the computational complexity of dimensionality reduction in unsupervised learning algorithms. In particular, we consider the $K$ -means clustering algorithm. A new distance metric is developed to account for peak power consumption to cluster consumer load profiles. This is used to cluster load profiles according to both total and peak power consumption. Numerical results are presented which demonstrate a significant reduction in computational complexity compared to $K$ -means clustering using conventional dimension reduction techniques.- Open Access
- 17 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 1, 1864-1871
Fast Big Data Analytics for Smart Meter Data
A polar projection-based algorithm is proposed to reduce the computational complexity associated with dimension reduction in unsupervised learning. This algorithm employs K-means clustering. A new distance metric is developed to account for peak consumption in cluster consumer load profiles. It is used to cluster the load profiles according to both total and peak consumption. To accelerate the clustering process, a stochastic-based approach is developed to reduce the search space to find the cluster centers. Numerical results are presented which show a significant reduction in computational complexity using both polar-based and stochastic-based clustering compared to conventional approaches. Further, the estimation error is low.
- 17 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 1, 1864-1871
Open AccessFast Big Data Analytics for Smart Meter Data
A polar projection-based algorithm is proposed to reduce the computational complexity associated with dimension reduction in unsupervised learning. This algorithm employs K-means clustering. A new distance metric is developed to account for peak consumption in cluster consumer load profiles. It is used to cluster the load profiles according to both total and peak consumption. To accelerate the clustering process, a stochastic-based approach is developed to reduce the search space to find the cluster centers. Numerical results are presented which show a significant reduction in computational complexity using both polar-based and stochastic-based clustering compared to conventional approaches. Further, the estimation error is low.
- 9 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (1) , 927-938
Joint Energy-QoE Efficient Content Delivery Networks Using Real-Time Energy Management
In this paper, a joint optimization method has been proposed for energy cost and the user’s perceived quality-of-experience (QoE) within a content delivery network (CDN). The proposed algorithm has been developed with an objective to minimize the total operational cost using real-time electricity pricing as well as the integration of green energy resources from the smart grid. To solve the joint optimization problem, a linear programming and a differential evolution algorithm have been used to provide a tradeoff between operational cost saving and computational complexity. We also formulate the joint problem as a noncooperative game in which the CDN providers act as players. A group utility function has been defined for the players and it is shown that a Nash equilibrium exists for the joint quality and energy cost saving when each CDN provider has single cluster or multiple clusters. Numerical results are presented to evaluate and validate the aforementioned solutions. These results illustrate significant operational/energy cost reductions while optimizing user’s perceived QoE for a CDN or multiple CDN providers with respect to conventional methods.
- 9 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (1) , 927-938
Joint Energy-QoE Efficient Content Delivery Networks Using Real-Time Energy Management
In this paper, a joint optimization method has been proposed for energy cost and the user’s perceived quality-of-experience (QoE) within a content delivery network (CDN). The proposed algorithm has been developed with an objective to minimize the total operational cost using real-time electricity pricing as well as the integration of green energy resources from the smart grid. To solve the joint optimization problem, a linear programming and a differential evolution algorithm have been used to provide a tradeoff between operational cost saving and computational complexity. We also formulate the joint problem as a noncooperative game in which the CDN providers act as players. A group utility function has been defined for the players and it is shown that a Nash equilibrium exists for the joint quality and energy cost saving when each CDN provider has single cluster or multiple clusters. Numerical results are presented to evaluate and validate the aforementioned solutions. These results illustrate significant operational/energy cost reductions while optimizing user’s perceived QoE for a CDN or multiple CDN providers with respect to conventional methods.