Ting Guo

Dr. Ting Guo


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 May 2022 in Pattern Recognition Letters
Verified
Journal Article
Closed access
TGTing Guo
Ting Guo
JLJianqing Liang
Jianqing Liang
JLJiye Liang
Jiye Liang
GXGuo-Sen Xie
Guo-Sen Xie

19 August 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Guosen XieGuosen Xie
Guosen Xie
JLJunyi Li
Junyi Li
TGTing Guo
Ting Guo
Xiangbo ShuXiangbo Shu
Xiangbo Shu
FZFang Zhao
Fang Zhao
LSLing Shao
Ling Shao
In the vanilla zero-shot learning (ZSL) paradigm, category attributes is the key for knowledge generalizable transfer from seen to unseen classes. By contrast, the current contrastive language-image pretraining (CLIP) model relies on the category names to achieve a more general ZSL-like prediction. When vanilla ZSL meets general CLIP, however, most existing methods on both sides struggle to benefit from each other. In this brief, we resort to attribute prompt tuning (APT) for improving the knowledge transferability from the pretrained CLIP model to the downstream ZSL framework for pursuing desirable feature representations. Our approach, termed as attribute prompt alignment network (APAN), leverages APT for cross-network feature alignment (CFA). In this way, we can investigate the effects of CLIP to vanilla ZSL task in the era of large model by the two branch APAN architecture. Specifically, APT takes as an input the templates of class attribute descriptions to produce attribute prompts, which are further used to both guide the localizations of visual regions across two frozen feature extraction networks, through a visual-semantic interaction attention. This enables APAN to progressively refine and align these cross-network features, thus resulting in generalizable feature representations that can capture fine-grained attribute information. For CFA, we simply introduce prediction alignment loss that constrains the predictions from these two cross-network visual features. Experimental results on three benchmark datasets well demonstrate that APAN outperforms the state-of-the-art methods by absorbing generalizable knowledge from CLIP models.

12 April 2026
Verified
Conference Paper
Open access
TGTing Guo
Ting Guo
DPDongyu Pei
Dongyu Pei
GQGangzhu Qiao
Gangzhu Qiao
KYKaixuan Yao
Kaixuan Yao
DWDa Wang
Da Wang
Semi-supervised graph anomaly detection confronts the fundamental challenge of identifying anomalous nodes that exhibit deviations from normal graph patterns in node attributes or structure connectivity, using a small set of labeled normal nodes. Existing methods fall short in modeling the spectrum of anomaly severity, as they generate anomalies in a single, undifferentiated step. This oversight restricts the detection of complex anomalies. In this paper, we propose a progressive anomaly generation network (PAGE) to overcome this limitation. PAGE enhances complex anomaly detection through progressive attribute-structure perturbation: It first injects attribute noise into selected normal nodes to generate pseudo-anomalous nodes. Then it applies progressive structure perturbation to create hybrid anomalies that simulate the evolution from mild to complex perturbations. Importantly, the proposed anomaly progressive constraint loss enforces that hybrid anomalies exhibit a higher degree of abnormality than primary anomalies, enhancing the model's anomaly quantification capability. PAGE further integrates deviation constraint loss and classification loss to optimize node representations and improve prediction. Extensive experiments on benchmark datasets demonstrate that PAGE significantly outperforms state-of-the-art methods, demonstrating its effectiveness for graph anomaly detection.

6 June 2026 in Information
Verified
Journal Article
Open access
PDF file
YWYuting Wu
Yuting Wu
TGTing Guo
Ting Guo
Zhen TianZhen Tian
Zhen Tian
Zero-shot learning (ZSL) enables the recognition of unseen categories by leveraging models trained only on labeled seen-class samples in the source domain. Traditional ZSL methods typically assume identical data distributions across source and target domains—an assumption that rarely holds in real-world scenarios and causes dramatic performance degradation under domain shift. While existing generative ZSL methods have achieved promising results, they overlook the fundamental challenge of distribution shift. This paper bridges this gap by proposing GM-CDZSL, a generative framework that unifies semantic-conditioned feature synthesis and multi-source domain alignment for cross-distribution zero-shot learning. Unlike conventional approaches that only align semantic and visual features while ignoring latent domain discrepancies, our method imposes explicit distribution consistency constraints in the embedding space. Specifically, we design a set of one-vs-all domain discriminators and construct a distribution-aware loss based on empirical H-divergence to mitigate domain gaps and learn domain-invariant representations. Extensive experiments on multiple public benchmarks demonstrate that our method achieves consistent performance improvements over representative ZSL and domain generalization baselines, offering a practical solution to realistic cross-distribution zero-shot recognition tasks.

23 May 2026 in Information
Verified
Journal Article
Open access
PDF file
XLXingxuan Li
Xingxuan Li
TGTing Guo
Ting Guo
Zhen TianZhen Tian
Zhen Tian
For the challenging scenario in which only normal node labels are available in semi-supervised graph anomaly detection, existing generative methods usually synthesize abnormal nodes through random perturbation or feature interpolation. However, these methods fail to consider node abnormality comprehensively from both structural and attribute perspectives, resulting in generated pseudo-anomalies of limited quality and insufficient reliability. In order to address this problem, we propose DGAM (dual-guided anomaly mining), a framework for selecting pseudo-anomaly nodes based on the dual-index measurement of topological anomaly and feature consistency. The core of the framework is the joint anomaly evaluation module, which quantifies node anomaly through two computable metrics. The topological boundary score (TBS) measures the boundary of a node’s topological position based on the proportion of connections between a node and labeled normal nodes in its K-hop neighborhood. The feature deviation score (FDS) evaluates the consistency of a node’s local features by calculating the average cosine similarity between its features and those of its K-hop neighbors. The module selects a fixed set of nodes with higher comprehensive anomaly scores from the labeled normal nodes as pseudo-anomalies, so as to construct a training set containing explicit supervision signals. The model adopts a shared encoder architecture and jointly optimizes the classification loss based on pseudo-labels and the embedding regularization loss of the graph nodes to learn a more discriminative node representation. Experimental results on multiple real-world graph datasets show that DGAM can stably improve anomaly detection performance, effectively verifying the effectiveness of the proposed screening mechanism and joint training strategy.