Confidence-Gated Prototype-Guided Graph Contrastive Learning for Semi-Supervised Encrypted Traffic Classification

Most existing encrypted traffic classification methods treat each traffic flow as an independent sample, overlooking the relationships shared by similar flows. This can amplify within-class variation and increase class overlap, especially when distinguishing characteristics are subtle and labeled data are limited. To address this problem, we propose PGCL-CG, a prototype-guided semi-supervised graph contrastive learning framework. We represent flow-level statistical features as a sparse, weighted k-nearest-neighbor graph and use GraphSAGE to aggregate information from neighboring flows and to capture their underlying structural relationships. We pretrain the encoder using self-supervised graph contrastive learning to obtain stable representations. We use a student–teacher architecture to produce more stable pseudo-labels and apply hierarchical density-based spatial clustering to filter out low-confidence assignments. We conduct extensive experiments on the two open datasets, demonstrating that PGCL-CG outperforms competitive baselines and remains robust even when only a small fraction of labels (e.g., 20% or 40%) is available. In particular, with only 5% of the training flows labeled, PGCL-CG achieves F1 scores of 0.820 and 0.771 on the ISCX-VPN and ISCX-nonVPN subsets, respectively, demonstrating its effectiveness under limited supervision.

Authors

Publication Details

Journal
Computers
Published
2026-11-17
DOI
https://doi.org/10.3390/computers15110847
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Confidence-Gated Prototype-Guided Graph Contrastive Learning for Semi-Supervised Encrypted Traffic Classification

Qian Deng, Yixuan Xin, Zhe Wu, Xiaodong Zang
2 links
Computers
Internet Traffic Analysis and Secure E-voting
article

Confidence-Gated Prototype-Guided Graph Contrastive Learning for Semi-Supervised Encrypted Traffic Classification

Qian Deng, Yixuan Xin, Zhe Wu, Xiaodong Zang
article en

Abstract

Most existing encrypted traffic classification methods treat each traffic flow as an independent sample, overlooking the relationships shared by similar flows. This can amplify within-class variation and increase class overlap, especially when distinguishing characteristics are subtle and labeled data are limited. To address this problem, we propose PGCL-CG, a prototype-guided semi-supervised graph contrastive learning framework. We represent flow-level statistical features as a sparse, weighted k-nearest-neighbor graph and use GraphSAGE to aggregate information from neighboring flows and to capture their underlying structural relationships. We pretrain the encoder using self-supervised graph contrastive learning to obtain stable representations. We use a student–teacher architecture to produce more stable pseudo-labels and apply hierarchical density-based spatial clustering to filter out low-confidence assignments. We conduct extensive experiments on the two open datasets, demonstrating that PGCL-CG outperforms competitive baselines and remains robust even when only a small fraction of labels (e.g., 20% or 40%) is available. In particular, with only 5% of the training flows labeled, PGCL-CG achieves F1 scores of 0.820 and 0.771 on the ISCX-VPN and ISCX-nonVPN subsets, respectively, demonstrating its effectiveness under limited supervision.

ComputersVol. 15(11)
National Natural Science Foundation of China, Natural Science Foundation of Shandong Province
Industry, innovation and infrastructure
Internet Traffic Analysis and Secure E-voting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon