Wengkee Wong

Dr. Wengkee Wong

Department of Biostatistics, UCLA School of Public Health, University of California Los Angeles, Los Angeles, CA 90095-1772, USA

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
12 August 2021 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
ZFZhe Fei
Zhe Fei
YRYevgen Ryeznik
Yevgen Ryeznik
ASAlex Sverdlov
Alex Sverdlov
Chee Wei TanChee Wei Tan
Chee Wei Tan
Wengkee WongWengkee Wong
Wengkee Wong
In the era of big data, standard analysis tools may be inadequate for making inference and there is a growing need for more efficient and innovative ways to collect, process, analyze and interpret the massive and complex data. We provide an overview of challenges in big data problems and describe how innovative analytical methods, machine learning tools and metaheuristics can tackle general healthcare problems with a focus on the current pandemic. In particular, we give applications of modern digital technology, statistical methods,data platforms and data integration systems to improve diagnosis and treatment of diseases in clinical research and novel epidemiologic tools to tackle infection source problems, such as finding Patient Zero in the spread of epidemics. We make the case that analyzing and interpreting big data is a very challenging task that requires a multi-disciplinary effort to continuously create more effective methodologies and powerful tools to transfer data information into knowledge that enables informed decision making.

24 April 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
ECElvis Han Cui
Elvis Han Cui
ZZZizhao Zhang
Zizhao Zhang
CCCulsome Junwen Chen
Culsome Junwen Chen
Wengkee WongWengkee Wong
Wengkee Wong
Nature-inspired metaheuristic algorithms are important components of artificial intelligence, and are increasingly used across disciplines to tackle various types of challenging optimization problems. This paper demonstrates the usefulness of such algorithms for solving a variety of challenging optimization problems in statistics using a nature-inspired metaheuristic algorithm called competitive swarm optimizer with mutated agents (CSO-MA). This algorithm was proposed by one of the authors and its superior performance relative to many of its competitors had been demonstrated in earlier work and again in this paper. The main goal of this paper is to show a typical nature-inspired metaheuristic algorithmi, like CSO-MA, is efficient for tackling many different types of optimization problems in statistics. Our applications are new and include finding maximum likelihood estimates of parameters in a single cell generalized trend model to study pseudotime in bioinformatics, estimating parameters in the commonly used Rasch model in education research, finding M-estimates for a Cox regression in a Markov renewal model, performing matrix completion tasks to impute missing data for a two compartment model, and selecting variables optimally in an ecology problem in China. To further demonstrate the flexibility of metaheuristics, we also find an optimal design for a car refueling experiment in the auto industry using a logistic model with multiple interacting factors. In addition, we show that metaheuristics can sometimes outperform optimization algorithms commonly used in statistics.

18 May 2018 in Biometrics
Verified
Journal Article
Closed access
PDF file
JLJialiang Li
Jialiang Li
XXXiaochao Xia
Xiaochao Xia
Wengkee WongWengkee Wong
Wengkee Wong
DNDavid Nott
David Nott

2 January 2016 in Technometrics
Verified
Journal Article
Closed access
FPFrederick Kin Hing Phoa
Frederick Kin Hing Phoa
RCRay-Bing Chen
Ray-Bing Chen
WWWeichung Wang
Weichung Wang
Wengkee WongWengkee Wong
Wengkee Wong
Supersaturated designs (SSDs) are often used to reduce the number of experimental runs in screening experiments with a large number of factors. As more factors are used in the study, the search for an optimal SSD becomes increasingly challenging because of the large number of feasible selection of factor level settings. This article tackles this discrete optimization problem via an algorithm based on swarm intelligence. Using the commonly used E(s2) criterion as an illustrative example, we propose an algorithm to find E(s2)-optimal SSDs by showing that they attain the theoretical lower bounds found in previous literature. We show that our algorithm consistently produces SSDs that are at least as efficient as those from the traditional CP exchange method in terms of computational effort, frequency of finding the E(s2)-optimal SSD, and also has good potential for finding D3-, D4-, and D5-optimal SSDs. Supplementary materials for this article are available online.

19 August 2008 in Statistics in Medicine
Verified
Journal Article
Closed access
PDF file
Wengkee WongWengkee Wong
Wengkee Wong
WZWei Zhu
Wei Zhu

14 October 2014 in International Statistical Review
Verified
Journal Article
Closed access
PDF file
BDBelmiro Pereira Duarte
Belmiro Pereira Duarte
Wengkee WongWengkee Wong
Wengkee Wong