Wai Kuan Wong

Dr. Wai Kuan Wong

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
23 September 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
SXSuwen Xie
Suwen Xie
WWWai Kuan Wong
Wai Kuan Wong
HLHui Shan LEE
Hui Shan LEE
KKKee Seng Kuang
Kee Seng Kuang
China is one of the world’s largest tea-producing countries, and its fluctuations in production affect the international market and domestic economic stability. Existing research often uses limited predictive models at the local scale and lacks systematic national analysis. This study evaluated five models—autoregressive integrated moving average model (ARIMA), grey model (GM (1,1)), Markov chain grey model (Markov-GM (1,1)), particle swarm optimization Markov chain grey model (PSO-Markov-GM), and dynamic rolling update grey model (DRUGM (1,1))—using three stages of annual tea production data from China (2004–2023). The results indicate that DRUGM (1,1) has the lowest prediction error, demonstrating superior ability to capture production trends. The dynamic update mechanism of this model enhances its adaptability, providing an efficient and scalable framework for predicting the production level of tea and other crops. Accurate predictions are crucial for improving agricultural planning, optimizing resource allocation, and providing information for trade policy design. This study provides practical tools for sustainable agricultural decision-making, helping to strengthen rural economic stability and resilient food systems.

1 January 2024 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
PDF file
KLKevin Yew Choon Liang
Kevin Yew Choon Liang
WWWai Kuan Wong
Wai Kuan Wong
SSSim Hong Seng
Sim Hong Seng
YGYong Kheng Goh
Yong Kheng Goh
PYPan Wei Yeing
Pan Wei Yeing
SSShin Zhu Sim
Shin Zhu Sim
In this paper, we propose a modified mean-variance portfolio selection procedure using the proximal gradient method. This novel selection procedure has the advantage of encouraging sparsity in the entire portfolio usingl0−norm while requiring only O(n) storage. The proximal gradient method (PSG) introduces a multiple damping gradient (MDG) method to reduce the computation time, with Lipschitz constant serving as the step size, and iterative thresholding (IHT) as the proximal method to induce the sparsity of the portfolio. To find the optimal portfolio, an efficient algorithm is developed. The performance of the proposed selection procedure is illustrated by its application to real-life data set. It is shown that the proposed portfolio performs consistently better in comparison with other methods.