基于大数据分析的APT 攻击检测研究综述

付钰, 李洪成, 吴晓平, 王甲生 - 通信学报, 2015 - infocomm-journal.com
高级持续性威胁(APT, advanced persistent threat) 已成为高安全等级网络的最主要威胁之一,
其极强的针对性, 伪装性和阶段性使传统检测技术无法有效识别, 因此新型攻击检测技术成为 …

Synopses for massive data: Samples, histograms, wavelets, sketches

G Cormode, M Garofalakis, PJ Haas… - … and Trends® in …, 2011 - nowpublishers.com
Abstract Methods for Approximate Query Processing (AQP) are essential for dealing with
massive data. They are often the only means of providing interactive response times when …

[PDF][PDF] Fast approximation of matrix coherence and statistical leverage

P Drineas, M Magdon-Ismail, MW Mahoney… - The Journal of Machine …, 2012 - jmlr.org
The statistical leverage scores of a matrix A are the squared row-norms of the matrix
containing its (top) left singular vectors and the coherence is the largest leverage score …

Sketchlearn: Relieving user burdens in approximate measurement with automated statistical inference

Q Huang, PPC Lee, Y Bao - Proceedings of the 2018 Conference of the …, 2018 - dl.acm.org
Network measurement is challenged to fulfill stringent resource requirements in the face of
massive network traffic. While approximate measurement can trade accuracy for resource …

Estimating the unseen: an n/log (n)-sample estimator for entropy and support size, shown optimal via new CLTs

G Valiant, P Valiant - Proceedings of the forty-third annual ACM …, 2011 - dl.acm.org
We introduce a new approach to characterizing the unobserved portion of a distribution,
which provides sublinear--sample estimators achieving arbitrarily small additive constant …

A framework for adversarially robust streaming algorithms

O Ben-Eliezer, R Jayaram, DP Woodruff… - ACM Journal of the ACM …, 2022 - dl.acm.org
We investigate the adversarial robustness of streaming algorithms. In this context, an
algorithm is considered robust if its performance guarantees hold even if the stream is …

Toward {Nearly-Zero-Error} sketching via compressive sensing

Q Huang, S Sheng, X Chen, Y Bao, R Zhang… - … USENIX Symposium on …, 2021 - usenix.org
Sketch algorithms have been extensively studied in the area of network measurement, given
their limited resource usage and theoretically bounded errors. However, error bounds …

Tight bounds for adversarially robust streams and sliding windows via difference estimators

DP Woodruff, S Zhou - 2021 IEEE 62nd Annual Symposium on …, 2022 - ieeexplore.ieee.org
In the adversarially robust streaming model, a stream of elements is presented to an
algorithm and is allowed to depend on the output of the algorithm at earlier times during the …

On the exact space complexity of sketching and streaming small norms

DM Kane, J Nelson, DP Woodruff - Proceedings of the twenty-first annual ACM …, 2010 - SIAM
We settle the 1-pass space complexity of (1±ε)-approximating the Lp norm, for real p with
1≤ p≤ 2, of a length-n vector updated in a length-m stream with updates to its coordinates …

The power of linear estimators

G Valiant, P Valiant - 2011 IEEE 52nd Annual Symposium on …, 2011 - ieeexplore.ieee.org
For a broad class of practically relevant distribution properties, which includes entropy and
support size, nearly all of the proposed estimators have an especially simple form. Given a …