Ying Li
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
Ying Li has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Jianbo Li
College of Computer Science and Technology, Qingdao University, Qingdao, China
4 shared publications Shiwei Yin
College of Computer Science and Technology, Qingdao University, Qingdao, China
3 shared publicationsYu Kong
College of Computer Science and Technology, Qingdao University, Qingdao, China
3 shared publicationsJianbo Li
Qingdao University
2 shared publicationsJiandong Wang
Qingdao University
2 shared publicationsYoucun Li
College of Computer Science and Technology, Qingdao University, Qingdao, China
2 shared publications
Latest Publications
- Open Access
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (17) , 36019-36033
Topological-Temporal Convolution Transformer Hawkes Process for Causal Structural Learning in Telecom Networks
Accurate causal discovery in telecommunication alarm event sequences is crucial for reliable root cause analysis, but presents significant challenges due to complex topological dependencies and inherent alarm redundancy. To address these challenges, we propose the topological-temporal convolution transformer Hawkes process (TTCTH), a novel framework for learning hidden causal relationships in alarm event sequences. To start with, a topological-temporal graph convolution is designed to initialize a causal graph for mainly exploring local dependencies among event types in the topological and temporal domains. We next design three separable transformer variants of topological transformer (TopoT), causal transformer and temporal transformer, which are sequentially stacked to globally capture causal dependencies among event types. In particular, the TopoT fuses prior topological information into alarm sequence representation. The causal transformer models causal dependencies with self-attention mechanism to capture spatially causal relations among event types. The temporal transformer is developed to model long-range causal dependencies across multiple events. We then leverage the high-dimensional hidden state representation, encoded by the stacked transformers, to construct feature evolution with the constraint-based Hawkes process. In order to observe the performance of TTCTH, we conduct extensive experiments on real-world alarm datasets. It demonstrates TTCTH’s excellence in comparison with ten baselines.
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (17) , 36019-36033
Open AccessTopological-Temporal Convolution Transformer Hawkes Process for Causal Structural Learning in Telecom Networks
Accurate causal discovery in telecommunication alarm event sequences is crucial for reliable root cause analysis, but presents significant challenges due to complex topological dependencies and inherent alarm redundancy. To address these challenges, we propose the topological-temporal convolution transformer Hawkes process (TTCTH), a novel framework for learning hidden causal relationships in alarm event sequences. To start with, a topological-temporal graph convolution is designed to initialize a causal graph for mainly exploring local dependencies among event types in the topological and temporal domains. We next design three separable transformer variants of topological transformer (TopoT), causal transformer and temporal transformer, which are sequentially stacked to globally capture causal dependencies among event types. In particular, the TopoT fuses prior topological information into alarm sequence representation. The causal transformer models causal dependencies with self-attention mechanism to capture spatially causal relations among event types. The temporal transformer is developed to model long-range causal dependencies across multiple events. We then leverage the high-dimensional hidden state representation, encoded by the stacked transformers, to construct feature evolution with the constraint-based Hawkes process. In order to observe the performance of TTCTH, we conduct extensive experiments on real-world alarm datasets. It demonstrates TTCTH’s excellence in comparison with ten baselines.
- 13 November 2024
- Published by Springer Nature
- p. 93-101
Graph Transformer Hawkes Processes for Causal Structure Learning in Telecom Networks
- 13 November 2024
- Published by Springer Nature
- p. 93-101
Graph Transformer Hawkes Processes for Causal Structure Learning in Telecom Networks
- 1 March 2024
- Published by Springer Nature
- p. 189-201
Edge Computing Task Unloading Decision Optimization Algorithm Based on Deep Reinforcement Learning
- 1 March 2024
- Published by Springer Nature
- p. 189-201
Edge Computing Task Unloading Decision Optimization Algorithm Based on Deep Reinforcement Learning
- Open Access
- 27 March 2023
- Published by MDPI AG in Information
- Vol. 14 (4) , 206
Resource Allocation in Decentralized Vehicular Edge Computing Network
Computation-intensive vehicle tasks sharply increase with the rapid growth of intelligent vehicles. The technology of Mobile Edge Computing (MEC) has the possibility of assisting vehicles with computation offloading. To solve the problem of computation resource management and guarantee the security of resource transaction, we jointly combine the MEC network and the blockchain networks to build a blockchain based MEC offloading model. The non-cooperative interactions between MEC server and vehicles formulate a two-stage Stackelberg game in an aim to maximize their benefits and information security. We theoretically demonstrate the unique existence of Nash equilibrium, which enables participants to decide their optimal strategies. Finally, the performance of the proposed model is analyzed by conducting simulation experiments. Our proposed model optimizes resource allocation and also improves the security of the whole network.
- 27 March 2023
- Published by MDPI AG in Information
- Vol. 14 (4) , 206
Open AccessResource Allocation in Decentralized Vehicular Edge Computing Network
Computation-intensive vehicle tasks sharply increase with the rapid growth of intelligent vehicles. The technology of Mobile Edge Computing (MEC) has the possibility of assisting vehicles with computation offloading. To solve the problem of computation resource management and guarantee the security of resource transaction, we jointly combine the MEC network and the blockchain networks to build a blockchain based MEC offloading model. The non-cooperative interactions between MEC server and vehicles formulate a two-stage Stackelberg game in an aim to maximize their benefits and information security. We theoretically demonstrate the unique existence of Nash equilibrium, which enables participants to decide their optimal strategies. Finally, the performance of the proposed model is analyzed by conducting simulation experiments. Our proposed model optimizes resource allocation and also improves the security of the whole network.
- 4 January 2023
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 16 (2) , 709-726
Piece-wise pricing optimization with computation resource constraints for parked vehicle edge computing
- 4 January 2023
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 16 (2) , 709-726
Piece-wise pricing optimization with computation resource constraints for parked vehicle edge computing
- 17 November 2022
- Published by Springer Nature
- p. 629-637
Incentive Offloading with Communication and Computation Capacity Concerns for Vehicle Edge Computing
- 17 November 2022
- Published by Springer Nature
- p. 629-637
Incentive Offloading with Communication and Computation Capacity Concerns for Vehicle Edge Computing
- Open Access
- 23 September 2022
- Published by Association for Computing Machinery (ACM)
- p. 320-326
STNCN: A New Method for Traffic Flow Prediction Based on the Node Correlation
The prediction of traffic conditions plays a significant role in the intelligent transportation system. Since the traffic flow is able to directly reflect traffic situation, it is of great value to predict the traffic flow in reality. The traffic flow data has complex spatiotemporal characteristics. Meanwhile, a high node correlation between nodes in the traffic network. Therefore, the key point of accurate traffic flow prediction is to analyze the temporal and spatial correlation in the data, as well as integrate the node correlation. We are motivated to propose a spatial-temporal node correlation network (STNCN) for improving traffic flow prediction accuracy. First, a node correlation matrix is constructed to describe the pairwise correlation between nodes. We then propose a recurrent graph network to analyze node correlation and spatial correlation of traffic flow data. Lastly, a temporal convolutional network is applied to extract temporal features. We combine the outputs of the temporal convolutional networks of different periods into the fully connected layer to obtain final prediction results. The prediction results on real datasets demonstrate the effectiveness of the proposed method.
- 23 September 2022
- Published by Association for Computing Machinery (ACM)
- p. 320-326
Open AccessSTNCN: A New Method for Traffic Flow Prediction Based on the Node Correlation
The prediction of traffic conditions plays a significant role in the intelligent transportation system. Since the traffic flow is able to directly reflect traffic situation, it is of great value to predict the traffic flow in reality. The traffic flow data has complex spatiotemporal characteristics. Meanwhile, a high node correlation between nodes in the traffic network. Therefore, the key point of accurate traffic flow prediction is to analyze the temporal and spatial correlation in the data, as well as integrate the node correlation. We are motivated to propose a spatial-temporal node correlation network (STNCN) for improving traffic flow prediction accuracy. First, a node correlation matrix is constructed to describe the pairwise correlation between nodes. We then propose a recurrent graph network to analyze node correlation and spatial correlation of traffic flow data. Lastly, a temporal convolutional network is applied to extract temporal features. We combine the outputs of the temporal convolutional networks of different periods into the fully connected layer to obtain final prediction results. The prediction results on real datasets demonstrate the effectiveness of the proposed method.
- 1 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Human-Machine Systems
- Vol. 53 (1) , 228-238
Predicting Activities of Daily Living for the Coming Time Period in Smart Homes
Activity prediction aims to predict what activities will occur in the future. In smart homes, to facilitate the daily living of the residents, automated or assistive services are provided. To provide these services, the ability of activity prediction is necessary. When we make a prediction, most of the existing works focus on predicting information about the next activity. However, in a smart home environment, compared with just predicting information about the next activity, another type of activity prediction problem has more practical value: predicting what activities will occur in the coming time period of a certain length. The necessity of this type of prediction is due to the purpose of the smart homes and the character of the activities. Many activities in smart homes need preparation time before being performed. Through this type of prediction, activities could be predicted sufficient time before being performed, and there will be adequate time for the smart home system to prepare corresponding automated or assistive services. As more than one activity could occur within the time period in which the prediction is made, this problem is a multilabel classification problem. In this article, we first give a formulation of the problem. Then, we propose a deep learning model to address it. The proposed model consists of the convolutional part, the long short-term memory layer, and the multilabel output layer. Experiments on real-world datasets show the effectiveness of our model.
- 1 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Human-Machine Systems
- Vol. 53 (1) , 228-238
Predicting Activities of Daily Living for the Coming Time Period in Smart Homes
Activity prediction aims to predict what activities will occur in the future. In smart homes, to facilitate the daily living of the residents, automated or assistive services are provided. To provide these services, the ability of activity prediction is necessary. When we make a prediction, most of the existing works focus on predicting information about the next activity. However, in a smart home environment, compared with just predicting information about the next activity, another type of activity prediction problem has more practical value: predicting what activities will occur in the coming time period of a certain length. The necessity of this type of prediction is due to the purpose of the smart homes and the character of the activities. Many activities in smart homes need preparation time before being performed. Through this type of prediction, activities could be predicted sufficient time before being performed, and there will be adequate time for the smart home system to prepare corresponding automated or assistive services. As more than one activity could occur within the time period in which the prediction is made, this problem is a multilabel classification problem. In this article, we first give a formulation of the problem. Then, we propose a deep learning model to address it. The proposed model consists of the convolutional part, the long short-term memory layer, and the multilabel output layer. Experiments on real-world datasets show the effectiveness of our model.
- Open Access
- 14 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 11979-11993
Resource Competition in Blockchain Networks Under Cloud and Device Enabled Participation
Blockchain technology is a promising resource management architecture due to its ability of building trust in a decentralized transaction. Block mining participants, i.e. miners, are incentivized with reward for successfully mining blocks. Unfortunately, solving the proof-of-work puzzle consumes substantial computing powers during the mining period, which greatly challenges miners. Mobile devices also fail to participate in mining because of limited resource. To solve these issues, we are motivated to propose a mining framework of alleviating miner’s computation-intensive mining burdens, as well as enabling mobile devices’ participation. Depending on the proposed model, miners are capable of offloading their computation-intensive tasks to the edge cloud and mobile devices. The interactions among them formulate a muti-leader multi-follower Stackelberg game. We achieve the Subgame Perfect Equilibrium (SPE) in the game, which guarantees three types of participants to realize profit maximization. Simulation results demonstrate the effectiveness of the proposed model.
- 14 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 11979-11993
Open AccessResource Competition in Blockchain Networks Under Cloud and Device Enabled Participation
Blockchain technology is a promising resource management architecture due to its ability of building trust in a decentralized transaction. Block mining participants, i.e. miners, are incentivized with reward for successfully mining blocks. Unfortunately, solving the proof-of-work puzzle consumes substantial computing powers during the mining period, which greatly challenges miners. Mobile devices also fail to participate in mining because of limited resource. To solve these issues, we are motivated to propose a mining framework of alleviating miner’s computation-intensive mining burdens, as well as enabling mobile devices’ participation. Depending on the proposed model, miners are capable of offloading their computation-intensive tasks to the edge cloud and mobile devices. The interactions among them formulate a muti-leader multi-follower Stackelberg game. We achieve the Subgame Perfect Equilibrium (SPE) in the game, which guarantees three types of participants to realize profit maximization. Simulation results demonstrate the effectiveness of the proposed model.
- 9 September 2021
- Published by Springer Nature
- p. 218-225
Incentive Cooperation with Computation Delay Concerns for Socially-Aware Parked Vehicle Edge Computing
- 9 September 2021
- Published by Springer Nature
- p. 218-225
Incentive Cooperation with Computation Delay Concerns for Socially-Aware Parked Vehicle Edge Computing