Chinedu Pascal Ezenkwu

Dr. Chinedu Pascal Ezenkwu

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 August 2023 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Open access
FBFarouk Said BOUKREDERA
Farouk Said BOUKREDERA
MYMohamed Riad Youcefi
Mohamed Riad Youcefi
AHAhmed Hadjadj
Ahmed Hadjadj
Chinedu Pascal EzenkwuChinedu Pascal Ezenkwu
Chinedu Pascal Ezenkwu
VVVahid Vaziri
Vahid Vaziri
SASumeet Aphale
Sumeet Aphale

3 February 2024 in Environmental Monitoring and Assessment
Verified
Journal Article
Open access
PDF file
Chinedu Pascal EzenkwuChinedu Pascal Ezenkwu
Chinedu Pascal Ezenkwu
SCSan Cannon
San Cannon
Dr Ebuka IbekeDr Ebuka Ibeke
Dr Ebuka Ibeke
Across the globe, governments are developing policies and strategies to reduce carbon emissions to address climate change. Monitoring the impact of governments’ carbon reduction policies can significantly enhance our ability to combat climate change and meet emissions reduction targets. One promising area in this regard is the role of artificial intelligence (AI) in carbon reduction policy and strategy monitoring. While researchers have explored applications of AI on data from various sources, including sensors, satellites, and social media, to identify areas for carbon emissions reduction, AI applications in tracking the effect of governments’ carbon reduction plans have been limited. This study presents an AI framework based on long short-term memory (LSTM) and statistical process control (SPC) for the monitoring of variations in carbon emissions, using UK annual CO2 emission (per capita) data, covering a period between 1750 and 2021. This paper used LSTM to develop a surrogate model for the UK’s carbon emissions characteristics and behaviours. As observed in our experiments, LSTM has better predictive abilities than ARIMA, Exponential Smoothing and feedforward artificial neural networks (ANN) in predicting CO2 emissions on a yearly prediction horizon. Using the deviation of the recorded emission data from the surrogate process, the variations and trends in these behaviours are then analysed using SPC, specifically Shewhart individual/moving range control charts. The result shows several assignable variations between the mid-1990s and 2021, which correlate with some notable UK government commitments to lower carbon emissions within this period. The framework presented in this paper can help identify periods of significant deviations from a country’s normal CO2 emissions, which can potentially result from the government’s carbon reduction policies or activities that can alter the amount of CO2 emissions.

14 July 2023
Verified
Conference Paper
Open access
Chinedu Pascal EzenkwuChinedu Pascal Ezenkwu
Chinedu Pascal Ezenkwu
By harnessing both implicit and explicit customer data, companies can develop a more comprehensive understanding of their consumers, leading to better customer engagement and experience, and improved loyalty. As a result, businesses have embraced many AI technologies, including chatbots, sentiment analysis, voice assistants, predictive analytics, and natural language processing, within customer services and e-commerce. The arrival of ChatGPT, a state-of-the-art deep learning model trained with general knowledge in mind, has brought about a paradigm shift in how companies approach AI applications. However, given that most business problems are bespoke and require specialised domain expertise, ChatGPT needs to be aligned with the requisite task-oriented ability to solve these issues. This paper presents an iterative procedure that incorporates expert system development process models and prompt engineering, in the design of descriptive knowledge and few-shot prompts, as are necessary for ChatGPT-powered expert systems applications within customer services. Furthermore, this paper explores potential application areas for ChatGPT-powered expert systems in customer services, presenting opportunities for their effective utilisation in the business sector.

1 December 2021 in Machine Learning with Applications
Verified
Journal Article
Open access
Chinedu Pascal EzenkwuChinedu Pascal Ezenkwu
Chinedu Pascal Ezenkwu
UAUduak Idio Akpan
Uduak Idio Akpan
BSBliss Utibe-Abasi Stephen
Bliss Utibe-Abasi Stephen

2 June 2022 in Advances in Computational Intelligence
Verified
Journal Article
Open access
PDF file
Chinedu Pascal EzenkwuChinedu Pascal Ezenkwu
Chinedu Pascal Ezenkwu
ASAndrew Starkey
Andrew Starkey
Due to their dependence on a task-specific reward function, reinforcement learning agents are ineffective at responding to a dynamic goal or environment. This paper seeks to overcome this limitation of traditional reinforcement learning through a task-agnostic, self-organising autonomous agent framework. The proposed algorithm is a hybrid of TMGWR for self-adaptive learning of sensorimotor maps and value iteration for goal-directed planning. TMGWR has been previously demonstrated to overcome the problems associated with competing sensorimotor techniques such SOM, GNG, and GWR; these problems include: difficulty in setting a suitable number of neurons for a task, inflexibility, the inability to cope with non-markovian environments, challenges with noise, and inappropriate representation of sensory observations and actions together. However, the binary sensorimotor-link implementation in the original TMGWR enables catastrophic forgetting when the agent experiences changes in the task and it is therefore not suitable for self-adaptive learning. A new sensorimotor-link update rule is presented in this paper to enable the adaptation of the sensorimotor map to new experiences. This paper has demonstrated that the TMGWR-based algorithm has better sample efficiency than model-free reinforcement learning and better self-adaptivity than both the model-free and the traditional model-based reinforcement learning algorithms. Moreover, the algorithm has been demonstrated to give the lowest overall computational cost when compared to traditional reinforcement learning algorithms.