Tieming Chen

dblp:66/6179 · DBLP profile ↗
← Back
7ranked-venue papers in the field
0as first author
5since 2021 · last 2026
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 4Database Systems & Data Management · 2Data Mining & Knowledge Discovery · 1
YearPublicationVenuePosition
2026 PG-MoE: Provenance-Based Intrusion Detection via Graph Mixture-of-Experts and Spatio-Temporal Contrastive Learning
Xuebo Qiu, Mingqi Lv, Yimei Zhang 0003, Qijie Song, Tieming Chen
DASFAA (5)5
2026 APT-CGLP: Advanced Persistent Threat Hunting via Contrastive Graph-Language Pre-Training
abstract
Provenance-based threat hunting identifies Advanced Persistent Threats (APTs) on endpoints by correlating attack patterns described in Cyber Threat Intelligence (CTI) with provenance graphs derived from system audit logs. A fundamental challenge in this paradigm lies in the modality gap —the structural and semantic disconnect between provenance graphs and CTI reports. Prior work addresses this by framing threat hunting as a graph matching task: 1) extracting attack graphs from CTI reports, and 2) aligning them with provenance graphs. However, this pipeline incurs severe information loss during graph extraction and demands intensive manual curation, undermining scalability and effectiveness.
Xuebo Qiu, Mingqi Lv, Yimei Zhang 0003, Tieming Chen, Tiantian Zhu 0001, Qijie Song, Shouling Ji
KDD (1)4
2025 SAWD-AC: A spring-based adaptively weighted dual-stream model for aeromagnetic compensation
Yifan Li 0005, Mingqi Lv, Tieming Chen, Jinshan Xu
Inf. Sci.4
2023 Excitement surfeited turns to errors: Deep learning testing framework based on excitable neurons
Haibo Jin, Ruoxi Chen, Haibin Zheng, Jinyin Chen, Yao Cheng 0002, Yue Yu 0001, Tieming Chen, Xianglong Liu 0001
Inf. Sci.7
2023 Structure-Aware Subspace Clustering
abstract
Subspace clustering has attracted much attention because of its ability to group unlabeled high-dimensional data into multiple subspaces. Existing graph-based subspace clustering methods focus on either the sparsity of data affinity or the low rank of data affinity. Thus, the quality of data affinity plays an essential role in the performance of subspace clustering. However, the real-world data are generally high-dimensional, complex, and heterogeneous multi-source data, so that the data affinity learned by these methods cannot be completely dependent. Moreover, since these approaches always ignore the intrinsic structure of data, their grouping effect is relatively low. In this paper, we propose a novel unsupervised algorithm, called Structure-Aware Subspace Clustering (SASC), to address the above issues. SASC considers local and global correlation structures simultaneously to capture the intrinsic structure. Further, it integrates the captured structure into representation learning to gain a relatively precise data affinity. It is powerful to promote an all-around grouping effect and enhances the robustness and applicability of subspace clustering. Experiments on various benchmark datasets, including bioinformatics, handwritten digit, object image, and speech signal, demonstrate the effectiveness of the proposed algorithm.
Simin Kou, Xuesong Yin, Yigang Wang, Songcan Chen, Tieming Chen, Zizhao Wu
IEEE Trans. Knowl. Data Eng.5
2019 Discovering individual movement patterns from cell-id trajectory data by exploiting handoff features
Mingqi Lv, Ling Chen 0001, Tieming Chen, Dajian Zeng, Bin Cao 0004
Inf. Sci.3
2019 Air quality estimation by exploiting terrain features and multi-view transfer semi-supervised regression
Mingqi Lv, Yifan Li 0005, Ling Chen 0001, Tieming Chen
Inf. Sci.4