Di Wu
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
Di Wu has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Yurong Xie
School of Mathematics and Statistics, Shaanxi Normal University, Xi’an 710119, China
4 shared publications - Zhe Qiang
School of Mathematics, Northwest University, Xi’an 710127, China
4 shared publications DunShan Yu
Institute of Microelectronics, Peking University, Beijing 100871, People's Republic of China
1 shared publication- Jianrui Chen
School of Artificial Intelligence and Computer Science, Shaanxi Normal University, Xian, China
1 shared publication - Jinwen Ma
School of Mathematical Sciences and LMAM, Peking University
1 shared publication - Kai Liao
University of Electronic Science and Technology of China, Chengdu, China
1 shared publication
Latest Publications
- 6 August 2026
- Published by Elsevier in Neural Networks
- Vol. 205
Mixture of warped Gaussian process functional regressions and its classification EM algorithm
- 6 August 2026
- Published by Elsevier in Neural Networks
- Vol. 205
Mixture of warped Gaussian process functional regressions and its classification EM algorithm
- 11 January 2024
- Published by Elsevier in Information Sciences
- Vol. 660
A unifying view for the mixture model of sparse Gaussian processes
- 11 January 2024
- Published by Elsevier in Information Sciences
- Vol. 660
A unifying view for the mixture model of sparse Gaussian processes
- 4 July 2023
- Published by Elsevier in Pattern Recognition
- Vol. 143
An efficient EM algorithm for two-layer mixture model of gaussian process functional regressions
- 4 July 2023
- Published by Elsevier in Pattern Recognition
- Vol. 143
An efficient EM algorithm for two-layer mixture model of gaussian process functional regressions
- Open Access
- 11 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2251
An Improved Mixture Model of Gaussian Processes and Its Classification Expectation–Maximization Algorithm
The mixture of experts (ME) model is effective for multimodal data in statistics and machine learning. To treat non-stationary probabilistic regression, the mixture of Gaussian processes (MGP) model has been proposed, but it may not perform well in some cases due to the limited ability of each Gaussian process (GP) expert. Although the mixture of Gaussian processes (MGP) and warped Gaussian process (WGP) models are dominant and effective for non-stationary probabilistic regression, they may not be able to handle general non-stationary probabilistic regression in practice. In this paper, we first propose the mixture of warped Gaussian processes (MWGP) model as well as its classification expectation–maximization (CEM) algorithm to address this problem. To overcome the local optimum of the CEM algorithm, we then propose the split and merge CEM (SMC EM) algorithm for MWGP. Experiments were done on synthetic and real-world datasets, which show that our proposed MWGP is more effective than the models used for comparison, and the SMCEM algorithm can solve the local optimum for MWGP.
- 11 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2251
Open AccessAn Improved Mixture Model of Gaussian Processes and Its Classification Expectation–Maximization Algorithm
The mixture of experts (ME) model is effective for multimodal data in statistics and machine learning. To treat non-stationary probabilistic regression, the mixture of Gaussian processes (MGP) model has been proposed, but it may not perform well in some cases due to the limited ability of each Gaussian process (GP) expert. Although the mixture of Gaussian processes (MGP) and warped Gaussian process (WGP) models are dominant and effective for non-stationary probabilistic regression, they may not be able to handle general non-stationary probabilistic regression in practice. In this paper, we first propose the mixture of warped Gaussian processes (MWGP) model as well as its classification expectation–maximization (CEM) algorithm to address this problem. To overcome the local optimum of the CEM algorithm, we then propose the split and merge CEM (SMC EM) algorithm for MWGP. Experiments were done on synthetic and real-world datasets, which show that our proposed MWGP is more effective than the models used for comparison, and the SMCEM algorithm can solve the local optimum for MWGP.
- 10 December 2022
- Published by Springer Nature
- p. 160-174
Regularized Framework on Heterogeneous Hypergraph Model for Personal Recommendation
- 10 December 2022
- Published by Springer Nature
- p. 160-174
Regularized Framework on Heterogeneous Hypergraph Model for Personal Recommendation
- 5 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (10) , 4894-4904
A Two-Layer Mixture Model of Gaussian Process Functional Regressions and Its MCMC EM Algorithm
The mixture of Gaussian processes (GPs) is capable of learning any general stochastic process based on a given set of (sample) curves for the regression and prediction problems. However, it is ineffective for curve clustering and prediction, when the sample curves are derived from different stochastic processes as independent sources linearly mixed together. In this paper, we propose a two-layer mixture model of GP functional regressions (GPFRs) to describe such a mixture of general stochastic processes or independent sources, especially for curve clustering and prediction. Specifically, in the lower layer, the mixture of GPFRs (MGPFRs) is developed for a cluster (or class) of curves within the input space . In the higher layer, the mixture of MGPFRs is further established to divide the curves into clusters according to its components in the output space . For the parameter estimation of the two-layer mixture of GPFRs, we develop a Monte Carlo EM algorithm based on a Monte Carlo Markov chain (MCMC) method, in short, the MCMC EM algorithm. We validate the hierarchical mixture of GPFRs and MCMC EM algorithm using synthetic and real-world data sets. Our results show that our new model outperforms the conventional mixture models in curve clustering and prediction.
- 5 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (10) , 4894-4904
A Two-Layer Mixture Model of Gaussian Process Functional Regressions and Its MCMC EM Algorithm
The mixture of Gaussian processes (GPs) is capable of learning any general stochastic process based on a given set of (sample) curves for the regression and prediction problems. However, it is ineffective for curve clustering and prediction, when the sample curves are derived from different stochastic processes as independent sources linearly mixed together. In this paper, we propose a two-layer mixture model of GP functional regressions (GPFRs) to describe such a mixture of general stochastic processes or independent sources, especially for curve clustering and prediction. Specifically, in the lower layer, the mixture of GPFRs (MGPFRs) is developed for a cluster (or class) of curves within the input space . In the higher layer, the mixture of MGPFRs is further established to divide the curves into clusters according to its components in the output space . For the parameter estimation of the two-layer mixture of GPFRs, we develop a Monte Carlo EM algorithm based on a Monte Carlo Markov chain (MCMC) method, in short, the MCMC EM algorithm. We validate the hierarchical mixture of GPFRs and MCMC EM algorithm using synthetic and real-world data sets. Our results show that our new model outperforms the conventional mixture models in curve clustering and prediction.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 437 (02714302) , 129-132
A Dynamic-Adjusting Threshold-Voltage Scheme for FinFETs low power designs
In this paper, a novel device/circuit co-design scheme, namely Dynamic-Adjusting Threshold-Voltage Scheme (DATS) for independent-gate mode FinFET circuits has been proposed. The main idea of this scheme is that a pair of back-gate bias of FinFETs is adjusted dynamically to change threshold voltage according to the system operating frequency and operating mode, which could optimize circuit power, especially leakage power. The experimental and simulation result shows that the leakage power dissipation reduced greatly when circuits operate at the lower frequency, and the energy-delay product of FinFET circuits is reduced by 30% approximately.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 437 (02714302) , 129-132
A Dynamic-Adjusting Threshold-Voltage Scheme for FinFETs low power designs
In this paper, a novel device/circuit co-design scheme, namely Dynamic-Adjusting Threshold-Voltage Scheme (DATS) for independent-gate mode FinFET circuits has been proposed. The main idea of this scheme is that a pair of back-gate bias of FinFETs is adjusted dynamically to change threshold voltage according to the system operating frequency and operating mode, which could optimize circuit power, especially leakage power. The experimental and simulation result shows that the leakage power dissipation reduced greatly when circuits operate at the lower frequency, and the energy-delay product of FinFET circuits is reduced by 30% approximately.