Bangchao Deng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bangchao Deng has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Dingqi Yang
State Key Laboratory of Internet of Things for Smart City, Department of Computer and Information Science, University of Macau, Macau, China
6 shared publications - Bingqing Qu
BNU-HKBU United International College, Zhuhai, China
3 shared publications - Xin Jing
University of Macau, Macao SAR, China
3 shared publications - Philippe Cudré-Mauroux
Xascale Infolab, University of Fribourg, Fribourg, Switzerland
2 shared publications - Yuhuan Lu
Faculty of Applied Sciences Macao Polytechnic University Macao SAR China
2 shared publications - Benjamin Fankhauser
University of Bern
1 shared publication
Latest Publications
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 463-473
Marionette: Fine-Grained Conditional Generative Modeling of Spatiotemporal Human Trajectory Data Beyond Imitation
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 463-473
Open AccessMarionette: Fine-Grained Conditional Generative Modeling of Spatiotemporal Human Trajectory Data Beyond Imitation
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 201-212
Revisiting Synthetic Human Trajectories: Imitative Generation and Benchmarks Beyond Datasaurus
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 201-212
Open AccessRevisiting Synthetic Human Trajectories: Imitative Generation and Benchmarks Beyond Datasaurus
- 4 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (9) , 5436-5451
On Your Mark, Get Set, Predict! Modeling Continuous-Time Dynamics of Cascades for Information Popularity Prediction
Information popularity prediction is important yet challenging in various domains, including viral marketing and news recommendations. The key to accurately predicting information popularity lies in subtly modeling the underlying temporal information diffusion process behind observed events of an information cascade, such as the retweets of a tweet. To this end, most existing methods either adopt recurrent networks to capture the temporal dynamics from the first to the last observed event or develop a statistical model based on self-exciting point processes to make predictions. However, information diffusion is intrinsically a complex continuous-time process with irregularly observed discrete events, which is oversimplified using recurrent networks as they fail to capture the irregular time intervals between events, or using self-exciting point processes as they lack flexibility to capture the complex diffusion process. Against this background, we propose ConCat, modeling the Continuous-time dynamics of Cascades for information popularity prediction. On the one hand, it leverages neural Ordinary Differential Equations (ODEs) to model irregular events of a cascade in continuous time based on the cascade graph and sequential event information. On the other hand, it considers cascade events as neural temporal point processes (TPPs) parameterized by a conditional intensity function which can also benefit the popularity prediction task. We conduct extensive experiments to evaluate ConCat on three real-world datasets. Results show that ConCat achieves superior performance compared to state-of-the-art baselines, yielding 2.3%-33.2% improvement over the best-performing baselines across the three datasets.
- 4 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (9) , 5436-5451
On Your Mark, Get Set, Predict! Modeling Continuous-Time Dynamics of Cascades for Information Popularity Prediction
Information popularity prediction is important yet challenging in various domains, including viral marketing and news recommendations. The key to accurately predicting information popularity lies in subtly modeling the underlying temporal information diffusion process behind observed events of an information cascade, such as the retweets of a tweet. To this end, most existing methods either adopt recurrent networks to capture the temporal dynamics from the first to the last observed event or develop a statistical model based on self-exciting point processes to make predictions. However, information diffusion is intrinsically a complex continuous-time process with irregularly observed discrete events, which is oversimplified using recurrent networks as they fail to capture the irregular time intervals between events, or using self-exciting point processes as they lack flexibility to capture the complex diffusion process. Against this background, we propose ConCat, modeling the Continuous-time dynamics of Cascades for information popularity prediction. On the one hand, it leverages neural Ordinary Differential Equations (ODEs) to model irregular events of a cascade in continuous time based on the cascade graph and sequential event information. On the other hand, it considers cascade events as neural temporal point processes (TPPs) parameterized by a conditional intensity function which can also benefit the popularity prediction task. We conduct extensive experiments to evaluate ConCat on three real-world datasets. Results show that ConCat achieves superior performance compared to state-of-the-art baselines, yielding 2.3%-33.2% improvement over the best-performing baselines across the three datasets.
- Open Access
- 26 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4053-4064
HELIOS: Hyper-Relational Schema Modeling from Knowledge Graphs
- 26 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4053-4064
Open AccessHELIOS: Hyper-Relational Schema Modeling from Knowledge Graphs
- Open Access
- 30 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 14 (5) , 1-24
Robust Location Prediction over Sparse Spatiotemporal Trajectory Data: Flashback to the Right Moment!
As a fundamental problem in human mobility modeling, location prediction forecasts a user’s next location based on historical user mobility trajectories. Recurrent neural networks (RNNs) have been widely used to capture sequential patterns of user visited locations for solving location prediction problems. Due to the sparse nature of real-world user mobility trajectories, existing techniques strive to improve RNNs by incorporating spatiotemporal contexts into the recurrent hidden state passing process of RNNs using context-parameterized transition matrices or gates. However, such a scheme mismatches universal spatiotemporal mobility laws and thus cannot fully benefit from rich spatiotemporal contexts encoded in user mobility trajectories. Against this background, we propose Flashback++, a general RNN architecture designed for modeling sparse user mobility trajectories. It not only leverages rich spatiotemporal contexts to search past hidden states with high predictive power but also learns to optimally combine them via a hidden state re-weighting mechanism, which significantly improves the robustness of the models against different settings and datasets. Our extensive evaluation compares Flashback++ against a sizable collection of state-of-the-art techniques on two real-world location-based social networks datasets and one on-campus mobility dataset. Results show that Flashback++ not only consistently and significantly outperforms all baseline techniques by 20.56% to 44.36% but also achieves better robustness of location prediction performance against different model settings (different RNN architectures and numbers of hidden states to flash back), different levels of trajectory sparsity, and different train-testing splitting ratios than baselines, yielding an improvement of 31.05% to 94.60%.
- 30 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 14 (5) , 1-24
Open AccessRobust Location Prediction over Sparse Spatiotemporal Trajectory Data: Flashback to the Right Moment!
As a fundamental problem in human mobility modeling, location prediction forecasts a user’s next location based on historical user mobility trajectories. Recurrent neural networks (RNNs) have been widely used to capture sequential patterns of user visited locations for solving location prediction problems. Due to the sparse nature of real-world user mobility trajectories, existing techniques strive to improve RNNs by incorporating spatiotemporal contexts into the recurrent hidden state passing process of RNNs using context-parameterized transition matrices or gates. However, such a scheme mismatches universal spatiotemporal mobility laws and thus cannot fully benefit from rich spatiotemporal contexts encoded in user mobility trajectories. Against this background, we propose Flashback++, a general RNN architecture designed for modeling sparse user mobility trajectories. It not only leverages rich spatiotemporal contexts to search past hidden states with high predictive power but also learns to optimally combine them via a hidden state re-weighting mechanism, which significantly improves the robustness of the models against different settings and datasets. Our extensive evaluation compares Flashback++ against a sizable collection of state-of-the-art techniques on two real-world location-based social networks datasets and one on-campus mobility dataset. Results show that Flashback++ not only consistently and significantly outperforms all baseline techniques by 20.56% to 44.36% but also achieves better robustness of location prediction performance against different model settings (different RNN architectures and numbers of hidden states to flash back), different levels of trajectory sparsity, and different train-testing splitting ratios than baselines, yielding an improvement of 31.05% to 94.60%.
- 12 December 2022
- Published by Springer Nature in CCF Transactions on Pervasive Computing and Interaction
- Vol. 5 (1) , 31-44
CrowdTelescope: Wi-Fi-positioning-based multi-grained spatiotemporal crowd flow prediction for smart campus
Crowd flow prediction is one of the key problems in human mobility modeling, forecasting crowd flows of locations based on historical human mobility traces. Traditional human mobility traces (collected via telecommunication companies, online social media platforms, or field studies/experiments, etc.) suffer from severe data quality issues such as low precision, data sparsity, and insufficient coverage. In this paper, we investigate crowd flow prediction using Wi-Fi connection records on the campus of a university, which imply comprehensive, large-scale, high-coverage, and multi-grained (building/floor/room level) human mobility traces. However, we are facing not only non-trivial noises in the raw Wi-Fi connection data when extracting human mobility traces, but also the trade-off between location granularities and mobility patterns when modeling multi-grained crowd flow. Against this background, we propose CrowdTelescope, a Wi-Fi-positioning-based multi-grained spatiotemporal crowd flow prediction framework. We design a systematic approach for robust human mobility trace extraction from the noisy Wi-Fi connection records and adopt spatiotemporal Graph Neural Networks to model multi-grained crowd flow under a unified graph model for the three-level location hierarchy. We also develop a prototype system of CrowdTelescope, providing the interactive visualization of crowd flows on campus. We evaluate CrowdTelescope by collecting a Wi-Fi connection dataset on the campus of the University of Macau. Results show that CrowdTelescope can effectively extract informative human mobility traces from the noisy Wi-Fi connection records with an improvement of 3.3% over baselines, and also accurately predict on-campus crowd flow across different location granularities with 1.5%\(-\)24.1% improvements over baselines.- 12 December 2022
- Published by Springer Nature in CCF Transactions on Pervasive Computing and Interaction
- Vol. 5 (1) , 31-44
CrowdTelescope: Wi-Fi-positioning-based multi-grained spatiotemporal crowd flow prediction for smart campus
Crowd flow prediction is one of the key problems in human mobility modeling, forecasting crowd flows of locations based on historical human mobility traces. Traditional human mobility traces (collected via telecommunication companies, online social media platforms, or field studies/experiments, etc.) suffer from severe data quality issues such as low precision, data sparsity, and insufficient coverage. In this paper, we investigate crowd flow prediction using Wi-Fi connection records on the campus of a university, which imply comprehensive, large-scale, high-coverage, and multi-grained (building/floor/room level) human mobility traces. However, we are facing not only non-trivial noises in the raw Wi-Fi connection data when extracting human mobility traces, but also the trade-off between location granularities and mobility patterns when modeling multi-grained crowd flow. Against this background, we propose CrowdTelescope, a Wi-Fi-positioning-based multi-grained spatiotemporal crowd flow prediction framework. We design a systematic approach for robust human mobility trace extraction from the noisy Wi-Fi connection records and adopt spatiotemporal Graph Neural Networks to model multi-grained crowd flow under a unified graph model for the three-level location hierarchy. We also develop a prototype system of CrowdTelescope, providing the interactive visualization of crowd flows on campus. We evaluate CrowdTelescope by collecting a Wi-Fi connection dataset on the campus of the University of Macau. Results show that CrowdTelescope can effectively extract informative human mobility traces from the noisy Wi-Fi connection records with an improvement of 3.3% over baselines, and also accurately predict on-campus crowd flow across different location granularities with 1.5%\(-\)24.1% improvements over baselines.