Ting Guo
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
Ting Guo has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Boyu Li
University of Technology Sydney
7 shared publications - Fang Chen
University of Technology Sydney, Sydney, Australia
5 shared publications - Yang Wang
University of Technology Sydney
5 shared publications - Amir Hossein Gandomi
Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, Australia
3 shared publications Fang Chen
2 shared publications- Kaveesha Hewage2 shared publications
Latest Publications
- Open Access
- 8 April 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 176
Learning unified market interdependencies via networked attention for stock price forecasting
- 8 April 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 176
Open AccessLearning unified market interdependencies via networked attention for stock price forecasting
- Open Access
- 1 October 2025
- Published by Elsevier in Finance Research Letters
- Vol. 86
Shadow trading detection: A graph-based surveillance approach
- 1 October 2025
- Published by Elsevier in Finance Research Letters
- Vol. 86
Open AccessShadow trading detection: A graph-based surveillance approach
- Open Access
- 8 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 42 (2) , 1-26
Spatio-temporal Contrastive Learning-enhanced GNNs for Session-based Recommendation
Session-based recommendation (SBR) systems aim to utilize the user’s short-term behavior sequence to predict the next item without the detailed user profile.Most recent works try to model the user preference by treating the sessions as between-item transition graphs and utilize various graph neural networks (GNNs) to encode the representations of pair-wise relations among items and their neighbors. Some of the existing GNN-based models mainly focus on aggregating information from the view of spatial graph structure, which ignores the temporal relations within neighbors of an item during message passing and the information loss results in a sub-optimal problem. Other works embrace this challenge by incorporating additional temporal information but lack sufficient interaction between the spatial and temporal patterns. To address this issue, inspired by the uniformity and alignment properties of contrastive learning techniques, we propose a novel framework called Session-based Recommendation with Spatio-temporal Contrastive Learning-enhanced GNNs (RESTC). The idea is to supplement the GNN-based main supervised recommendation task with the temporal representation via an auxiliary cross-view contrastive learning mechanism. Furthermore, a novel global collaborative filtering graph embedding is leveraged to enhance the spatial view in the main task.Extensive experiments demonstrate the significant performance of RESTC compared with the state-of-the-art baselines. We release our source code athttps://github.com/SUSTechBruce/RESTC-Source-code.
- 8 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 42 (2) , 1-26
Open AccessSpatio-temporal Contrastive Learning-enhanced GNNs for Session-based Recommendation
Session-based recommendation (SBR) systems aim to utilize the user’s short-term behavior sequence to predict the next item without the detailed user profile.Most recent works try to model the user preference by treating the sessions as between-item transition graphs and utilize various graph neural networks (GNNs) to encode the representations of pair-wise relations among items and their neighbors. Some of the existing GNN-based models mainly focus on aggregating information from the view of spatial graph structure, which ignores the temporal relations within neighbors of an item during message passing and the information loss results in a sub-optimal problem. Other works embrace this challenge by incorporating additional temporal information but lack sufficient interaction between the spatial and temporal patterns. To address this issue, inspired by the uniformity and alignment properties of contrastive learning techniques, we propose a novel framework called Session-based Recommendation with Spatio-temporal Contrastive Learning-enhanced GNNs (RESTC). The idea is to supplement the GNN-based main supervised recommendation task with the temporal representation via an auxiliary cross-view contrastive learning mechanism. Furthermore, a novel global collaborative filtering graph embedding is leveraged to enhance the spatial view in the main task.Extensive experiments demonstrate the significant performance of RESTC compared with the state-of-the-art baselines. We release our source code athttps://github.com/SUSTechBruce/RESTC-Source-code.
- 18 September 2023
- Published by Springer Nature
- p. 369-386
ConGCN: Factorized Graph Convolutional Networks for Consensus Recommendation
- 18 September 2023
- Published by Springer Nature
- p. 369-386
ConGCN: Factorized Graph Convolutional Networks for Consensus Recommendation
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (16) , 14182-14196
Self-Adaptive Predictive Passenger Flow Modeling for Large-Scale Railway Systems
Intelligent transportation system (ITS) is a crucial symbol of smart cities, which aims to provide sustainable and efficient services to residents. Playing a vital role in ITS, railway systems have been integrating with multiple Internet of Things (IoT) devices to monitor real-time inbound passenger flows to ensure pedestrian safety. But it remains difficult to consolidate real-time information from different IoT sources and accurately estimate the future flow due to the coarse-grained data, potential impacts of dynamic interchanged passengers, and real-time predictive capability, which have greatly hindered the progress of ITS transformation in smart cities. To tackle these challenges, we propose a two-stage self-adaptive model for accurately and timely predicting passenger flow in metropolitan railway systems. In the first stage, a self-attention-based prediction model is introduced to predict the next-day passenger flow based on the historical boarding records captured by IoT devices. The proposed decomposing components transferring the discrete boarding records into continuous patterns enable the module to deliver a robust minute-level prediction. In the second stage, a real-time fine-tuning model is developed to adjust the predicted passenger flow based on real-time emergencies and short-term changes in passenger flows from IoT devices. The combination of an offline deep learning mechanism and a real-time reallocation algorithm ensures the real-time response without loss of accuracy. Our end-to-end framework has been deployed to the railway system in Greater Sydney Area, Australia, which can offer accurate predictions to trip planners for timetable design and provide timely decision support for controllers when emergencies happen.
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (16) , 14182-14196
Self-Adaptive Predictive Passenger Flow Modeling for Large-Scale Railway Systems
Intelligent transportation system (ITS) is a crucial symbol of smart cities, which aims to provide sustainable and efficient services to residents. Playing a vital role in ITS, railway systems have been integrating with multiple Internet of Things (IoT) devices to monitor real-time inbound passenger flows to ensure pedestrian safety. But it remains difficult to consolidate real-time information from different IoT sources and accurately estimate the future flow due to the coarse-grained data, potential impacts of dynamic interchanged passengers, and real-time predictive capability, which have greatly hindered the progress of ITS transformation in smart cities. To tackle these challenges, we propose a two-stage self-adaptive model for accurately and timely predicting passenger flow in metropolitan railway systems. In the first stage, a self-attention-based prediction model is introduced to predict the next-day passenger flow based on the historical boarding records captured by IoT devices. The proposed decomposing components transferring the discrete boarding records into continuous patterns enable the module to deliver a robust minute-level prediction. In the second stage, a real-time fine-tuning model is developed to adjust the predicted passenger flow based on real-time emergencies and short-term changes in passenger flows from IoT devices. The combination of an offline deep learning mechanism and a real-time reallocation algorithm ensures the real-time response without loss of accuracy. Our end-to-end framework has been deployed to the railway system in Greater Sydney Area, Australia, which can offer accurate predictions to trip planners for timetable design and provide timely decision support for controllers when emergencies happen.
- Open Access
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 589-597
SGCCL: Siamese Graph Contrastive Consensus Learning for Personalized Recommendation
Contrastive-learning-based neural networks have recently been introduced to recommender systems, due to their unique advantage of injecting collaborative signals to model deep representations, and the self-supervision nature in the learning process. Existing contrastive learning methods for recommendations are mainly proposed through introducing augmentations to the user-item (U-I) bipartite graphs. Such a contrastive learning process, however, is susceptible to bias towards popular items and users, because higher-degree users/items are subject to more augmentations and their correlations are more captured. In this paper, we advocate a Siamese Graph Contrastive Consensus Learning (SGCCL) framework, to explore intrinsic correlations and alleviate the bias effects for personalized recommendation. Instead of augmenting original U-I networks, we introduce siamese graphs, which are homogeneous relations of user-user (U-U) similarity and item-item (I-I) correlations. A contrastive consensus optimization process is also adopted to learn effective features for user-item ratings, user-user similarity, and item-item correlation. Finally, we employ the self-supervised learning coupled with the siamese item-item/user-user graph relationships, which ensures unpopular users/items are well preserved in the embedding space. Different from existing studies, SGCCL performs well on both overall and debiasing recommendation tasks resulting in a balanced recommender. Experiments on four benchmark datasets demonstrate that SGCCL outperforms state-of-the-art methods with higher accuracy and greater long-tail item/user exposure.
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 589-597
Open AccessSGCCL: Siamese Graph Contrastive Consensus Learning for Personalized Recommendation
Contrastive-learning-based neural networks have recently been introduced to recommender systems, due to their unique advantage of injecting collaborative signals to model deep representations, and the self-supervision nature in the learning process. Existing contrastive learning methods for recommendations are mainly proposed through introducing augmentations to the user-item (U-I) bipartite graphs. Such a contrastive learning process, however, is susceptible to bias towards popular items and users, because higher-degree users/items are subject to more augmentations and their correlations are more captured. In this paper, we advocate a Siamese Graph Contrastive Consensus Learning (SGCCL) framework, to explore intrinsic correlations and alleviate the bias effects for personalized recommendation. Instead of augmenting original U-I networks, we introduce siamese graphs, which are homogeneous relations of user-user (U-U) similarity and item-item (I-I) correlations. A contrastive consensus optimization process is also adopted to learn effective features for user-item ratings, user-user similarity, and item-item correlation. Finally, we employ the self-supervised learning coupled with the siamese item-item/user-user graph relationships, which ensures unpopular users/items are well preserved in the embedding space. Different from existing studies, SGCCL performs well on both overall and debiasing recommendation tasks resulting in a balanced recommender. Experiments on four benchmark datasets demonstrate that SGCCL outperforms state-of-the-art methods with higher accuracy and greater long-tail item/user exposure.
- 10 May 2022
- Published by Springer Nature
- p. 147-160
A Two-Stage Self-adaptive Model for Passenger Flow Prediction on Schedule-Based Railway System
- 10 May 2022
- Published by Springer Nature
- p. 147-160
A Two-Stage Self-adaptive Model for Passenger Flow Prediction on Schedule-Based Railway System
- 9 May 2021
- Published by Springer Nature
- p. 263-276
Adaptive Graph Co-Attention Networks for Traffic Forecasting
- 9 May 2021
- Published by Springer Nature
- p. 263-276
Adaptive Graph Co-Attention Networks for Traffic Forecasting
- Open Access
- 23 April 2019
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 11 (4)
Robust point cloud normal estimation via neighborhood reconstruction
This article presents a novel method for estimating normals on unorganized point clouds that preserves sharp features. Many existing methods are unable to reliably estimate normals for points around sharp features since the neighborhood employed for the normal estimation would enclose points belonging to different surface patches across the sharp feature. To address this challenging issue, a neighborhood reconstruction-based normal estimation method is developed to find a proper neighborhood for points around sharp features. A robust statistics-based method is proposed to identify points that near sharp features and classify the points into two categories: edge points and non-edge points. Two specific neighborhood reconstruction strategies are designed for these two types of points to generate a neighborhood clear of sharp features. The normal of the current point can thus be reliably estimated by principal component analysis using the generated isotropic neighborhood. Numerous case studies have been carried out to compare the reliability and robustness of the proposed method against various existing methods. The experiment results show that the proposed approach performs better than the state-of-the-art methods most of the time and offers an ideal compromise between precision, speed, and robustness.
- 23 April 2019
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 11 (4)
Open AccessRobust point cloud normal estimation via neighborhood reconstruction
This article presents a novel method for estimating normals on unorganized point clouds that preserves sharp features. Many existing methods are unable to reliably estimate normals for points around sharp features since the neighborhood employed for the normal estimation would enclose points belonging to different surface patches across the sharp feature. To address this challenging issue, a neighborhood reconstruction-based normal estimation method is developed to find a proper neighborhood for points around sharp features. A robust statistics-based method is proposed to identify points that near sharp features and classify the points into two categories: edge points and non-edge points. Two specific neighborhood reconstruction strategies are designed for these two types of points to generate a neighborhood clear of sharp features. The normal of the current point can thus be reliably estimated by principal component analysis using the generated isotropic neighborhood. Numerous case studies have been carried out to compare the reliability and robustness of the proposed method against various existing methods. The experiment results show that the proposed approach performs better than the state-of-the-art methods most of the time and offers an ideal compromise between precision, speed, and robustness.
- Open Access
- 22 April 2018
- Published by Atlantis Press SARL
Teeth Category Classification via Hu Moment Invariant and Extreme Learning Machine
- 22 April 2018
- Published by Atlantis Press SARL
Open AccessTeeth Category Classification via Hu Moment Invariant and Extreme Learning Machine