Studies in applying PCA and wavelet algorithms for network traffic anomaly detection
Bibliographic record
Abstract
The rising complexity of network anomalies necessitates increased attention to developing new techniques for detecting those anomalies. The majority of current network and security monitoring tools utilize a signature-based approach to detect anomalies. This approach must be complemented with other methods to widen the coverage and speed of anomaly detection. In recent years, a great deal of effort has been spent on studying network traffic anomaly detection techniques by security researchers. Those techniques include the statistical analysis technique referred to as PCA (Principal Component Analysis), clustering and Wavelet-based spectral analysis of network traffic. This paper makes three key contributions to advance the state of the art in network traffic anomaly detection. First, we study the effectiveness of PCA and Wavelet algorithms in detecting network anomalies from a labeled data set known as Kyoto2006+ - providing a useful baseline for future researchers. Second, we propose a novel anomaly detection approach based on a hybrid PCA-Haar Wavelet analysis methodology. The hybrid approach uses PCA to describe the data and Haar Wavelet filtering for analysis. Finally, we study the impact of applying the techniques solely to flow-based traffic summary data to detect network anomalies. The experimental results demonstrate an improved accuracy of the hybrid approach in comparison with the two algorithms individually.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.029 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.007 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".