Fei Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fei Yang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Huyin Zhang
School of Computer Science, Wuhan University, Wuhan, China
9 shared publications - Shiming Tao
School of Computer Science, Wuhan University, Wuhan, China
8 shared publications - Cong Li
School of Computer Science, Wuhan University, Wuhan, China
3 shared publications - Yonghao Wu
School of Computer Science, Wuhan University, Wuhan, China
3 shared publications Huyin Zhang
2 shared publications- Xiying Fan
University of Science and Technology Beijing
2 shared publications
Latest Publications
- Open Access
- 1 April 2024
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 10 (2) , 481-497
A CSMA/CA based MAC protocol for hybrid Power-line/Visible-light communication networks: Design and analysis
- 1 April 2024
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 10 (2) , 481-497
Open AccessA CSMA/CA based MAC protocol for hybrid Power-line/Visible-light communication networks: Design and analysis
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5655-5660
Industrial Process Soft Sensing Based on Random Forest-Optimized Mallow's Cp Variable Selection
Soft sensing has been extensively used in industrial processes to predict key quality variables. To establish an accurate sensor model, it is important to select appropriate auxiliary variables. In this paper, Random Forest optimized Mallow's Cp variable selection scheme is proposed for accurate soft sensing. Firstly, the method employs the Random Forest algorithm to rank the importance of variables. Then, it gradually selects variable subsets and calculates the Cp value for each subset to determine the optimal subset. Once the optimal subset is confirmed, we utilize it to train a Support Vector Regression model and evaluate the model's performance. The method considers both individual and combinations of multiple auxiliary variables on the target variable, which can address the problem of excessive auxiliary variables and redundant data in industrial production processes and reduce computation complexity. Finally, the penicillin fermentation process verifies the performance of the proposed method.
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5655-5660
Industrial Process Soft Sensing Based on Random Forest-Optimized Mallow's Cp Variable Selection
Soft sensing has been extensively used in industrial processes to predict key quality variables. To establish an accurate sensor model, it is important to select appropriate auxiliary variables. In this paper, Random Forest optimized Mallow's Cp variable selection scheme is proposed for accurate soft sensing. Firstly, the method employs the Random Forest algorithm to rank the importance of variables. Then, it gradually selects variable subsets and calculates the Cp value for each subset to determine the optimal subset. Once the optimal subset is confirmed, we utilize it to train a Support Vector Regression model and evaluate the model's performance. The method considers both individual and combinations of multiple auxiliary variables on the target variable, which can address the problem of excessive auxiliary variables and redundant data in industrial production processes and reduce computation complexity. Finally, the penicillin fermentation process verifies the performance of the proposed method.
- 29 September 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (4) , 5509-5539
Simple hierarchical PageRank graph neural networks
- 29 September 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (4) , 5509-5539
Simple hierarchical PageRank graph neural networks
- Open Access
- 7 March 2023
- Published by Springer Nature in Research Square
Simple Hierarchical PageRank Graph Neural Networks
Graph neural networks (GNNs) have many variants for graph representation learning. Several works introduce PageRank into GNNs to improve its neighborhood aggregation capabilities. However, these methods leverage the general PageRank to perform complex neighborhood aggregation to obtain the final feature representation, which leads to high computational cost and oversmoothing. In this paper, we propose simple hierarchical PageRank graph neural networks (SHP-GNNs), which first utilize the simple PageRank to aggregate different neighborhood ranges of each node, and then leverage a jumping architecture to combine these aggregated features to enable hierarchical structure-aware representation. In this case, first, the simple PageRank turns the neighborhood aggregation process to no-learning, thereby reducing the computational complexity of the model. Then, the jumping structure combines the aggregation features of each node's different hierarchy (neighborhood range) to learn more informative feature representation. Finally, the successful combination of the above methods alleviate the oversmoothing problem of deep GNNs. Our experimental evaluation demonstrates that SHP-GNNs achieve or match state-of-the-art results in node classification tasks, text classification tasks, and community prediction tasks. Moreover, since SHP-GNNs' neighborhood aggregation is a no-learning process, SHP-GNNs are successfully extended to node clustering tasks.
- 7 March 2023
- Published by Springer Nature in Research Square
Open AccessSimple Hierarchical PageRank Graph Neural Networks
Graph neural networks (GNNs) have many variants for graph representation learning. Several works introduce PageRank into GNNs to improve its neighborhood aggregation capabilities. However, these methods leverage the general PageRank to perform complex neighborhood aggregation to obtain the final feature representation, which leads to high computational cost and oversmoothing. In this paper, we propose simple hierarchical PageRank graph neural networks (SHP-GNNs), which first utilize the simple PageRank to aggregate different neighborhood ranges of each node, and then leverage a jumping architecture to combine these aggregated features to enable hierarchical structure-aware representation. In this case, first, the simple PageRank turns the neighborhood aggregation process to no-learning, thereby reducing the computational complexity of the model. Then, the jumping structure combines the aggregation features of each node's different hierarchy (neighborhood range) to learn more informative feature representation. Finally, the successful combination of the above methods alleviate the oversmoothing problem of deep GNNs. Our experimental evaluation demonstrates that SHP-GNNs achieve or match state-of-the-art results in node classification tasks, text classification tasks, and community prediction tasks. Moreover, since SHP-GNNs' neighborhood aggregation is a no-learning process, SHP-GNNs are successfully extended to node clustering tasks.
- 7 February 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 136
Multiple Information Spatial–Temporal Attention based Graph Convolution Network for traffic prediction
- 7 February 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 136
Multiple Information Spatial–Temporal Attention based Graph Convolution Network for traffic prediction
- 3 August 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (8) , 8879-8897
Urban ride-hailing demand prediction with multi-view information fusion deep learning framework
- 3 August 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (8) , 8879-8897
Urban ride-hailing demand prediction with multi-view information fusion deep learning framework
- 25 February 2022
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 13 (8) , 2239-2255
Hybrid deep graph convolutional networks
- 25 February 2022
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 13 (8) , 2239-2255
Hybrid deep graph convolutional networks
- 24 January 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (10) , 11324-11342
Graph representation learning via simple jumping knowledge networks
- 24 January 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (10) , 11324-11342
Graph representation learning via simple jumping knowledge networks
- 10 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (6) , 8531-8559
MVDLSTM: MultiView deep LSTM framework for online ride-hailing order prediction
- 10 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (6) , 8531-8559
MVDLSTM: MultiView deep LSTM framework for online ride-hailing order prediction
- Open Access
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Multigraph Aggregation Spatiotemporal Graph Convolution Network for Ride‐Hailing Pick‐Up Region Prediction
The prediction of pick‐up regions for online ride‐hailing can reduce the number of vacant vehicles on the streets, which will optimize the transportation efficiency of cities, reduce energy consumption and carbon emissions, and increase the income of online ride‐hailing drivers. However, traditional studies have ignored the temporal and spatial dependencies among pick‐up regions and the effects of similarity of POI attributes in different regions in modelling, making the features of the model incomplete. To address the above problems, we propose a new multigraph aggregation spatiotemporal graph convolutional network (MAST‐GCN) model to predict pick‐up regions for online ride‐hailing. In this paper, we propose a graph aggregation method to extract the spatiotemporal aspects and preference features of spatial graphs, order graphs, and POI graphs. GCN is used on the aggregated graphs to extract spatial dimensional features from graph‐structured data. The historical data are sequentially divided into temporal granularity according to the period, and convolution operations are performed on the time axis to obtain the features in the temporal dimension. The attention mechanism is used to assign different weights to features with strong periodicity and strong correlation, which effectively solves the pick‐up region prediction problem. We implemented the MAST‐GCN model based on the PyTorch framework, stacked with a two‐layer spatiotemporal graph convolution module, where the dimension of the graph convolution is 64. We evaluate the proposed model on two real‐world large scale ride‐hailing datasets. The results show that our method provides significant improvements over state‐of‐the‐art baselines.
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Open AccessMultigraph Aggregation Spatiotemporal Graph Convolution Network for Ride‐Hailing Pick‐Up Region Prediction
The prediction of pick‐up regions for online ride‐hailing can reduce the number of vacant vehicles on the streets, which will optimize the transportation efficiency of cities, reduce energy consumption and carbon emissions, and increase the income of online ride‐hailing drivers. However, traditional studies have ignored the temporal and spatial dependencies among pick‐up regions and the effects of similarity of POI attributes in different regions in modelling, making the features of the model incomplete. To address the above problems, we propose a new multigraph aggregation spatiotemporal graph convolutional network (MAST‐GCN) model to predict pick‐up regions for online ride‐hailing. In this paper, we propose a graph aggregation method to extract the spatiotemporal aspects and preference features of spatial graphs, order graphs, and POI graphs. GCN is used on the aggregated graphs to extract spatial dimensional features from graph‐structured data. The historical data are sequentially divided into temporal granularity according to the period, and convolution operations are performed on the time axis to obtain the features in the temporal dimension. The attention mechanism is used to assign different weights to features with strong periodicity and strong correlation, which effectively solves the pick‐up region prediction problem. We implemented the MAST‐GCN model based on the PyTorch framework, stacked with a two‐layer spatiotemporal graph convolution module, where the dimension of the graph convolution is 64. We evaluate the proposed model on two real‐world large scale ride‐hailing datasets. The results show that our method provides significant improvements over state‐of‐the‐art baselines.