Shifeng Xiong
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
Research Subjects
Shifeng Xiong has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
Weiyan Mu
School of Science, Beijing University of Civil Engineering and Architecture, Beijing 100044, China
7 shared publications- Weiyan Mu
School of Science, Beijing University of Civil Engineering and Architecture, Beijing 100044, China
7 shared publications Chunya Li
School of Mathematics, Physics, and Statistics, Shanghai University of Engineering Science
3 shared publicationsYing Wu
School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, People’s Republic of China
3 shared publications- Yong Qin
State Key Laboratory of Advanced Rail Autonomous Operation, Beijing Jiaotong University, Beijing 100044, China
3 shared publications - Chunya Li
School of Mathematics, Physics, and Statistics, Shanghai University of Engineering Science, Shanghai 201620, China
2 shared publications
Latest Publications
- 4 November 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 335
High-dimensional Bayesian optimization via transformation and additivity
- 4 November 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 335
High-dimensional Bayesian optimization via transformation and additivity
- 7 August 2026
- Published by Springer Nature in TEST
- p. 1-30
Bayesian reconstruction regression
- 18 May 2026
- Published by Elsevier in Spatial Statistics
- Vol. 74
Some notes on the spatial autoregressive model
- 18 May 2026
- Published by Elsevier in Spatial Statistics
- Vol. 74
Some notes on the spatial autoregressive model
- 6 January 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 14 (1) , 48-76
Random Fourier Features Based Gaussian Process Models for Stochastic Simulations
Stochastic simulations are increasingly used to describe complex systems with uncertainties. To better characterize the uncertainty of such a simulation, we propose a random Fourier features method to fit full Bayesian Gaussian process emulators for these simulations. The random Fourier features technique uses low-dimensional features of the correlation function of the Gaussian process to achieve a low-rank approximation of the correlation matrix. We prove the convergence of the proposed random Fourier features method. Simulation results show that the proposed method can significantly reduce computation time while maintaining high prediction accuracy. The advantages of the proposed method are also illustrated using a modern subway simulation.
- 6 January 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 14 (1) , 48-76
Random Fourier Features Based Gaussian Process Models for Stochastic Simulations
Stochastic simulations are increasingly used to describe complex systems with uncertainties. To better characterize the uncertainty of such a simulation, we propose a random Fourier features method to fit full Bayesian Gaussian process emulators for these simulations. The random Fourier features technique uses low-dimensional features of the correlation function of the Gaussian process to achieve a low-rank approximation of the correlation matrix. We prove the convergence of the proposed random Fourier features method. Simulation results show that the proposed method can significantly reduce computation time while maintaining high prediction accuracy. The advantages of the proposed method are also illustrated using a modern subway simulation.
- 8 November 2025
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 211
A unified framework of principal component analysis and factor analysis
- 8 November 2025
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 211
A unified framework of principal component analysis and factor analysis
- 16 June 2024
- Published by Springer Nature in Computational Statistics
- Vol. 40 (2) , 883-906
Some aspects of nonlinear dimensionality reduction
- 16 June 2024
- Published by Springer Nature in Computational Statistics
- Vol. 40 (2) , 883-906
Some aspects of nonlinear dimensionality reduction
- Open Access
A Spatiotemporal Probabilistic Graphical Model Based on Adaptive Expectation-Maximization Attention for Individual Trajectory Reconstruction Considering Incomplete Observations
Spatiotemporal information on individual trajectories in urban rail transit is important for operational strategy adjustment, personalized recommendation, and emergency command decision-making. However, due to the lack of journey observations, it is difficult to accurately infer unknown information from trajectories based only on AFC and AVL data. To address the problem, this paper proposes a spatiotemporal probabilistic graphical model based on adaptive expectation maximization attention (STPGM-AEMA) to achieve the reconstruction of individual trajectories. The approach consists of three steps: first, the potential train alternative set and the egress time alternative set of individuals are obtained through data mining and combinatorial enumeration. Then, global and local potential variables are introduced to construct a spatiotemporal probabilistic graphical model, provide the inference process for unknown events, and state information about individual trajectories. Further, considering the effect of missing data, an attention mechanism-enhanced expectation-maximization algorithm is proposed to achieve maximum likelihood estimation of individual trajectories. Finally, typical datasets of origin-destination pairs and actual individual trajectory tracking data are used to validate the effectiveness of the proposed method. The results show that the STPGM-AEMA method is more than 95% accurate in recovering missing information in the observed data, which is at least 15% more accurate than the traditional methods (i.e., PTAM-MLE and MPTAM-EM).
Open AccessA Spatiotemporal Probabilistic Graphical Model Based on Adaptive Expectation-Maximization Attention for Individual Trajectory Reconstruction Considering Incomplete Observations
Spatiotemporal information on individual trajectories in urban rail transit is important for operational strategy adjustment, personalized recommendation, and emergency command decision-making. However, due to the lack of journey observations, it is difficult to accurately infer unknown information from trajectories based only on AFC and AVL data. To address the problem, this paper proposes a spatiotemporal probabilistic graphical model based on adaptive expectation maximization attention (STPGM-AEMA) to achieve the reconstruction of individual trajectories. The approach consists of three steps: first, the potential train alternative set and the egress time alternative set of individuals are obtained through data mining and combinatorial enumeration. Then, global and local potential variables are introduced to construct a spatiotemporal probabilistic graphical model, provide the inference process for unknown events, and state information about individual trajectories. Further, considering the effect of missing data, an attention mechanism-enhanced expectation-maximization algorithm is proposed to achieve maximum likelihood estimation of individual trajectories. Finally, typical datasets of origin-destination pairs and actual individual trajectory tracking data are used to validate the effectiveness of the proposed method. The results show that the STPGM-AEMA method is more than 95% accurate in recovering missing information in the observed data, which is at least 15% more accurate than the traditional methods (i.e., PTAM-MLE and MPTAM-EM).
- Open Access
- 18 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (16) , 3572
Nested Maximum Entropy Designs for Computer Experiments
Presently, computer experiments with multiple levels of accuracy are widely applied in science and engineering. This paper introduces a class of nested maximum entropy designs for such computer experiments. A multi-layer DETMAX algorithm is proposed to construct nested maximum entropy designs. Based on nested maximum entropy designs, we also propose an integer-programming procedure to specify the sample sizes in multi-fidelity computer experiments. Simulated annealing techniques are used to tackle complex optimization problems in the proposed methods. Illustrative examples show that the proposed nested entropy designs can yield better prediction results than nested Latin hypercube designs in the literature and that the proposed sample-size determination method is effective.
- 18 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (16) , 3572
Open AccessNested Maximum Entropy Designs for Computer Experiments
Presently, computer experiments with multiple levels of accuracy are widely applied in science and engineering. This paper introduces a class of nested maximum entropy designs for such computer experiments. A multi-layer DETMAX algorithm is proposed to construct nested maximum entropy designs. Based on nested maximum entropy designs, we also propose an integer-programming procedure to specify the sample sizes in multi-fidelity computer experiments. Simulated annealing techniques are used to tackle complex optimization problems in the proposed methods. Illustrative examples show that the proposed nested entropy designs can yield better prediction results than nested Latin hypercube designs in the literature and that the proposed sample-size determination method is effective.
- 5 May 2023
- Published by Elsevier in Spatial Statistics
- Vol. 55
A unified geographically weighted regression model
- 5 May 2023
- Published by Elsevier in Spatial Statistics
- Vol. 55
A unified geographically weighted regression model
- Open Access
- 15 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1427
Dynamic Modeling for Metro Passenger Flows on Congested Transfer Routes
With the rapid development of urbanization, the metro becomes more and more important for people’s travel in big cities. To quantitatively describe metro passenger flows on congested transfer routes, this paper introduces a dynamic model based on automated data from the automatic fare collection (AFC) and automatic vehicle location (AVL) systems. An expectation maximization (EM) algorithm is proposed to compute the maximum likelihood estimates of unknown parameters in our model. Our model can yield a systematic analysis of one-transfer passenger flows on both population and individual aspects. Important characteristics, including transfer time, boarding probabilities, walking time, passenger-to-train assignment probabilities, and total travel time, can be inferred using only the AFC and AVL data. We provide a case study on the Beijing metro. Detailed analysis results based on our model are given. We also present a cross-validation method to validate our model with real data.
- 15 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1427
Open AccessDynamic Modeling for Metro Passenger Flows on Congested Transfer Routes
With the rapid development of urbanization, the metro becomes more and more important for people’s travel in big cities. To quantitatively describe metro passenger flows on congested transfer routes, this paper introduces a dynamic model based on automated data from the automatic fare collection (AFC) and automatic vehicle location (AVL) systems. An expectation maximization (EM) algorithm is proposed to compute the maximum likelihood estimates of unknown parameters in our model. Our model can yield a systematic analysis of one-transfer passenger flows on both population and individual aspects. Important characteristics, including transfer time, boarding probabilities, walking time, passenger-to-train assignment probabilities, and total travel time, can be inferred using only the AFC and AVL data. We provide a case study on the Beijing metro. Detailed analysis results based on our model are given. We also present a cross-validation method to validate our model with real data.