Yanxi Xie
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
Yanxi Xie has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Yuewen Li
School of Management, Shanghai University of Engineering Science, Shanghai 201620, China
4 shared publications Zhijie Xia
School of Management, Shanghai University of Engineering Science, Shanghai 201620, China
3 shared publications- Dongqing Luan
School of Management
2 shared publications - Victor Shi
Lazaridis School of Business and Economics, Wilfrid Laurier University, Waterloo, Canada
2 shared publications Xiaoli Wang
2 shared publications- Xiaoli Wang
School of Management
2 shared publications
Latest Publications
- Open Access
- 17 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (10) , 2042
How Do Incentive Policy and Benefit Distribution Affect the Cooperative Development Mechanism of Intelligent Connected Vehicles? A Tripartite Evolutionary Game Approach
The intelligent connected vehicle (ICV) industry encounters substantial challenges related to technology, policies, and funding. Its development relies not only on the close collaboration and technological innovation between carmakers and technology companies but also on the support of government’s incentive policies. Therefore, this paper establishes a tripartite evolutionary game model that involves governments, carmakers, and technology companies to investigate the stability equilibrium strategy of multi-party participation in promoting the development of the ICV industry. In addition, by analyzing relevant regulations and company annual reports, this paper conducts a simulation analysis to examine how government incentive policies and benefit distribution mechanisms impact the evolutionary trajectory. Several insightful and practical conclusions are drawn. First, in the early stages of industrial development, the government’s infrastructure investment could promote the cross-border innovation cooperation between carmakers and technology companies, thereby accelerating the advancement of ICVs; however, the long-term impact of the sustained investment remains limited. Second, the incremental government subsidies for carmakers and technology companies within limits could increase the probability of them choosing to cooperate and innovate with each other. Still, the excessive subsidies could result in unstable industry growth. Finally, the increase in the benefit distribution ratio for carmakers with professional technology in automotive technology and vehicle design has a positive effect on the development of the ICV industry. This paper expands the research scope of ICVs and provides theoretical insights for promoting the sustainable development of the ICV industry from policy and market viewpoints.
- 17 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (10) , 2042
Open AccessHow Do Incentive Policy and Benefit Distribution Affect the Cooperative Development Mechanism of Intelligent Connected Vehicles? A Tripartite Evolutionary Game Approach
The intelligent connected vehicle (ICV) industry encounters substantial challenges related to technology, policies, and funding. Its development relies not only on the close collaboration and technological innovation between carmakers and technology companies but also on the support of government’s incentive policies. Therefore, this paper establishes a tripartite evolutionary game model that involves governments, carmakers, and technology companies to investigate the stability equilibrium strategy of multi-party participation in promoting the development of the ICV industry. In addition, by analyzing relevant regulations and company annual reports, this paper conducts a simulation analysis to examine how government incentive policies and benefit distribution mechanisms impact the evolutionary trajectory. Several insightful and practical conclusions are drawn. First, in the early stages of industrial development, the government’s infrastructure investment could promote the cross-border innovation cooperation between carmakers and technology companies, thereby accelerating the advancement of ICVs; however, the long-term impact of the sustained investment remains limited. Second, the incremental government subsidies for carmakers and technology companies within limits could increase the probability of them choosing to cooperate and innovate with each other. Still, the excessive subsidies could result in unstable industry growth. Finally, the increase in the benefit distribution ratio for carmakers with professional technology in automotive technology and vehicle design has a positive effect on the development of the ICV industry. This paper expands the research scope of ICVs and provides theoretical insights for promoting the sustainable development of the ICV industry from policy and market viewpoints.
- Open Access
- 24 March 2023
- Published by MDPI AG in Behavioral Sciences
- Vol. 13 (4) , 282
Dynamic Characteristics and Evolution Analysis of Information Dissemination Theme of Social Networks under Emergencies
Social media has become an essential channel for the public to create and obtain information during emergencies. As the theme of public concern for emergencies changes over time, there is a lack of research on its dynamic evolution from its latent stage. This paper selects the Henan rainstorm event as a case study and extracts the theme characteristics by combining the life cycle theory and Latent Dirichlet Allocation (LDA) model. It integrates the Term Frequency–Inverse Document Frequency (TF-IDF) and Pointwise Mutual Information (PMI) algorithms as the theme-coding data source to build a dynamic theme propagation model for emergencies. Our research results showed that the theme coding effectively verified the assumption of latent development trends. The dynamic theme model could reveal the theme characteristics of different time series stages of emergencies, analyze the law of the theme evolution of the network’s public opinion, and provide practical and theoretical insights for the emergency management of urban cities.
- 24 March 2023
- Published by MDPI AG in Behavioral Sciences
- Vol. 13 (4) , 282
Open AccessDynamic Characteristics and Evolution Analysis of Information Dissemination Theme of Social Networks under Emergencies
Social media has become an essential channel for the public to create and obtain information during emergencies. As the theme of public concern for emergencies changes over time, there is a lack of research on its dynamic evolution from its latent stage. This paper selects the Henan rainstorm event as a case study and extracts the theme characteristics by combining the life cycle theory and Latent Dirichlet Allocation (LDA) model. It integrates the Term Frequency–Inverse Document Frequency (TF-IDF) and Pointwise Mutual Information (PMI) algorithms as the theme-coding data source to build a dynamic theme propagation model for emergencies. Our research results showed that the theme coding effectively verified the assumption of latent development trends. The dynamic theme model could reveal the theme characteristics of different time series stages of emergencies, analyze the law of the theme evolution of the network’s public opinion, and provide practical and theoretical insights for the emergency management of urban cities.
- Open Access
- 1 August 2022
- Published by Hindawi Limited in Scientific Programming
- Vol. 2022, 1-12
An Orthogonal Matching Pursuit Variable Screening Algorithm for High-Dimensional Linear Regression Models
Variable selection plays an important role in data mining. It is crucial to filter useful variables and extract useful information in a high-dimensional setup when the number of predictor variables d tends to be much larger than the sample size n . Statistical inferences can be more precise after irrelevant variables are moved out by the screening method. This article proposes an orthogonal matching pursuit algorithm for variable screening under the high-dimensional setup. The proposed orthogonal matching pursuit method demonstrates good performance in variable screening. In particular, if the dimension of the true model is finite, OMP might discover all relevant predictors within a finite number of steps. Throughout theoretical analysis and simulations, it is confirmed that the orthogonal matching pursuit algorithm can identify relevant predictors to ensure screening consistency in variable selection. Given the sure screening property, the BIC criterion can be used to practically select the best candidate from the models generated by the OMP algorithm. Compared with the traditional orthogonal matching pursuit method, the resulting model can improve prediction accuracy and reduce computational cost by screening out the relevant variables.
- 1 August 2022
- Published by Hindawi Limited in Scientific Programming
- Vol. 2022, 1-12
Open AccessAn Orthogonal Matching Pursuit Variable Screening Algorithm for High-Dimensional Linear Regression Models
Variable selection plays an important role in data mining. It is crucial to filter useful variables and extract useful information in a high-dimensional setup when the number of predictor variables d tends to be much larger than the sample size n . Statistical inferences can be more precise after irrelevant variables are moved out by the screening method. This article proposes an orthogonal matching pursuit algorithm for variable screening under the high-dimensional setup. The proposed orthogonal matching pursuit method demonstrates good performance in variable screening. In particular, if the dimension of the true model is finite, OMP might discover all relevant predictors within a finite number of steps. Throughout theoretical analysis and simulations, it is confirmed that the orthogonal matching pursuit algorithm can identify relevant predictors to ensure screening consistency in variable selection. Given the sure screening property, the BIC criterion can be used to practically select the best candidate from the models generated by the OMP algorithm. Compared with the traditional orthogonal matching pursuit method, the resulting model can improve prediction accuracy and reduce computational cost by screening out the relevant variables.
- 18 April 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 600
Research on multi-topic network public opinion propagation model with time delay in emergencies
- 18 April 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 600
Research on multi-topic network public opinion propagation model with time delay in emergencies
- RetractedOpen Access
- 13 January 2022
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2022 (1)
[Retracted] Robust Two‐Stage Location Allocation for Emergency Temporary Blood Supply in Postdisaster
Disaster medical rescue in China mainly adopts the “on‐site rescue” model. Whether the location of emergency temporary blood supply sites is reasonable or not directly affects the rescue efficiency. The paper studies the robust location‐allocation for emergency temporary blood supply after disaster. First, the factors of several candidate sites were quantified by the entropy‐based TOPSIS method, and 12 candidate blood supply sites with higher priority were selected according to the evaluation indicators. At the same time, the uncertainty of blood demand at each disaster site increased the difficulty of decision‐making, and then, a robust location model (MIRP) was constructed with minimum cost with time window constraints. It is also constrained by the uncertain demand for blood in three scenarios. Second, the survival probability function was introduced, and the time window limit was given at the minimum cost to maximize the survival probability of the suffered people. Finally, the numerical example experiments demonstrate that the increase in demand uncertainty and survival probability cause the MIRP model to generate more costs. Compared with the three MIRP models, the MIRP‐ellipsoid set model gained better robustness. Also, given the necessary restrictions on the time window, the cost can be reduced by about 13% with the highest survival probability. Decision‐makers can select different combinations of uncertainty levels and demand disturbance ratios and necessary time constraints to obtain the optimal location‐allocation solution according to risk preference and actual conditions.
- 13 January 2022
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2022 (1)
RetractedOpen Access[Retracted] Robust Two‐Stage Location Allocation for Emergency Temporary Blood Supply in Postdisaster
Disaster medical rescue in China mainly adopts the “on‐site rescue” model. Whether the location of emergency temporary blood supply sites is reasonable or not directly affects the rescue efficiency. The paper studies the robust location‐allocation for emergency temporary blood supply after disaster. First, the factors of several candidate sites were quantified by the entropy‐based TOPSIS method, and 12 candidate blood supply sites with higher priority were selected according to the evaluation indicators. At the same time, the uncertainty of blood demand at each disaster site increased the difficulty of decision‐making, and then, a robust location model (MIRP) was constructed with minimum cost with time window constraints. It is also constrained by the uncertain demand for blood in three scenarios. Second, the survival probability function was introduced, and the time window limit was given at the minimum cost to maximize the survival probability of the suffered people. Finally, the numerical example experiments demonstrate that the increase in demand uncertainty and survival probability cause the MIRP model to generate more costs. Compared with the three MIRP models, the MIRP‐ellipsoid set model gained better robustness. Also, given the necessary restrictions on the time window, the cost can be reduced by about 13% with the highest survival probability. Decision‐makers can select different combinations of uncertainty levels and demand disturbance ratios and necessary time constraints to obtain the optimal location‐allocation solution according to risk preference and actual conditions.
- Open Access
- 13 January 2022
- Published by MDPI AG in Electronics
- Vol. 11 (2) , 244
Rough Set-Game Theory Information Mining Model Considering Opponents’ Information
In multi-strategy games, the increase in the number of strategies makes it difficult to make a solution. To maintain the competition advantage and obtain maximal profits, one side of the game hopes to predict the opponent’s behavior. Building a model to predict an opponent’s behavior is helpful. In this paper, we propose a rough set-game theory model (RS-GT) considering uncertain information and the opponent’s decision rules. The uncertainty of strategies is obtained based on the rough set method, and an accurate solution is obtained based on game theory from the rough set-game theory model. The players obtain their competitors’ decision rules to predict the opponents’ behavior by mining the information from repeated games in the past. The players determine their strategy to obtain maximum profits by predicting the opponent’s actions, i.e., adopting a first-mover or second-mover strategy to build a favorable situation. The result suggests that the rough set-game theory model helps enterprises avoid unnecessary losses and allows them to obtain greater profits.
- 13 January 2022
- Published by MDPI AG in Electronics
- Vol. 11 (2) , 244
Open AccessRough Set-Game Theory Information Mining Model Considering Opponents’ Information
In multi-strategy games, the increase in the number of strategies makes it difficult to make a solution. To maintain the competition advantage and obtain maximal profits, one side of the game hopes to predict the opponent’s behavior. Building a model to predict an opponent’s behavior is helpful. In this paper, we propose a rough set-game theory model (RS-GT) considering uncertain information and the opponent’s decision rules. The uncertainty of strategies is obtained based on the rough set method, and an accurate solution is obtained based on game theory from the rough set-game theory model. The players obtain their competitors’ decision rules to predict the opponents’ behavior by mining the information from repeated games in the past. The players determine their strategy to obtain maximum profits by predicting the opponent’s actions, i.e., adopting a first-mover or second-mover strategy to build a favorable situation. The result suggests that the rough set-game theory model helps enterprises avoid unnecessary losses and allows them to obtain greater profits.
- Open Access
- 11 December 2021
- Published by Wiley in Journal of Mathematics
- Vol. 2021, 1-8
Resource Configuration Efficiency and Influencing Factors of Elderly Care Services Based on a Data-Driven DEA-Tobit Approach
Efficient resource configuration is critical to providing sustainable aged care services. Empirical studies are conducted with a two-stage data-driven method of DEA-Tobit. First, the BCC model of data envelopment analysis is employed, to determine whether the values obtained from the three efficiency aspects (namely technical, pure technical, and scale) are situated in the frontiers of production, whether DEA is effective, and whether the problems of uneconomical scale or low technical level are available. Next, the causes of these problems are analyzed. Then, the regression analysis is performed using Tobit with the influencing factors including GDP, the number of institutions engaged in elderly care, the number of day service centers in the communities, the number of medical service institutions for the elderly, and the density of the elderly population. Known as a city with a severely aging population, Shanghai will be selected for a case study to propose countermeasures from the three dimensions of the elderly group, the elderly care industry, and the market environment.
- 11 December 2021
- Published by Wiley in Journal of Mathematics
- Vol. 2021, 1-8
Open AccessResource Configuration Efficiency and Influencing Factors of Elderly Care Services Based on a Data-Driven DEA-Tobit Approach
Efficient resource configuration is critical to providing sustainable aged care services. Empirical studies are conducted with a two-stage data-driven method of DEA-Tobit. First, the BCC model of data envelopment analysis is employed, to determine whether the values obtained from the three efficiency aspects (namely technical, pure technical, and scale) are situated in the frontiers of production, whether DEA is effective, and whether the problems of uneconomical scale or low technical level are available. Next, the causes of these problems are analyzed. Then, the regression analysis is performed using Tobit with the influencing factors including GDP, the number of institutions engaged in elderly care, the number of day service centers in the communities, the number of medical service institutions for the elderly, and the density of the elderly population. Known as a city with a severely aging population, Shanghai will be selected for a case study to propose countermeasures from the three dimensions of the elderly group, the elderly care industry, and the market environment.
- Open Access
- 15 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-13
A Penalized h-Likelihood Variable Selection Algorithm for Generalized Linear Regression Models with Random Effects
Reinforcement learning is one of the paradigms and methodologies of machine learning developed in the computational intelligence community. Reinforcement learning algorithms present a major challenge in complex dynamics recently. In the perspective of variable selection, we often come across situations where too many variables are included in the full model at the initial stage of modeling. Due to a high-dimensional and intractable integral of longitudinal data, likelihood inference is computationally challenging. It can be computationally difficult such as very slow convergence or even nonconvergence, for the computationally intensive methods. Recently, hierarchical likelihood (h-likelihood) plays an important role in inferences for models having unobservable or unobserved random variables. This paper focuses linear models with random effects in the mean structure and proposes a penalized h-likelihood algorithm which incorporates variable selection procedures in the setting of mean modeling via h-likelihood. The penalized h-likelihood method avoids the messy integration for the random effects and is computationally efficient. Furthermore, it demonstrates good performance in relevant-variable selection. Throughout theoretical analysis and simulations, it is confirmed that the penalized h-likelihood algorithm produces good fixed effect estimation results and can identify zero regression coefficients in modeling the mean structure.
- 15 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-13
Open AccessA Penalized h-Likelihood Variable Selection Algorithm for Generalized Linear Regression Models with Random Effects
Reinforcement learning is one of the paradigms and methodologies of machine learning developed in the computational intelligence community. Reinforcement learning algorithms present a major challenge in complex dynamics recently. In the perspective of variable selection, we often come across situations where too many variables are included in the full model at the initial stage of modeling. Due to a high-dimensional and intractable integral of longitudinal data, likelihood inference is computationally challenging. It can be computationally difficult such as very slow convergence or even nonconvergence, for the computationally intensive methods. Recently, hierarchical likelihood (h-likelihood) plays an important role in inferences for models having unobservable or unobserved random variables. This paper focuses linear models with random effects in the mean structure and proposes a penalized h-likelihood algorithm which incorporates variable selection procedures in the setting of mean modeling via h-likelihood. The penalized h-likelihood method avoids the messy integration for the random effects and is computationally efficient. Furthermore, it demonstrates good performance in relevant-variable selection. Throughout theoretical analysis and simulations, it is confirmed that the penalized h-likelihood algorithm produces good fixed effect estimation results and can identify zero regression coefficients in modeling the mean structure.
- Open Access
- 8 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-6
Research on Sentiment Classification Algorithms on Online Review
The product online review text contains a large number of opinions and emotions. In order to identify the public’s emotional and tendentious information, we present reinforcement learning models in which sentiment classification algorithms of product online review corpus are discussed in this paper. In order to explore the classification effect of different sentiment classification algorithms, we conducted a research on Naive Bayesian algorithm, support vector machine algorithm, and neural network algorithm and carried out some comparison using a concrete example. The evaluation indexes and the three algorithms are compared in different lengths of sentence and word vector dimensions. The results present that neural network algorithm is effective in the sentiment classification of product online review corpus.
- 8 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-6
Open AccessResearch on Sentiment Classification Algorithms on Online Review
The product online review text contains a large number of opinions and emotions. In order to identify the public’s emotional and tendentious information, we present reinforcement learning models in which sentiment classification algorithms of product online review corpus are discussed in this paper. In order to explore the classification effect of different sentiment classification algorithms, we conducted a research on Naive Bayesian algorithm, support vector machine algorithm, and neural network algorithm and carried out some comparison using a concrete example. The evaluation indexes and the three algorithms are compared in different lengths of sentence and word vector dimensions. The results present that neural network algorithm is effective in the sentiment classification of product online review corpus.
- Open Access
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 129032-129042
An Improved Forward Regression Variable Selection Algorithm for High-Dimensional Linear Regression Models
Variable selection plays an important role in various fields, such as process modeling and process monitoring. It generally involves a large number of predictor variables, usually with the number of predictor variables $d$ much larger than the sample size $n$ . Therefore, how to filter useful variables and extract useful information in high-dimensional setup is a critical issue in the era of big data. This paper proposes an improved Forward Regression algorithm for variable selection under the high-dimensional setup. The proposed improved Forward Regression method demonstrates good performance in relevant-variable selection by introducing a predefined stopping rule. The stopping rule links the residual sum of squares to the noise ratio so that the relevant predictors can be distinguished from the random noises. Throughout theoretical analysis and simulations, it is confirmed that the improved Forward Regression algorithm can identify relevant predictors to ensure selection consistency in variable selection. Compared with the traditional Forward Regression method, the proposed Forward Regression algorithm can improve prediction accuracy and reduce computational cost by selecting only the relevant variables.
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 129032-129042
Open AccessAn Improved Forward Regression Variable Selection Algorithm for High-Dimensional Linear Regression Models
Variable selection plays an important role in various fields, such as process modeling and process monitoring. It generally involves a large number of predictor variables, usually with the number of predictor variables $d$ much larger than the sample size $n$ . Therefore, how to filter useful variables and extract useful information in high-dimensional setup is a critical issue in the era of big data. This paper proposes an improved Forward Regression algorithm for variable selection under the high-dimensional setup. The proposed improved Forward Regression method demonstrates good performance in relevant-variable selection by introducing a predefined stopping rule. The stopping rule links the residual sum of squares to the noise ratio so that the relevant predictors can be distinguished from the random noises. Throughout theoretical analysis and simulations, it is confirmed that the improved Forward Regression algorithm can identify relevant predictors to ensure selection consistency in variable selection. Compared with the traditional Forward Regression method, the proposed Forward Regression algorithm can improve prediction accuracy and reduce computational cost by selecting only the relevant variables.