Hui Lan

Dr. Hui Lan

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
31 August 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
HLHui Lan
Hui Lan
ZLZiquan Liu
Ziquan Liu
JHJanet H. Hsiao
Janet H. Hsiao
DYDan Yu
Dan Yu
ACAntoni B. Chan
Antoni B. Chan
The hidden Markov model (HMM) is a broadly applied generative model for representing time-series data, and clustering HMMs attract increased interest from machine learning researchers. However, the number of clusters (K) and the number of hidden states (S) for cluster centers are still difficult to determine. In this article, we propose a novel HMM-based clustering algorithm, the variational Bayesian hierarchical EM algorithm, which clusters HMMs through their densities and priors and simultaneously learns posteriors for the novel HMM cluster centers that compactly represent the structure of each cluster. The numbers K and S are automatically determined in two ways. First, we place a prior on the pair (K,S) and approximate their posterior probabilities, from which the values with the maximum posterior are selected. Second, some clusters and states are pruned out implicitly when no data samples are assigned to them, thereby leading to automatic selection of the model complexity. Experiments on synthetic and real data demonstrate that our algorithm performs better than using model selection techniques with maximum likelihood estimation.


31 July 2025 in arXiv
Verified
Preprint
Open access
PDF file
HLHui Lan
Hui Lan
XHXu He
Xu He
Computer experiments are pivotal for modeling complex real-world systems. Maximizing information extraction and ensuring accurate surrogate modeling necessitates space-filling designs, where design points extensively cover the input domain. While substantial research has been conducted on maximin distance designs for continuous variables, which aim to maximize the minimum distance between points, methods accommodating mixed-variable types remain underdeveloped. This paper introduces the first general methodology for constructing maximin distance designs integrating continuous, ordinal, and binary variables. This approach allows flexibility in the number of runs, the mix of variable types, and the granularity of levels for ordinal variables. We propose three advanced algorithms, each rigorously supported by theoretical frameworks, that are computationally efficient and scalable. Our numerical evaluations demonstrate that our methods significantly outperform existing techniques in achieving greater separation distances across design points.

6 July 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
HLHui Lan
Hui Lan
LQLuyue Qi
Luyue Qi
楗薛楗元 薛
楗元 薛
QYQijing Yan
Qijing Yan
High-dimensional change point detection is a fundamental problem in modern statistical learning, particularly when distributional changes are driven by a small and unknown subset of variables. In heterogeneous settings, uniform aggregation across coordinates may suffer from signal dilution, because stable or noisy variables can mask the evidence carried by structurally unstable coordinates. Moreover, many existing procedures primarily focus on temporal localization and provide limited information about the variables responsible for a detected structural break. To address these challenges, we propose WAVE, a weighted adaptive variable selection procedure for interpretable change point detection. WAVE constructs variance-standardized global CUSUM evidence and locally standardized exponentially weighted evidence for each coordinate and then adaptively maps intervalwise coordinate evidence into a continuous weight vector. The learned weights strengthen coordinates with persistent or local evidence of change while downweighting nuisance coordinates with weak evidence. The resulting weighted scan statistic is calibrated by a residual moving block bootstrap that preserves temporal and cross-sectional dependence and re-applies the weighting rule within bootstrap samples to account for data-adaptive aggregation. Detected change points are further equipped with coordinate-level attribution through a multi-criteria fusion rule combining adaptive weights, local standardized effect sizes, and marginal testing evidence. Simulation studies show that WAVE achieves accurate localization and reliable support recovery in both single and multiple change point settings, particularly under sparse and heterogeneous alternatives. An empirical analysis of S&P 100 stock returns in 2020 further demonstrates that WAVE identifies economically meaningful market regime shifts with interpretable coordinate-level attribution.