InfraredGP shows that a negative degree correction in a random-input spectral GNN produces clusterable embeddings, yielding fast, competitive graph partitioning without training.
Towards a profiling view for unsupervised traffic classification by exploring the statistic features and link patterns,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
InfraredGP: Efficient Graph Partitioning via Spectral Graph Neural Networks with Negative Corrections
InfraredGP shows that a negative degree correction in a random-input spectral GNN produces clusterable embeddings, yielding fast, competitive graph partitioning without training.