Related references
Note: Only part of the references are listed.A Nonparametric Approach to Uncovering Connected Anomalies by Tree Shaped Priors
Nannan Wu et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2019)
Near-Optimal and Practical Algorithms for Graph Scan Statistics with Connectivity Constraints
Jose Cadena et al.
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2019)
Event Detection and Identification of Influential Spreaders in Social Media Data Streams
Leilei Shi et al.
BIG DATA MINING AND ANALYTICS (2018)
Parallel algorithms for anomalous subgraph detection
Jieyu Zhao et al.
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2017)
Bump Hunting in the Dark: Local Discrepancy Maximization on Graphs
Aristides Gionis et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2017)
Toward continuous pattern detection over evolving large graph with snapshot isolation
Jun Gao et al.
VLDB JOURNAL (2016)
Scalable Detection of Anomalous Patterns With Connectivity Constraints
Skyler Speakman et al.
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS (2015)
Scan Statistics for the Online Detection of Locally Anomalous Subgraphs
Joshua Neil et al.
TECHNOMETRICS (2013)
Anomaly-based network intrusion detection: Techniques, systems and challenges
P. Garcia-Teodoro et al.
COMPUTERS & SECURITY (2009)
Multivariate scan statistics for disease surveillance
Martin Kulldorff et al.
STATISTICS IN MEDICINE (2007)
Higher criticism for detecting sparse heterogeneous mixtures
D Donoho et al.
ANNALS OF STATISTICS (2004)
New dynamic algorithms for shortest path tree computation
P Narváez et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2000)
Share Paper
